Solving an urban waste collection problem using ants heuristics

DOI10.1016/j.cor.2007.01.029zbMath1144.90516MaRDI QIDQ2475858

Joaquín Bautista, Elena Fernández, Jordi Pereira

Publication date: 11 March 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2117/1098

zbMATH Keywords

arc routing; ants heuristics; urban waste management

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

Related Items

Lower bounds for the mixed capacitated arc routing problem

Uses Software

• Algorithm 97

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An efficient algorithm for computing least cost paths with turn constraints
• A branch and bound algorithm for the capacitated vehicle routing problem
• Modeling and solving several classes of arc routing problems as traveling salesman problems
• The capacitated arc routing problem: Valid inequalities and facets
• An efficient transformation of the generalized vehicle routing problem
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• Lower and upper bounds for the mixed capacitated arc routing problem
• Integer Programming Formulation of Traveling Salesman Problems
• The Capacitated Canadian Postman Problem
• Capacitated arc routing problems
• The Capacitated Arc Routing Problem: Lower bounds
• An Efficient Transformation Of The Generalized Traveling Salesman Problem
• A Theorem on Boolean Matrices
• The Rural Postman Problem on mixed graphs with turn penalties