Paper Info
Title
A hybrid GRASP-VNS for ship routing and scheduling problem with discretized time windows
Abstract
This paper addresses the Ship Routing and Scheduling Problem with Discretized Time Windows. Being one of the most relevant and challenging problems faced by decision makers from shipping companies, this tramp shipping problem lies in determining the set of contracts that should be served by each ship and the time windows that ships should use to serve each contract, with the aim of minimizing total costs. The use of discretized time windows allows for the consideration of a broad variety of features and practical constraints in a simple way. In order to solve this problem we propose a hybridization of a Greedy Randomized Adaptive Search Procedure and a Variable Neighborhood Search, which improves previous heuristics results found in the literature and requires very short computational time. Moreover, this algorithm is able to achieve the optimal results for many instances, demonstrating its good performance.
Year
DOI
Venue
2015
10.1016/j.engappai.2015.07.013
Engineering Applications of Artificial Intelligence
Keywords
DocType
Volume
Ship routing and scheduling problem,Tramp shipping,GRASP,Variable Neighborhood Search
Journal
45
Issue
ISSN
Citations 
C
0952-1976
7
PageRank 
References 
Authors
0.51
21
5
Name
Order
Citations
PageRank
Jésica de Armas19913.98
Eduardo Lalla-Ruiz215018.82
Christopher ExpóSito-Izquierdo313414.23
Dario Landa Silva431628.38
Belén Melián-batista537230.00