The capacitated arc routing problem with intermediate facilities
From MaRDI portal
Publication:2719845
DOI10.1002/net.3zbMath0981.90059OpenAlexW1989850675MaRDI QIDQ2719845
Gennaro Improta, Gianpaolo Ghiani, Gilbert Laporte
Publication date: 24 March 2002
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3
Related Items
New large-scale data instances for CARP and new variations of CARP, Heuristic method for a mixed capacitated arc routing problem: A refuse collection application, A survey of variants and extensions of the location-routing problem, A memetic algorithm for the travelling salesperson problem with hotel selection, The capacitated arc routing problem with refill points, Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities, Arc routing problems with time-dependent service costs, An improved multi-objective framework for the rich arc routing problem, On matchings, T‐joins, and arc routing in road networks, Arc routing problems: A review of the past, present, and future, A survey of the standard location-routing problem, Solving vehicle routing problems with intermediate stops using VRPSolver models, Fast upper and lower bounds for a large‐scale real‐world arc routing problem, A Decade of Capacitated Arc Routing, A variable neighborhood search for the capacitated arc routing problem with intermediate facilities, Splitting procedures for the mixed capacitated arc routing problem under time restrictions with intermediate facilities, Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions, Recent results on Arc Routing Problems: An annotated bibliography, A memetic algorithm for the orienteering problem with hotel selection, A variable neighborhood descent algorithm for a real waste collection problem with mobile depots, Lower bounds for the mixed capacitated arc routing problem, A fast metaheuristic for the travelling salesperson problem with hotel selection, Local-ideal-points based autonomous space decomposition framework for the multi-objective periodic generalized directed rural postman problem under length restrictions with intermediate facilities, The aircraft maintenance base location problem
Uses Software
Cites Work
- An approximate procedure for determining the number, capacities and locations of solid waste transfer-stations in an urban region
- Geometric algorithms and combinatorial optimization.
- A polyhedral approach to the rural postman problem
- The capacitated arc routing problem: Valid inequalities and facets
- A branch-and-cut algorithm for the undirected rural postman problem
- Capacitated arc routing problems
- Odd Minimum Cut-Sets and b-Matchings
- The Capacitated Arc Routing Problem: Lower bounds
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- Improvement Procedures for the Undirected Rural Postman Problem
- A Tabu Search Heuristic for the Capacitated arc Routing Problem
- Arc Routing Problems, Part I: The Chinese Postman Problem
- Arc Routing Problems, Part II: The Rural Postman Problem
- Bounds for the general capacitated routing problem
