Fig. 2: Flowchart for the dynamic optimisation.
From: Dynamic fleet management of waterborne vessels with mixed passenger and parcel services
The flowchart illustrates a dynamic optimisation algorithm with a rolling horizon for vessel routing and scheduling. It begins with the scheduling time horizon, followed by iteratively updating the time step (t = t + 1). At each step, the algorithm solves a static subproblem, optimizing routing and scheduling based on current conditions. If new requests arise, the system updates the statuses of vessels (including location, loading, battery level, and routing plan) and request statuses (classified as failed, served, serving, assigned, or unassigned). The process continues until the final time step is reached, at which point the scheduling horizon ends. This framework ensures adaptability to new information, enabling real-time decision-making for vessel operations.
