Lower bounds for the mixed capacitated arc routing problem
From MaRDI portal
Publication:1040970
DOI10.1016/j.cor.2009.06.018zbMath1175.90039OpenAlexW2077422018MaRDI QIDQ1040970
Luís Gouveia, Leonor Santiago Pinto, Maria Cândida Mourão
Publication date: 27 November 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.06.018
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)
Related Items
New large-scale data instances for CARP and new variations of CARP ⋮ A survey of variants and extensions of the location-routing problem ⋮ Two-phase branch-and-cut for the mixed capacitated general routing problem ⋮ The mixed capacitated arc routing problem with non-overlapping routes ⋮ Local search heuristics for sectoring routing in a household waste collection context ⋮ GRASP with evolutionary path-relinking for the capacitated arc routing problem ⋮ Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities ⋮ Modeling and solving the mixed capacitated general routing problem ⋮ Arc routing with trip-balancing and attractiveness measures -- a waste collection case study ⋮ The travelling salesman problem with positional consistency constraints: an application to healthcare services ⋮ Fast upper and lower bounds for a large‐scale real‐world arc routing problem ⋮ The single robot line coverage problem: Theory, algorithms, and experiments ⋮ Efficient local search strategies for the mixed capacitated arc routing problems under time restrictions with intermediate facilities ⋮ The open capacitated arc routing problem ⋮ A novel model for arc territory design: promoting Eulerian districts ⋮ Profitable mixed capacitated arc routing and related problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Heuristics for a dynamic rural postman problem
- The capacitated arc routing problem: Valid inequalities and facets
- The mixed general routing polyhedron
- Evolutionary algorithms for periodic arc routing problems
- Transforming arc routing into node routing problems
- A cutting plane algorithm for the capacitated arc routing problem
- Heuristic method for a mixed capacitated arc routing problem: A refuse collection application
- Lower-bounding and heuristic methods for a refuse collection vehicle routing problem
- Solving an urban waste collection problem using ants heuristics
- Solution of real-world postman problems
- Lower and upper bounds for the mixed capacitated arc routing problem
- Solving capacitated arc routing problems using a transformation to the CVRP
- The capacitated arc routing problem with refill points
- The capacitated arc routing problem with intermediate facilities
- Exact methods based on node-routing formulations for undirected arc-routing problems
- A Decade of Capacitated Arc Routing
- Capacitated arc routing problems
- Arc Routing Problems, Part I: The Chinese Postman Problem
- Arc Routing Problems, Part II: The Rural Postman Problem
- An optimal algorithm for the mixed Chinese postman problem
- A variable neighborhood descent algorithm for a real waste collection problem with mobile depots
