Home > Research > Publications & Outputs > A Deterministic Tabu Search Algorithm for the C...

Electronic data

View graph of relations

A Deterministic Tabu Search Algorithm for the Capacitated Arc Routing Problem (CARP)

Research output: Working paper

Published
NullPointerException

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.