Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/9565
Title: Ship routing problem with berthing time clash avoidance constraints
Authors: Pang, KW 
Xu, Z 
Li, CL 
Issue Date: 2011
Source: International journal of production economics, 2011, v. 131, no. 2, p. 752-762
Abstract: We consider a ship routing problem in which multiple vessels have to perform pickups and deliveries of cargoes at various locations. The loading and unloading time of cargoes at pickup and delivery locations is significant, and at each of these locations we need to assign a time slot to each vessel to perform the loading/unloading task so as to avoid time clashes. This problem is motivated by the operations of feeder vessels and company-owned cargo terminals, where the shipping company wishes to coordinate the routing and the berthing time of its vessels. We develop a heuristic algorithm for the problem using set partitioning formulation and column generation techniques. The effectiveness of the heuristic is tested via extensive computational experiments.
Keywords: Berthing time
Column generation
Dynamic programming
Pickup and delivery
Ship routing
Publisher: Elsevier
Journal: International journal of production economics 
ISSN: 0925-5273
DOI: 10.1016/j.ijpe.2011.03.013
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

23
Last Week
0
Last month
0
Citations as of Sep 3, 2020

WEB OF SCIENCETM
Citations

20
Last Week
0
Last month
0
Citations as of Sep 14, 2020

Page view(s)

190
Last Week
6
Last month
Citations as of Sep 15, 2020

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.