A Three-Stage Saving-Based Heuristic for Vehicle Routing Problem with Time Windows and Stochastic Travel Times

Algorithm 1

Main framework of the suggested heuristic TSH.

(1) Set Solutions = ;

(2) For to step , do:

(3)  Transform VRPTWSTT to a deterministic VRPTW (Section 3.2);

(4)  Solve the VRPTW() by using an improved saving-based heuristic in order to get an

     initial solution IS (Section 3.3);

(5)  Improve the initial solution IS by a solution improvement procedure and then multiple

    solutions can be obtained, the minimum expected total cost of which is inserted into

    the set Solutions (Section 3.4);

(6) Next ;

(7) Select and return the solution that has the minimum expected total cost from Solutions.