A Heuristic Procedure for a Ship Routing and Scheduling Problem with Variable Speed and Discretized Time Windows

Pseudocode 1

Pseudocode of the solution procedure.

Ship route Procedure

Input: 𝑃∶= a problem instance (𝑁, 𝑉, 𝐷_𝑛, 𝐵, 𝐴, 𝑐_𝑖𝑗𝑘)

Output: 𝑥^∗∶= Route for each ship 𝑘,

or empty set with no feasible solution.

   𝑥 ← Construction();

Set 𝑓^∗= 𝑓(𝑥);  𝑥^∗=𝑥

 Do until a stopping condition is met

  𝑥 ← Local-Search();

    If 𝑓(𝑥)<𝑓^∗ then

   𝑓^∗=𝑓(𝑥) and 𝑥^∗=𝑥;

 End Do

Return 𝑥^∗