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. © 2010 Elsevier B.V. All rights reserved.
| Original language | English |
|---|---|
| Pages (from-to) | 752-762 |
| Journal | International Journal of Production Economics |
| Volume | 131 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - Jun 2011 |
| Externally published | Yes |
Bibliographical note
Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].Funding
The authors would like to thank Mr. Sunny Chan of Sinoway Shipping Ltd. for explaining to us the details of feeder vessel operation. This research work was supported in part by the Research Grants Council of Hong Kong under Grant PolyU5258/06E.
Research Keywords
- Berthing time
- Column generation
- Dynamic programming
- Pickup and delivery
- Ship routing
RGC Funding Information
- RGC-funded
Fingerprint
Dive into the research topics of 'Ship routing problem with berthing time clash avoidance constraints'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver