A Hierarchical Relaxations Lower Bound for the Capacitated Arc Routing Problem

Authors:
A. Amberg;S. Voss
Affiliations:
-;-
Venue:
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 3 - Volume 3
Year:
2002

Citing 0
Cited 10

A tabu scatter search metaheuristic for the arc routing problem

Computers and Industrial Engineering - Special issue: Focussed issue on applied meta-heuristics
Solving capacitated arc routing problems using a transformation to the CVRP

Computers and Operations Research
A genetic algorithm for a bi-objective capacitated arc routing problem

Computers and Operations Research
Solving capacitated arc routing problems using a transformation to the CVRP

Computers and Operations Research
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
Multiobjective capacitated arc routing problem

EMO'03 Proceedings of the 2nd international conference on Evolutionary multi-criterion optimization
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Amongst the most important features of supply chain management are those related to interconnecting various companies within a supply network. While the performance of these interconnections is greatly influenced by information technology and information management we still face another important issue regarding logistics performance which is transportation, routing, and network design. In this paper we consider an important problem within this frame, the capacitated arc routing problem (CARP), and provide a new lower bounding scheme to obtain bounds on the quality of heuristically obtained solutions. Given a network with demands on the arcs the CARP is to find a set of minimum cost routes for a set of vehicles to service all arcs with positive demands without violating the capacities of the vehicles. Based on benchmark instances from the literature as well as real-world problem instances we can show that our bounds are more effective than other bounds available from the literature.