Feeder vessel routing and transshipment coordination at a congested hub port
With increasing container-shipping traffic, congestion at transshipment hub ports happens from time to time incurring longer-than-expected waiting time for vessels and loss of transshipment connections. This situation is even worse for feeder companies, due to their relatively lower berthing priorit...
Saved in:
Main Authors: | , , |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2021
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/6243 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
id |
sg-smu-ink.sis_research-7246 |
---|---|
record_format |
dspace |
spelling |
sg-smu-ink.sis_research-72462021-11-05T03:16:03Z Feeder vessel routing and transshipment coordination at a congested hub port JIN, Jiangang MENG, Qiang WANG, Hai With increasing container-shipping traffic, congestion at transshipment hub ports happens from time to time incurring longer-than-expected waiting time for vessels and loss of transshipment connections. This situation is even worse for feeder companies, due to their relatively lower berthing priority. It is essential to design the feeder vessel routes and schedules in response to hub port congestion while ensuring efficient transshipment connection with their connecting long-haul services. In this paper, we study the vessel routing and transshipment coordination problem for a feeder liner company where only limited choices of berthing time slots are available at the hub port. We proposed an arc-based mixed integer linear programming model and a set partitioning model with the objective of minimizing the total operating and transshipment connection cost. Two solution approaches are developed (1) a branch-&-price exact algorithm that can solve instances with up to 30 ports to optimality within reasonable computational time; and (2) a column generation heuristic method that yields high-quality near-optimal solutions very efficiently without having to implement a full-scale branch-&-bound search. Computational experiments based on a real-world shipping network and randomly generated test instances confirm the effectiveness and efficiency of the solution approaches. It is also demonstrated that, by integrating the hub port calling time decision with feeder vessel routing, transshipment coordination can be significantly enhanced even under hub port congestion situations 2021-09-01T07:00:00Z text https://ink.library.smu.edu.sg/sis_research/6243 info:doi/10.1016/j.trb.2021.07.002 Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Maritime transport Liner shipping Feeder vessel Routing Port congestion Column generation Branch-&-price OS and Networks Transportation |
institution |
Singapore Management University |
building |
SMU Libraries |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
SMU Libraries |
collection |
InK@SMU |
language |
English |
topic |
Maritime transport Liner shipping Feeder vessel Routing Port congestion Column generation Branch-&-price OS and Networks Transportation |
spellingShingle |
Maritime transport Liner shipping Feeder vessel Routing Port congestion Column generation Branch-&-price OS and Networks Transportation JIN, Jiangang MENG, Qiang WANG, Hai Feeder vessel routing and transshipment coordination at a congested hub port |
description |
With increasing container-shipping traffic, congestion at transshipment hub ports happens from time to time incurring longer-than-expected waiting time for vessels and loss of transshipment connections. This situation is even worse for feeder companies, due to their relatively lower berthing priority. It is essential to design the feeder vessel routes and schedules in response to hub port congestion while ensuring efficient transshipment connection with their connecting long-haul services. In this paper, we study the vessel routing and transshipment coordination problem for a feeder liner company where only limited choices of berthing time slots are available at the hub port. We proposed an arc-based mixed integer linear programming model and a set partitioning model with the objective of minimizing the total operating and transshipment connection cost. Two solution approaches are developed (1) a branch-&-price exact algorithm that can solve instances with up to 30 ports to optimality within reasonable computational time; and (2) a column generation heuristic method that yields high-quality near-optimal solutions very efficiently without having to implement a full-scale branch-&-bound search. Computational experiments based on a real-world shipping network and randomly generated test instances confirm the effectiveness and efficiency of the solution approaches. It is also demonstrated that, by integrating the hub port calling time decision with feeder vessel routing, transshipment coordination can be significantly enhanced even under hub port congestion situations |
format |
text |
author |
JIN, Jiangang MENG, Qiang WANG, Hai |
author_facet |
JIN, Jiangang MENG, Qiang WANG, Hai |
author_sort |
JIN, Jiangang |
title |
Feeder vessel routing and transshipment coordination at a congested hub port |
title_short |
Feeder vessel routing and transshipment coordination at a congested hub port |
title_full |
Feeder vessel routing and transshipment coordination at a congested hub port |
title_fullStr |
Feeder vessel routing and transshipment coordination at a congested hub port |
title_full_unstemmed |
Feeder vessel routing and transshipment coordination at a congested hub port |
title_sort |
feeder vessel routing and transshipment coordination at a congested hub port |
publisher |
Institutional Knowledge at Singapore Management University |
publishDate |
2021 |
url |
https://ink.library.smu.edu.sg/sis_research/6243 |
_version_ |
1770575899164409856 |