Solving an urban waste collection problem using ants heuristics

Authors:
Joaquín Bautista;Elena Fernández;Jordi Pereira
Affiliations:
Nissan Chair, Universitat Politècnica de Catalunya, Barcelona, Spain;Dpt. d' Estadística i Investigació Operativa, Universitat Politècnica de Catalunya, Barcelona, Spain;Departament d'Organització d'Empreses, Universitat Politècnica de Catalunya, Barcelona, Spain
Venue:
Computers and Operations Research
Year:
2008

Citing 12
Cited 5

Modeling and solving several classes of arc routing problems as traveling salesman problems

Computers and Operations Research
The Capacitated Arc Routing Problem: Valid Inequalities and Facets

Computational Optimization and Applications
An efficient algorithm for computing least cost paths with turn constraints

Information Processing Letters
Integer Programming Formulation of Traveling Salesman Problems

Journal of the ACM (JACM)
A Theorem on Boolean Matrices

Journal of the ACM (JACM)
Algorithm 97: Shortest path

Communications of the ACM
The Rural Postman Problem on mixed graphs with turn penalties

Computers and Operations Research
A Genetic Algorithm for the Capacitated Arc Routing Problem and Its Extensions

Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Ant Colony Optimization

Ant Colony Optimization
Lower and upper bounds for the mixed capacitated arc routing problem

Computers and Operations Research
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints

Operations Research Letters

Lower bounds for the mixed capacitated arc routing problem

Computers and Operations Research
The mixed capacitated general routing problem with turn penalties

Expert Systems with Applications: An International Journal
Formulations and Branch-and-Cut Algorithms for the Generalized Vehicle Routing Problem

Transportation Science
The capacitated general windy routing problem with turn penalties

Operations Research Letters
Efficient solution of capacitated arc routing problems with a limited computational budget

AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper describes the methodology that we have applied for the solution of an urban waste collection problem in the municipality of Sant Boi de Llobregat, within the metropolitan area of Barcelona (Spain). The basic nature of the considered problem is that of a capacitated arc routing problem, although it has several specific characteristics, mainly derived from traffic regulations. We present the model that we have built for the problem, which results after an appropriate transformation of the problem into a node routing one. We also present the ant colonies heuristics that we have used to obtain the solutions to the problem. These combine constructive methods, based on nearest neighbor and on nearest insertion, with a local search that explores various neighborhoods. The application of the proposed methods gives results that improve considerably the ones that were previously used in the municipality.