Abstract
In spent computers reverse logistics, an important planning problem is the location optimization of landfills or treatment facilities for recovering/reusing used products or materials. Combining with the spent computers' taking-back characteristics, after a brief introduction to the basic concepts of reverse logistics, we present a two-level location problem with three types of facility to be located in a specific reverse logistics system. For this problem, we propose a 0-1 mixed integer programming model. Then, an algorithm based on Lagrangian heuristics is developed. Finally, it takes Tai'an city in Shandong Province in China as a case to prove the availability of the model.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
