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...
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | article |
| Lenguaje: | EN |
| Publicado: |
Taylor & Francis Group
2019
|
| Materias: | |
| Acceso en línea: | https://doaj.org/article/ec82714224a24cdf87d4fa6021f7fabe |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|