Abstract

In recent years, stricter environmental regulations, as well as an increased public concern, have progressively forced new landfills to be located more and more away from urban centers. This has stimulated the use of solid waste transfer stations, where the solid waste is transferred from small collection vehicles to large transportation vehicles. In this paper, we tackle the problem of determining the routes for both collection and transportation vehicles, as well as their synchronization at the transfer stations. We divide the problem into two phases and propose an exact approach utilizing a mathematical formulation, as well as a constructive heuristic and a matheuristic for the first phase, and a heuristic approach for the second phase. Computational results show that the approach combining the matheuristic for the collection phase with the heuristic for the transportation phase is able to achieve consistent reductions in terms of number of collection vehicles needed.

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.