An Interactive Biobjective Method for Solving a Waste Collection Problem

Algorithm 1

Construction phase.

()    Input: , , , ;

()    Output: feasible set of routes;

()    Initialize: , , , , ;

()    repeat

()     For all compute ;

()     Define the list of seeds: ;

()     Select at random from the list of seeds;

()     , , , ;

()    until  ;

() , ;

() while    do

()  while  the capacity or the working day of the vehicles is not exceeded  do

()    For all compute ;

()   Select such as ;

()   , ;

()  end while

() end while

() return