Papers › Modeling and solving an integrated periodic vehicle routing and capacitated facility...

Modeling and solving an integrated periodic vehicle routing and capacitated facility location problem in the context of solid waste collection

14 Apr 2025arXiv:2504.10648archive 2025-07-28

Begoña González, Diego Rossit, Mariano Frutos, Máximo Méndez

Few activities are as crucial in urban environments as waste management. Mismanagement of waste can cause significant economic, social, and environmental damage. However, waste management is often a complex system to manage and therefore where computational decision-support tools can play a pivotal role in assisting managers to make faster and better decisions. In this sense, this article proposes, on the one hand, a unified optimization model to address two common waste management system optimization problem: the determination of the capacity of waste bins in the collection network and the design and scheduling of collection routes. The integration of these two problems is not usual in the literature since each of them separately is already a major computational challenge. On the other hand, two improved exact formulations based on mathematical programming and a genetic algorithm (GA) are provided to solve this proposed unified optimization model. It should be noted that the GA considers a mixed chromosome representation of the solutions combining binary and integer alleles, in order to solve realistic instances of this complex problem. Also, different genetic operators have been tested to study which combination of them obtained better results in execution times on the order of that of the exact solvers. The obtained results show that the proposed GA is able to match the results of exact solvers on small instances and, in addition, can obtain feasible solutions on large instances, where exact formulations are not applicable, in reasonable computation times.

PaperPDFCode

Code

diegorossit/anor-s-24-01950 officialmentioned in paper report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

ManagementScheduling

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

GA

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections