Abstract

This article refers to the traveling salesman problem (TSP)that includes pickup and delivery the cargoes under two constraints, draft limit and time windows, which is an important issue in marine logistics, in which every node shows a port with a specific time window and draft limits. The demand for each port is different in receiving and delivering cargos, and these requests are carried by a single ship. The compatibility of the two parameters, the weight of the cargo and the port's draft, is necessary for a safe visit in the port. We presented a numerical example and compared the results of solving it in two ways: integer linear programming using GAMS software and forward dynamic programming, we analyzed the different states of movement of the ship and obtained the best possible route in order to minimize the cost and then we have showed the compatibility of these two methods.

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 call

Disclaimer: 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.