Abstract
This paper investigates a waste collection problem with the consideration of dynamic disposal trips. A hybrid artificial bee colony (ABC)-based approach is developed to handle this problem. We hybrid the ABC algorithm with the variable neighborhood descent algorithm to generate the better optimum-seeking performance, and propose heuristic procedures to choose disposal trip dynamically and calculate the carbon emission in waste collection process. The effectiveness of the proposed algorithm is validated by numerical experiments. The experimental results show that (1) the proposed hybrid ABC algorithm can solve the investigated problem effectively; (2) the algorithm exhibits better optimum-seeking performance than several traditional metaheuristics; (3) dynamic disposal trips should be considered in practice because it reduces the carbon emission at most 7.29% for investigated instances.
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 callDisclaimer: 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.
