Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
