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.
A Ship Routing and Scheduling Problem Considering Pickup and Delivery, Time Windows and Draft Limit
2019-01-01
1183219 byte
Conference paper
Electronic Resource
English
In-port multi-ship routing and scheduling problem with draft limits
Taylor & Francis Verlag | 2021
|Freight Consolidation Problem with Time Windows, Pickup and Delivery Sequence
DOAJ | 2019
|