A deterministic tabu search algorithm for the capacitated arc routing problem

Authors:
José Brandão;Richard Eglese
Affiliations:
Dep. de Gestão, Escola de Economia e Gestão, Universidade do Minho, Largo do Paço, 4704 -553 Braga, Portugal;Department of Management Science, Lancaster University Management School, Lancaster LA1 4YX, UK
Venue:
Computers and Operations Research
Year:
2008

Citing 9
Cited 29

Augment-insert algorithms for the capacitated arc routing problem

Computers and Operations Research
Routing winter gritting vehicles

CO89 Selected papers of the conference on Combinatorial Optimization
Algorithms for the rural postman problem

Computers and Operations Research
Approximation Algorithms for Some Postman Problems

Journal of the ACM (JACM)
A cutting plane algorithm for the capacitated arc routing problem

Computers and Operations Research
A Tabu Search Heuristic for the Capacitated Arc Routing Problem

Operations Research
A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem

Transportation Science
Exact methods based on node-routing formulations for undirected arc-routing problems

Networks
Solving capacitated arc routing problems using a transformation to the CVRP

Computers and Operations Research

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

Journal of Heuristics
Hybrid Scatter Search with Extremal Optimization for Solving the Capacitated Vehicle Routing Problem

ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence
Exploiting sparsity in pricing routines for the capacitated arc routing problem

Computers and Operations Research
A weight-coded genetic algorithm for the capacitated arc routing problem

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration

Computers and Operations Research
A global repair operator for capacitated arc routing problem

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Improved memetic algorithm for capacitated arc routing problem

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Memetic algorithm with extended neighborhood search for capacitated arc routing problems

IEEE Transactions on Evolutionary Computation
An Adaptive Large Neighbourhood Search Heuristic for the Capacitated Arc-Routing Problem with Stochastic Demands

Transportation Science
A guided local search procedure for the multi-compartment capacitated arc routing problem

Computers and Operations Research
Solving the mobile mapping van problem: A hybrid metaheuristic for capacitated arc routing with soft time windows

Computers and Operations Research
New upper bounds for the multi-depot capacitated arc routing problem

International Journal of Metaheuristics
Split-Delivery Capacitated Arc-Routing Problem: Lower Bound and Metaheuristic

Transportation Science
An evolutionary approach to the multidepot capacitated arc routing problem

IEEE Transactions on Evolutionary Computation
A variable neighborhood descent heuristic for arc routing problems with time-dependent service costs

Computers and Industrial Engineering
Short communication: An improved evolutionary approach to the Extended Capacitated Arc Routing Problem

Expert Systems with Applications: An International Journal
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
BRKGA Algorithm for the Capacitated Arc Routing Problem

Electronic Notes in Theoretical Computer Science (ENTCS)
A Tabu Search Heuristic for the Prize-collecting Rural Postman Problem

Electronic Notes in Theoretical Computer Science (ENTCS)
Capacitated arc routing problem with deadheading demands

Computers and Operations Research
An optimization-based heuristic for the Multi-objective Undirected Capacitated Arc Routing Problem

Computers and Operations Research
An approximate ε-constraint method for the multi-objective undirected capacitated arc routing problem

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
A developmental solution to (dynamic) capacitated arc routing problems using genetic programming

Proceedings of the 14th annual conference on Genetic and evolutionary computation
Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem

Operations Research
Efficient solution of capacitated arc routing problems with a limited computational budget

AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
Improved bounds for large scale capacitated arc routing problem

Computers and Operations Research
The double layer optimization problem to express logistics systems and its heuristic algorithm

Expert Systems with Applications: An International Journal
GRASP with evolutionary path-relinking for the capacitated arc routing problem

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

The capacitated arc routing problem (CARP) is a difficult optimisation problem in vehicle routing with applications where a service must be provided by a set of vehicles on specified roads. A heuristic algorithm based on tabu search is proposed and tested on various sets of benchmark instances. The computational results show that the proposed algorithm produces high quality results within a reasonable computing time. Some new best solutions are reported for a set of test problems used in the literature.