New lower bound for the capacitated arc routing problem

Authors:
Sanne Wøhlk
Affiliations:
Department of Organization and Management, University of Southern Denmark, Odense, Denmark
Venue:
Computers and Operations Research
Year:
2006

Citing 1
Cited 10

Transforming arc routing into node routing problems

Computers and Operations Research

A variable neighborhood search for the capacitated arc routing problem with intermediate facilities

Journal of Heuristics
An Adaptive Large Neighbourhood Search Heuristic for the Capacitated Arc-Routing Problem with Stochastic Demands

Transportation Science
Energy constrained multi-robot sensor-based coverage path planning using capacitated arc routing approach

Robotics and Autonomous Systems
New upper bounds for the multi-depot capacitated arc routing problem

International Journal of Metaheuristics
An evolutionary approach to the multidepot capacitated arc routing problem

IEEE Transactions on Evolutionary Computation
The open capacitated arc routing problem

Computers and Operations Research
A branch-cut-and-price algorithm for the capacitated arc routing problem

SEA'11 Proceedings of the 10th international conference on Experimental algorithms
An optimization-based heuristic for the Multi-objective Undirected Capacitated Arc Routing Problem

Computers and Operations Research
A lower bound for the Node, Edge, and Arc Routing Problem

Computers and Operations Research
GRASP with evolutionary path-relinking for the capacitated arc routing problem

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present a new lower bound, the Multiple Cuts Node Duplication Lower Bound, for the undirected Capacitated Arc Routing Problem. We prove that this new bound dominates the existing bounds for the problem. Computational results are also provided.