Improved bounds for large scale capacitated arc routing problem

DOI10.1016/J.COR.2013.02.013MaRDI QIDQ336459zbMATHOpenAlexFDO

Authors Rafael Martinelli, Marcus Poggi, A. Subramanian

Publication date 10 November 2016

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2013.02.013

zbMATH Keywords

integer programmingiterated local searcharc routingdual ascentcapacity cuts

Mathematics Subject Classification ID

Applications of graph theory (05C90) Programming involving graphs or networks (90C35) Integer programming (90C10)

Recommendations

• Improved lower bounds and exact algorithm for the capacitated arc routing problem
• New lower bounds for the Capacitated Arc Routing Problem
• The Capacitated Arc Routing Problem: Lower bounds
• New lower bound for the capacitated arc routing problem
• An improved heuristic for the capacitated arc routing problem
• The capacitated arc routing problem: combinatorial lower bounds
• An approximation algorithm for the capacitated arc routing problem
• Lower and upper bounds for the mixed capacitated arc routing problem
• Approximate solutions for the capacitated arc routing problem
• Fast upper and lower bounds for a large‐scale real‐world arc routing problem

Cites work

• scientific article; zbMATH DE number 2134188 (Why is no real title available?)
• scientific article; zbMATH DE number 2050711 (Why is no real title available?)
• A cutting plane algorithm for the capacitated arc routing problem
• A deterministic tabu search algorithm for the capacitated arc routing problem
• A dual ascent approach for steiner tree problems on a directed graph
• A guided local search heuristic for the capacitated arc routing problem
• A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
• A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
• Capacitated arc routing problems
• Cut-first branch-and-price-second for the capacitated arc-routing problem
• Exact methods based on node-routing formulations for undirected arc-routing problems
• Exploiting sparsity in pricing routines for the capacitated arc routing problem
• Improved lower bounds and exact algorithm for the capacitated arc routing problem
• Multi-Terminal Network Flows
• Odd Minimum Cut-Sets and b-Matchings
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Optimizing over the first Chvátal closure
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• Solving capacitated arc routing problems using a transformation to the CVRP
• The Capacitated Arc Routing Problem: Lower bounds
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Transforming arc routing into node routing problems
• Variable neighborhood search

Cited in

(21)

• Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition
• Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
• A branch-and-cut algorithm for the soft-clustered vehicle-routing problem
• Effects of update frequencies in a dynamic capacitated arc routing problem
• Iterated local search and column generation to solve arc-routing as a permutation set-covering problem
• A parameterized lower bounding method for the open capacitated arc routing problem
• Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times
• Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times
• New lower bounds for the Capacitated Arc Routing Problem
• An updated annotated bibliography on arc routing problems
• Two phased hybrid local search for the periodic capacitated arc routing problem
• Fast upper and lower bounds for a large‐scale real‐world arc routing problem
• New upper bounds for the multi-depot capacitated arc routing problem
• An iterated ``hyperplane exploration approach for the quadratic knapsack problem
• A hybrid evolutionary search for the generalized quadratic multiple knapsack problem
• MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem
• A hybrid metaheuristic approach for the capacitated arc routing problem
• Improved lower bounds and exact algorithm for the capacitated arc routing problem
• Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff
• Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes

This page was built for publication: Improved bounds for large scale capacitated arc routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336459)