Abstract

This paper studies the definition of dynamic routes regarding the waste collection problem. Based on access to real-time information, provided by sensors located at waste bin containers, a Vehicle Routing Problem with Profits (VRPP) solution approach is developed. This aims for the maximization of waste collected while minimizing the total distance travelled, resulting in a maximization of profit. Different scenarios are studied, based on real data. The conclusions clearly show that the usage of real-time information on containers fill-levels, coupled with an optimization approach to define dynamic routes potentially increases the profit of waste management companies.

Full Text
Paper version not known

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.