Solving capacitated arc routing problems using a transformation to the CVRP
From MaRDI portal
Publication:2581620
Recommendations
- Exact methods based on node-routing formulations for undirected arc-routing problems
- A compact transformation of arc routing problems into node routing problems
- Transforming arc routing into node routing problems
- Improved lower bounds and exact algorithm for the capacitated arc routing problem
- Approximate solutions for the capacitated arc routing problem
Cites work
- A cutting plane algorithm for the capacitated arc routing problem
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- A parallel insert method for the capacitated arc routing problem
- A Tabu Search 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
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- scientific article; zbMATH DE number 2134197 (Why is no real title available?)
- scientific article; zbMATH DE number 1749222 (Why is no real title available?)
- scientific article; zbMATH DE number 956790 (Why is no real title available?)
- Integer Programming and Combinatorial Optimization
- New lower bounds for the Capacitated Arc Routing Problem
- NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM
- On the capacitated vehicle routing problem
- The Capacitated Arc Routing Problem: Lower bounds
- The capacitated arc routing problem: Valid inequalities and facets
- The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases
- The fleet size and mix problem for capacitated arc routing
- The shortest-path problem with resource constraints and k-cycle elimination for k 3
- Transforming arc routing into node routing problems
Cited in
(47)- 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
- A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands
- Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration
- Modeling and solving several classes of arc routing problems as traveling salesman problems
- Two phased hybrid local search for the periodic capacitated arc routing problem
- Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
- 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
- Transforming arc routing into node routing problems
- Improved lower bounds and exact algorithm for the capacitated arc routing problem
- Robust drone selective routing in humanitarian transportation network assessment
- Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition
- A generic exact solver for vehicle routing and related problems
- Exact approaches for the cutting path determination problem
- 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
- Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Arc routing under uncertainty: introduction and literature review
- The time-dependent rural postman problem: polyhedral results
- Recent results on arc routing problems: an annotated bibliography
- Tour splitting algorithms for vehicle routing problems
- An approach to the asymmetric multi-depot capacitated arc routing problem
- 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
- Exact methods based on node-routing formulations for undirected arc-routing problems
- Solving the time varying postman problems with timed automata
- A decade of capacitated arc routing
- The Arc Routing and Scheduling Problem with Transshipment
- Combinatorial optimization and green logistics
- Combinatorial optimization and green logistics
- 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
- An adaptive large neighborhood search method for the drone-truck arc routing problem
- A polynomial time solvable capacitated arc routing problem on regular grid graphs
- Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem
- The open capacitated arc routing problem
- Multi-depot periodic capacitated arc routing problem with intermediate facilities for waste collection
- Navigating network availability: a shortest path approach to UAV traffic routing
- An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems
- Arc routing problems with time-dependent service costs
- A deterministic tabu search algorithm for the capacitated arc routing problem
- Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows
This page was built for publication: Solving capacitated arc routing problems using a transformation to the CVRP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2581620)
