The open capacitated arc routing problem
From MaRDI portal
Publication:716347
DOI10.1016/j.cor.2011.01.012zbMath1210.90149OpenAlexW2142044601MaRDI QIDQ716347
Paulo Morelato França, Fábio Luiz Usberti, André Luiz Morelato França
Publication date: 28 April 2011
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.01.012
Programming involving graphs or networks (90C35) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
An efficiency-based path-scanning heuristic for the capacitated arc routing problem, GRASP with evolutionary path-relinking for the capacitated arc routing problem, A redistricting problem applied to meter reading in power distribution networks, Hybrid genetic algorithm for the open capacitated arc routing problem, Exact approaches for the cutting path determination problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The arc partitioning problem
- Heuristics for a dynamic rural postman problem
- A deterministic tabu search algorithm for the capacitated arc routing problem
- An improved heuristic for the capacitated arc routing problem
- Lower bounds for the mixed capacitated arc routing problem
- Approximate solutions for the capacitated arc routing problem
- A cutting plane algorithm for the capacitated arc routing problem
- A guided local search heuristic for the capacitated arc routing problem
- Augment-insert algorithms for the capacitated arc routing problem
- Lower and upper bounds for the mixed capacitated arc routing problem
- New lower bound for the capacitated arc routing problem
- Solving capacitated arc routing problems using a transformation to the CVRP
- Recent results on Arc Routing Problems: An annotated bibliography
- An Approximation Algorithm for the Capacitated Arc Routing Problem
- A Decade of Capacitated Arc Routing
- The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases
- New lower bounds for the Capacitated Arc Routing Problem
- Capacitated arc routing problems
- The Capacitated Arc Routing Problem: Lower bounds
- A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- A Tabu Search Heuristic for the Capacitated arc Routing Problem
- Arc Routing Problems, Part II: The Rural Postman Problem
