Solving an urban waste collection problem using ants heuristics
From MaRDI portal
Publication:2475858
DOI10.1016/j.cor.2007.01.029zbMath1144.90516OpenAlexW2041841351MaRDI QIDQ2475858
Jordi Pereira, Elena Fernández, Joaquín Bautista
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
Related Items
New large-scale data instances for CARP and new variations of CARP, The mixed capacitated arc routing problem with non-overlapping routes, Sustainable operations, Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm, Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities, A bi-objective modeling approach applied to an urban semi-desirable facility location problem, A novel model for sustainable waste collection arc routing problem: Pareto-based algorithms, The capacitated general windy routing problem with turn penalties, Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study, Recent results on Arc Routing Problems: An annotated bibliography, Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure, Lower bounds for the mixed capacitated arc routing problem
Uses Software
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