Abstract

Reverse logistics (RL) emerges as a hot topic in both research and business with the increasing attention on the collection and recycling of the waste products. Since Location and Routing Problem (LRP) in RL is NP-complete, heuristic algorithms, especially those built upon swarm intelligence, are very popular in this research. In this paper, both Vehicle Routing Problem (RP) and Location Allocation Problem (LAP) of RL are considered as a whole. First, the features of LRP in RL are analyzed. Second, a mathematical model of the problem is developed. Then, a novel discrete artificial bee colony (ABC) algorithm with greedy adjustment is proposed. The experimental results show that the new algorithm can approach the optimal solutions efficiently and effectively.

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.