The open capacitated arc routing problem
DOI10.1016/J.COR.2011.01.012zbMATH Open1210.90149OpenAlexW2142044601MaRDI QIDQ716347FDOQ716347
Authors: Fábio Luiz Usberti, P. M. França, 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
Recommendations
- Hybrid genetic algorithm for the open capacitated arc routing problem
- Open capacitated ARC routing problem by hybridized ant colony algorithm
- An improved heuristic for the capacitated arc routing problem
- Improved lower bounds and exact algorithm for the capacitated arc routing problem
- GRASP with evolutionary path-relinking for the capacitated arc routing problem
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Integer programming (90C10)
Cites Work
- A decade of capacitated arc routing
- Title not available (Why is that?)
- A guided local search heuristic for the capacitated arc routing problem
- Recent results on arc routing problems: an annotated bibliography
- Capacitated arc routing problems
- The Capacitated Arc Routing Problem: Lower bounds
- Arc Routing Problems, Part II: The Rural Postman 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
- Lower and upper bounds for the mixed capacitated arc routing problem
- Solving capacitated arc routing problems using a transformation to the CVRP
- An Approximation Algorithm for the Capacitated Arc Routing Problem
- Recent trends in arc routing
- A Tabu Search Heuristic for the Capacitated arc Routing Problem
- Title not available (Why is that?)
- A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
- A deterministic tabu search algorithm for the capacitated arc routing problem
- An improved heuristic for the capacitated arc routing problem
- Augment-insert algorithms for the capacitated arc routing problem
- New lower bound for the capacitated arc routing problem
- The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases
- New lower bounds for the Capacitated Arc Routing Problem
- Title not available (Why is that?)
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- Title not available (Why is that?)
- The arc partitioning problem
- Heuristics for a dynamic rural postman problem
Cited In (10)
- The rescheduling arc routing problem
- An efficiency-based path-scanning heuristic for the capacitated arc routing problem
- Hybrid genetic algorithm for the open capacitated arc routing problem
- An updated annotated bibliography on arc routing problems
- The Arc Routing and Scheduling Problem with Transshipment
- The mixed capacitated arc routing problem with non-overlapping routes
- A redistricting problem applied to meter reading in power distribution networks
- GRASP with evolutionary path-relinking for the capacitated arc routing problem
- Exact approaches for the cutting path determination problem
- A parameterized lower bounding method for the open capacitated arc routing problem
This page was built for publication: The open capacitated arc routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q716347)
