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...

Popoln opis

Bibliografske podrobnosti

Principais autores:	Khaled Alhamad, Azizah Alrashidi, Sameh Alkharashi
Format:	Artigo
Jezik:	Inglês
Izdano:	Taylor & Francis Group 2019-01-01
Serija:	Cogent Business & Management
Teme:	maritime transportation scheduling routing tabu search integer programming
Online dostop:	http://dx.doi.org/10.1080/23311975.2019.1616351
Oznake:	Označite Brez oznak, prvi označite!