Research Article

A Hybrid Bat Algorithm with Path Relinking for Capacitated Vehicle Routing Problem

Algorithm 1

Greedy_Randomized_Construction ( ).
  rand_Chosen_Vertex( );  // R is selected at random a vertex as initial solution
; // The candidate set is initialized
While       do
    _Incremental_Costs( ); //  the incremental costs are evaluated
    ;
    ;
    ;  // is created
    _Element (RCL); // a vertex is randomly selected from
    _Min_Solution( , ); // the partial tour is updated by inserting the
    vertex
    ; // the candidate set is updated
end
return