Solving capacitated arc routing problems using a transformation to the CVRP
From MaRDI portal
Publication:2581620
DOI10.1016/j.cor.2004.11.020zbMath1087.90054OpenAlexW1967687507MaRDI QIDQ2581620
Eduardo Uchoa, Marcus Poggi de Aragão, Humberto J. Longo
Publication date: 10 January 2006
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2004.11.020
Related Items
Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition, An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems, An approach to the asymmetric multi-depot capacitated arc routing problem, Solving the time varying postman problems with timed automata, Improved bounds for large scale capacitated arc routing problem, GRASP with evolutionary path-relinking for the capacitated arc routing problem, Location-arc routing problem: heuristic approaches and test instances, Pricing routines for vehicle routing with time windows on road networks, Arc routing problems with time-dependent service costs, Arc routing under uncertainty: introduction and literature review, Memetic algorithm based on extension step and statistical filtering for large-scale capacitated arc routing problems, Arc routing problems: A review of the past, present, and future, Two phased hybrid local search for the periodic capacitated arc routing problem, A generic exact solver for vehicle routing and related problems, Improved lower bounds and exact algorithm for the capacitated arc routing problem, Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics, A deterministic tabu search algorithm for the capacitated arc routing problem, Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation, A Decade of Capacitated Arc Routing, Combinatorial optimization and green logistics, Iterated local search and column generation to solve arc-routing as a permutation set-covering problem, An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem, Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows, Combinatorial optimization and green logistics, Robust branch-and-cut-and-price for the capacitated vehicle routing problem, Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem, The open capacitated arc routing problem, Recent results on Arc Routing Problems: An annotated bibliography, An improved heuristic for the capacitated arc routing problem, Exploiting sparsity in pricing routines for the capacitated arc routing problem, Lower bounds for the mixed capacitated arc routing problem, Tour splitting algorithms for vehicle routing problems, A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands, Robust drone selective routing in humanitarian transportation network assessment, Exact approaches for the cutting path determination problem, Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration, A compact transformation of arc routing problems into node routing problems, An integer programming approach for the Chinese postman problem with time-dependent travel time, The time-dependent rural postman problem: polyhedral results
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A parallel insert method for the capacitated arc routing problem
- The fleet size and mix problem for capacitated arc routing
- Approximate solutions for the capacitated arc routing problem
- The capacitated arc routing problem: Valid inequalities and facets
- On the capacitated vehicle routing problem
- Transforming arc routing into node routing problems
- A cutting plane algorithm for the capacitated arc routing problem
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- Augment-insert algorithms for the capacitated arc routing problem
- The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
- The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases
- New lower bounds for the Capacitated Arc Routing Problem
- Capacitated arc routing problems
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM
- The Capacitated Arc Routing Problem: Lower bounds
- A Tabu Search Heuristic for the Capacitated arc Routing Problem
- Arc Routing Problems, Part II: The Rural Postman Problem
- Integer Programming and Combinatorial Optimization
