Multiobjective Optimization for Multimode Transportation Problems

Algorithm 1

An -constraint based method for solving (with cumulative distance).

Data: problem with objectives (Eq. (9)) and

    (Eq. (10)) and constraints set = q. (11)-(18)

Result: the Pareto front , stored in

begin

  :=

  :=

  while true do

   add constraint to

   add constraint to

   solve problem P:

   if P not feasible then End

   solve problem P:

   if P not feasible then End

   add point to

   q.(21)

   := -1

   := +1

  end

end