In-port multi-ship routing and scheduling problem with draft limits
Mehdi Mahmoodjanloo,
Gang Chen,
Sobhan Asian,
Seyed Hossein Iranmanesh and
Reza Tavakkoli-Moghaddam
Maritime Policy & Management, 2021, vol. 48, issue 7, 966-987
Abstract:
This paper addresses an in-port multi-ship routing and scheduling problem in maritime transportation. The key objective is to find an optimal routing and schedule for multiple ships that are planned to pick up or deliver cargos located in the various terminals of a port with different draft limits. Using the multiple traveling salesman problem (mTSP) as a base, we formulate a multi-ship routing and scheduling model with draft limits and time windows constraints. To solve the developed model, a two-stage solution method based on dynamic programming and branch-and-bound algorithms is developed. The solution approach is applied to 41 real-sized problem instances. Our experiments revealed that the proposed method outperforms CPLEX by accurately solving the problem instances in a reasonable time. The formulated problem and presented solution can be implemented in fleet operations of autonomous ships in smart maritime transportation systems of the future.
Date: 2021
References: Add references at CitEc
Citations: View citations in EconPapers (1)
Downloads: (external link)
http://hdl.handle.net/10.1080/03088839.2020.1783465 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:taf:marpmg:v:48:y:2021:i:7:p:966-987
Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/TMPM20
DOI: 10.1080/03088839.2020.1783465
Access Statistics for this article
Maritime Policy & Management is currently edited by Dr Kevin Li and Heather Leggate McLaughlin
More articles in Maritime Policy & Management from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().