Home > Research > Publications & Outputs > A deterministic tabu search algorithm for the c...
View graph of relations

A deterministic tabu search algorithm for the capacitated arc routing problem

Research output: Contribution to Journal/MagazineJournal articlepeer-review

<mark>Journal publication date</mark>2008
<mark>Journal</mark>Computers and Operations Research
Issue number4
Number of pages15
Pages (from-to)1112-1126
Publication StatusPublished
<mark>Original language</mark>English


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.