Related Experiment Video
Updated: Oct 12, 2025

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm
Published on: December 9, 2012
Routing in waste collection: A simulated annealing algorithm for an Argentinean case study
Diego G Rossit1,2, Adrián A Toncovich1, Matías Fermani1
1Department of Engineering, Universidad Nacional del Sur, Alem Av. 1253, Bahía Blanca 8000, Argentina.
A new simulated annealing algorithm optimizes municipal solid waste collection routes, improving efficiency and reducing costs for local governments. This computer-aided tool offers a viable solution, especially for resource-limited developing countries.
Area of Science:
- Operations Research
- Computer Science
- Environmental Engineering
Background:
- Municipal Solid Waste (MSW) collection is a significant budgetary challenge for local governments worldwide.
- Optimizing waste collection routes can enhance system efficiency and reduce operational costs, particularly in resource-constrained developing nations.
- Decision-support tools are crucial for improving the management of complex urban services like waste collection.
Purpose of the Study:
- To propose and evaluate a simulated annealing algorithm for optimizing municipal solid waste collection vehicle routing.
- To compare the performance of the proposed simulated annealing algorithm against a mixed-integer programming solver, a large neighborhood search, and a genetic algorithm.
- To assess the algorithm's effectiveness on both benchmark instances and real-world data from Bahía Blanca, Argentina.
Main Methods:
- Development of a simulated annealing algorithm tailored for the waste collection vehicle routing problem.
- Comparative analysis using a commercial mixed-integer programming solver.
- Benchmarking against a state-of-the-art large neighborhood search and a genetic algorithm.
- Validation on a standard literature benchmark and real-world instances from Bahía Blanca, Argentina.
Main Results:
- The simulated annealing algorithm successfully solved all tested instances.
- Its performance was comparable to the large neighborhood search algorithm.
- The genetic algorithm demonstrated the poorest performance among the metaheuristics.
- The simulated annealing approach improved upon the solutions provided by the commercial solver for many real-world instances.
Conclusions:
- Simulated annealing presents an effective metaheuristic for optimizing municipal solid waste collection routes.
- The algorithm offers a competitive and efficient alternative to existing methods, including commercial solvers.
- This approach holds significant potential for improving waste management efficiency and cost-effectiveness, especially in developing countries.
Related Concept Videos
Design Example: Alignment of a Road Line Using GIS
Manipulation and Analysis
Design Example: Aggregate Gradation
The grading, or particle-size distribution, of sand is determined using sieve analysis, with standard sizes ranging from 150 μm to 10 mm (ASTM No. 100 sieve to 3⁄8 in. sieve). Sand is...
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Distributed Loads: Problem Solving

