The open capacitated arc routing problem

DOI10.1016/J.COR.2011.01.012MaRDI QIDQ716347zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

computational complexityarc routingpath-scanning heuristic

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Integer programming (90C10)

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

Cites work

• scientific article; zbMATH DE number 1703887 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 1054960 (Why is no real title available?)
• scientific article; zbMATH DE number 232390 (Why is no real title available?)
• A Tabu Search Heuristic for the Capacitated arc Routing Problem
• A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
• A cutting plane algorithm for the capacitated arc routing problem
• A decade of capacitated arc routing
• A deterministic tabu search algorithm for the capacitated arc routing problem
• A guided local search heuristic for the capacitated arc routing problem
• An approximation algorithm for the capacitated arc routing problem
• An improved heuristic for the capacitated arc routing problem
• Approximate solutions for the capacitated arc routing problem
• Arc Routing Problems, Part II: The Rural Postman Problem
• Augment-insert algorithms for the capacitated arc routing problem
• Capacitated arc routing problems
• Heuristics for a dynamic rural postman problem
• Lower and upper bounds for the mixed capacitated arc routing problem
• Lower bounds for the mixed capacitated arc routing problem
• New lower bound for the capacitated arc routing problem
• New lower bounds for the Capacitated Arc Routing Problem
• Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
• Recent results on arc routing problems: an annotated bibliography
• Recent trends in arc routing
• Solving capacitated arc routing problems using a transformation to the CVRP
• The Capacitated Arc Routing Problem: Lower bounds
• The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases
• The arc partitioning problem

Cited in

(12)

• An efficiency-based path-scanning heuristic for the capacitated arc routing problem
• Exact approaches for the cutting path determination problem
• Hybrid genetic algorithm for the open capacitated arc routing problem
• An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
• A parameterized lower bounding method for the open capacitated arc routing problem
• The rescheduling arc routing problem
• Open capacitated ARC routing problem by hybridized ant colony algorithm
• The Arc Routing and Scheduling Problem with Transshipment
• An updated annotated bibliography on arc routing problems
• 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

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)