PortLib Instances for the Port Scheduling Problem. In the following we present the PortLib instances for the Port Scheduling Problem (PSP), which have been presented in the paper An ALNS Heuristic for Routing and Scehduling Feeder Vessels in Multi-terminal Ports, written by Erik Hellsten, David Sacramento and David Pisinger. The PSP represents a new scheduling problem for feeder vessels in multi-terminal ports, which has been defined in close collaboration with the industry. The proposed problem is a General Shop-like problem, and it accounts for most of the practical restrictions faced by the carriers in scheduling the operations. Given a fleet of feeder vessels, which each of them has a number of operations to perform at different terminals, and each terminal can only serve one vessels at a time, the task is to define an operational schedule, i.e. a starting time for each operation, which satisfies the time window and precedence constraints as well as minimises the departure times of the vessels and packs the schedule as tight as possible.
Keywords for this software
References in zbMATH (referenced in 1 article , 1 standard article )
Showing result 1 of 1.
- Sacramento, David; Solnon, Christine; Pisinger, David: Constraint programming and local search heuristic: a matheuristic approach for routing and scheduling feeder vessels in multi-terminal ports (2020)