International Journal of Industrial Engineering Computations (Jan 2021)

GRASP with ALNS for solving the location routing problem of infectious waste collection in the Northeast of Thailand

  • Suksee, Siwaporn,
  • Sindhuchao, Sombat

Journal volume & issue
Vol. 12, no. 3
pp. 305 – 320


Read online

This research proposes a heuristic to solve the problem of the location selection of incinerators and the vehicle routing of infectious waste collection for hospitals in the Northeast of Thailand. The developed heuristic is called the Greedy Randomized Adaptive Large Neighborhood Search Procedure (GRALNSP)and applies the principles of the Greedy Randomized Adaptive Search Procedure (GRASP) and Adaptive Large Neighborhood Search (ALNS) in the local search. The results from GRALNSP are compared with those from the exact method processed by the A Mathematical Programming Language (AMPL) program. For small-sized problems, experiments showed that both methods provided no different results with the global optimal solution, but GRALNSP required less computational time. When the problems were larger-scale and more complicated, AMPL could not find the optimal solution within the limited period of computational time while GRALNSP provided better results with much less computational time. In solving the case study with GRALNSP, the result shows that the suitable locations for opening infectious waste incinerators are the locations of Pathum Ratwongsa district, Amnat Charoen province and Nam Phong district, Khonkaen province. An incinerator with a burning capacity of 600 kilogram/hour is used at both locations. The monthly total distances for infectious waste collection are 24,055.24 and 38,401.88 kilometers, respectively, and the lowest total cost is 6,268,970.40 baht per month.