Metaheuristic algorithm for ship routing and scheduling problems with time window
This paper describes a Tabu Search (TS) heuristic for a Ship Routing and Scheduling Problem (SRSP). The method was developed to address the problem of loading cargos for many customers using heterogeneous ships. Constraints include delivery time windows imposed by customers, the time horizon by whic...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2019-01-01
|
| Series: | Cogent Business & Management |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1080/23311975.2019.1616351 |