Mathematical Model and Simulated Annealing Algorithm for the Two-Dimensional Loading Heterogeneous Fixed Fleet Vehicle Routing Problem

Algorithm 1

Pseudocode for constructing an initial solution.

 for each customer do

  ;

  while customer cannot be served by vehicle do

   ;

 end while

  insert customer into set ;

 end for

 fortodo

  ;

 end for

 Route construction:

 forto 1 do

  while is not empty do

   if it is possible to insert some customer of set into any route () then

    Execute the feasible insertion of customer into route , which minimizes the insertion cost;

    Delete customer from the set ;

   else

    fortodo

     ;

     Empty route ;

    end for

    Randomly select a vehicle and a customer ;

    Insert customer into route ;

    Delete customer from the set ;

    go to Route construction;

   end if

  end while

 end for

 return generated solution