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

Begoña González (), Diego Rossit (), Mariano Frutos () and Máximo Méndez ()
Additional contact information
Begoña González: Universidad de Las Palmas de Gran Canaria
Diego Rossit: Universidad Nacional del Sur-CONICET
Mariano Frutos: Universidad Nacional del Sur-CONICET
Máximo Méndez: Universidad de Las Palmas de Gran Canaria

Annals of Operations Research, 2025, vol. 350, issue 3, No 4, 979-1015

Abstract: Abstract 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. Two improved exact formulations based on mathematical programming and two metaheuristic methods are provided to solve this proposed unified optimization model. It should be noted that the metaheuristics consider a mixed chromosome representation of the solutions combining binary and integer alleles, in order to solve realistic instances of this complex problem. Different parameters of the metaheuristics considered – a Genetic Algorithm and a Simulated Annealing algorithm – 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 achieved results show that the proposed metaheuristic methods perform efficient on large instances, where exact formulations are not applicable, and offer feasible, high-quality solutions in reasonable calculation times.

Keywords: Waste management; Periodic capacitated vehicle routing problem; Capacitated facility location problem; Mixed integer programming; Genetic algorithms; Simulated annealing algorithms (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10479-025-06626-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:350:y:2025:i:3:d:10.1007_s10479-025-06626-4

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-025-06626-4

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().