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

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Khaled Alhamad, Azizah Alrashidi, Sameh Alkharashi
Formato:	article
Lenguaje:	EN
Publicado:	Taylor & Francis Group 2019
Materias:	maritime transportation scheduling routing tabu search integer programming Business HF5001-6182 Management. Industrial management HD28-70
Acceso en línea:	https://doaj.org/article/ec82714224a24cdf87d4fa6021f7fabe
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:ec82714224a24cdf87d4fa6021f7fabe
record_format	dspace
spelling	oai:doaj.org-article:ec82714224a24cdf87d4fa6021f7fabe2021-12-02T18:31:22ZMetaheuristic algorithm for ship routing and scheduling problems with time window2331-197510.1080/23311975.2019.1616351https://doaj.org/article/ec82714224a24cdf87d4fa6021f7fabe2019-01-01T00:00:00Zhttp://dx.doi.org/10.1080/23311975.2019.1616351https://doaj.org/toc/2331-1975This 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 which all deliveries must be made, and ship capacities. The proposed algorithm aims to minimize the overall cost of shipping operation without any violations. The TS algorithm is compared with a similar method that uses the Set Partitioning Problem (SPP) in terms of solution quality and computational time. The results of a computational investigation are presented. Solution quality and execution time are explored with respect to problem size and parameters controlling the TS such neighborhood size. It is found that while the SPP method solves small-scale problems efficiently, treating large-scale problems with this method becomes complicated due to computational problems; however, the TS method can overcome this challenge. Furthermore, TS consistently returns near-optimal solution within a reasonable time.Khaled AlhamadAzizah AlrashidiSameh AlkharashiTaylor & Francis Grouparticlemaritime transportationschedulingroutingtabu searchinteger programmingBusinessHF5001-6182Management. Industrial managementHD28-70ENCogent Business & Management, Vol 6, Iss 1 (2019)
institution	DOAJ
collection	DOAJ
language	EN
topic	maritime transportation scheduling routing tabu search integer programming Business HF5001-6182 Management. Industrial management HD28-70
spellingShingle	maritime transportation scheduling routing tabu search integer programming Business HF5001-6182 Management. Industrial management HD28-70 Khaled Alhamad Azizah Alrashidi Sameh Alkharashi Metaheuristic algorithm for ship routing and scheduling problems with time window
description	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 which all deliveries must be made, and ship capacities. The proposed algorithm aims to minimize the overall cost of shipping operation without any violations. The TS algorithm is compared with a similar method that uses the Set Partitioning Problem (SPP) in terms of solution quality and computational time. The results of a computational investigation are presented. Solution quality and execution time are explored with respect to problem size and parameters controlling the TS such neighborhood size. It is found that while the SPP method solves small-scale problems efficiently, treating large-scale problems with this method becomes complicated due to computational problems; however, the TS method can overcome this challenge. Furthermore, TS consistently returns near-optimal solution within a reasonable time.
format	article
author	Khaled Alhamad Azizah Alrashidi Sameh Alkharashi
author_facet	Khaled Alhamad Azizah Alrashidi Sameh Alkharashi
author_sort	Khaled Alhamad
title	Metaheuristic algorithm for ship routing and scheduling problems with time window
title_short	Metaheuristic algorithm for ship routing and scheduling problems with time window
title_full	Metaheuristic algorithm for ship routing and scheduling problems with time window
title_fullStr	Metaheuristic algorithm for ship routing and scheduling problems with time window
title_full_unstemmed	Metaheuristic algorithm for ship routing and scheduling problems with time window
title_sort	metaheuristic algorithm for ship routing and scheduling problems with time window
publisher	Taylor & Francis Group
publishDate	2019
url	https://doaj.org/article/ec82714224a24cdf87d4fa6021f7fabe
work_keys_str_mv	AT khaledalhamad metaheuristicalgorithmforshiproutingandschedulingproblemswithtimewindow AT azizahalrashidi metaheuristicalgorithmforshiproutingandschedulingproblemswithtimewindow AT samehalkharashi metaheuristicalgorithmforshiproutingandschedulingproblemswithtimewindow
_version_	1718378014223368192

Metaheuristic algorithm for ship routing and scheduling problems with time window

Ejemplares similares