Solving a Closed-Loop Location-Inventory-Routing Problem with Mixed Quality Defects Returns in E-Commerce by Hybrid Ant Colony Optimization Algorithm

Pseudocode 2

Pseudocode of the proposed HACO.

Procedure: HACO for LIRP

Input: coordinates of nodes, demands and returns of DPs, MC parameters, vehicle capacity, HACO parameters

Output: the best solution (include routes, MCs locations, order times and order size)

Begin

Take

while

  for 1 to

     Foraging Behavior of Ants

    Calculate individual total cost Tcost()

  end

    Tcost_best =

  for 1 to Neighbor range

   Scout bee searching the neighbor range

   make

   if

    ;

   else

    exchange()

   end

    if Tcost() < Tcost_best

    Tcost_best = Tcost()

    end

  end

    for 1 to

     if Tcost() > Tcost_ave

      for 1 to

      end

     end

    end

end

Output: the best solution

End