Exploiting sparsity in pricing routines for the capacitated arc routing problem

Authors:
Adam N. Letchford;Amar Oukil
Affiliations:
Department of Management Science, Lancaster University, Lancaster LA1 4YW, UK;Department of Management Science, Lancaster University, Lancaster LA1 4YW, UK
Venue:
Computers and Operations Research
Year:
2009

Citing 11
Cited 6

Transforming arc routing into node routing problems

Computers and Operations Research
Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
The Capacitated Arc Routing Problem: Valid Inequalities and Facets

Computational Optimization and Applications
Set-covering-based algorithms for the capacitated VRP

The vehicle routing problem
A cutting plane algorithm for the capacitated arc routing problem

Computers and Operations Research
A new branch-and-cut algorithm for the capacitated vehicle routing problem

Mathematical Programming: Series A and B
Exact methods based on node-routing formulations for undirected arc-routing problems

Networks
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem

Mathematical Programming: Series A and B
The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3

INFORMS Journal on Computing
A deterministic tabu search algorithm for the 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
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 Branch-and-Price Algorithm for the Capacitated Arc Routing Problem with Stochastic Demands

Operations Research Letters
Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem

Operations Research
Improved bounds for large scale capacitated arc routing problem

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

The capacitated arc routing problem (CARP) is a well-known and fundamental vehicle routing problem. A promising exact solution approach to the CARP is to model it as a set covering problem and solve it via branch-cut-and-price. The bottleneck in this approach is the pricing (column generation) routine. In this paper, we note that most CARP instances arising in practical applications are defined on sparse graphs. We show how to exploit this sparsity to yield faster pricing routines. Extensive computational results are given.