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...
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | article |
| Langue: | EN |
| Publié: |
Taylor & Francis Group
2019
|
| Sujets: | |
| Accès en ligne: | https://doaj.org/article/ec82714224a24cdf87d4fa6021f7fabe |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|