A heuristic procedure for a ship routing and scheduling problem with variable speed and discretized time windows

Krystel K. Castillo-Villar, Rosa G. González-Ramírez, Pablo Miranda González, Neale R. Smith

Resultado de la investigación: Article

2 Citas (Scopus)

Resumen

This paper develops a heuristic algorithm for solving a routing and scheduling problem for tramp shipping with discretized time windows. The problem consists of determining the set of cargoes that should be served by each ship, the arrival, departure, and waiting times at each port, while minimizing total costs. The heuristic proposed is based on a variable neighborhood search, considering a number of neighborhood structures to find a solution to the problem. We present computational results, and, for comparison purposes, we consider instances that can be solved directly by CPLEX to test the performance of the proposed heuristic. The heuristics achieves good solution quality with reasonable computational times. Our computational results are encouraging and establish that our heuristic can be utilized to solve large real-size instances.

Idioma originalEnglish
Número de artículo750232
PublicaciónMathematical Problems in Engineering
Volumen2014
DOI
EstadoPublished - 1 ene 2014

Huella dactilar

Time Windows
Routing Problem
Heuristic algorithms
Freight transportation
Ship
Scheduling Problem
Ships
Scheduling
Heuristics
Computational Results
Costs
Variable Neighborhood Search
Waiting Time
Heuristic algorithm

ASJC Scopus subject areas

  • Mathematics(all)
  • Engineering(all)

Citar esto

@article{f91c40ca902c43ae8a1dad8150ce9659,
title = "A heuristic procedure for a ship routing and scheduling problem with variable speed and discretized time windows",
abstract = "This paper develops a heuristic algorithm for solving a routing and scheduling problem for tramp shipping with discretized time windows. The problem consists of determining the set of cargoes that should be served by each ship, the arrival, departure, and waiting times at each port, while minimizing total costs. The heuristic proposed is based on a variable neighborhood search, considering a number of neighborhood structures to find a solution to the problem. We present computational results, and, for comparison purposes, we consider instances that can be solved directly by CPLEX to test the performance of the proposed heuristic. The heuristics achieves good solution quality with reasonable computational times. Our computational results are encouraging and establish that our heuristic can be utilized to solve large real-size instances.",
author = "Castillo-Villar, {Krystel K.} and Gonz{\'a}lez-Ram{\'i}rez, {Rosa G.} and {Miranda Gonz{\'a}lez}, Pablo and Smith, {Neale R.}",
year = "2014",
month = "1",
day = "1",
doi = "10.1155/2014/750232",
language = "English",
volume = "2014",
journal = "Mathematical Problems in Engineering",
issn = "1024-123X",
publisher = "Hindawi Publishing Corporation",

}

A heuristic procedure for a ship routing and scheduling problem with variable speed and discretized time windows. / Castillo-Villar, Krystel K.; González-Ramírez, Rosa G.; Miranda González, Pablo; Smith, Neale R.

En: Mathematical Problems in Engineering, Vol. 2014, 750232, 01.01.2014.

Resultado de la investigación: Article

TY - JOUR

T1 - A heuristic procedure for a ship routing and scheduling problem with variable speed and discretized time windows

AU - Castillo-Villar, Krystel K.

AU - González-Ramírez, Rosa G.

AU - Miranda González, Pablo

AU - Smith, Neale R.

PY - 2014/1/1

Y1 - 2014/1/1

N2 - This paper develops a heuristic algorithm for solving a routing and scheduling problem for tramp shipping with discretized time windows. The problem consists of determining the set of cargoes that should be served by each ship, the arrival, departure, and waiting times at each port, while minimizing total costs. The heuristic proposed is based on a variable neighborhood search, considering a number of neighborhood structures to find a solution to the problem. We present computational results, and, for comparison purposes, we consider instances that can be solved directly by CPLEX to test the performance of the proposed heuristic. The heuristics achieves good solution quality with reasonable computational times. Our computational results are encouraging and establish that our heuristic can be utilized to solve large real-size instances.

AB - This paper develops a heuristic algorithm for solving a routing and scheduling problem for tramp shipping with discretized time windows. The problem consists of determining the set of cargoes that should be served by each ship, the arrival, departure, and waiting times at each port, while minimizing total costs. The heuristic proposed is based on a variable neighborhood search, considering a number of neighborhood structures to find a solution to the problem. We present computational results, and, for comparison purposes, we consider instances that can be solved directly by CPLEX to test the performance of the proposed heuristic. The heuristics achieves good solution quality with reasonable computational times. Our computational results are encouraging and establish that our heuristic can be utilized to solve large real-size instances.

UR - http://www.scopus.com/inward/record.url?scp=84899910105&partnerID=8YFLogxK

U2 - 10.1155/2014/750232

DO - 10.1155/2014/750232

M3 - Article

AN - SCOPUS:84899910105

VL - 2014

JO - Mathematical Problems in Engineering

JF - Mathematical Problems in Engineering

SN - 1024-123X

M1 - 750232

ER -