Home > Research > Publications & Outputs > A deterministic tabu search algorithm for the c...

Research

Electronic data

Links

Text available via DOI:

View graph of relations

A deterministic tabu search algorithm for the capacitated arc routing problem

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

A deterministic tabu search algorithm for the capacitated arc routing problem. / Brandao, J; Eglese, R W.
In: Computers and Operations Research, Vol. 35, No. 4, 2008, p. 1112-1126.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Brandao, J & Eglese, RW 2008, 'A deterministic tabu search algorithm for the capacitated arc routing problem', Computers and Operations Research, vol. 35, no. 4, pp. 1112-1126. https://doi.org/10.1016/j.cor.2006.07.007

APA

Brandao, J., & Eglese, R. W. (2008). A deterministic tabu search algorithm for the capacitated arc routing problem. Computers and Operations Research, 35(4), 1112-1126. https://doi.org/10.1016/j.cor.2006.07.007

Vancouver

Brandao J, Eglese RW. A deterministic tabu search algorithm for the capacitated arc routing problem. Computers and Operations Research. 2008;35(4):1112-1126. doi: 10.1016/j.cor.2006.07.007

Author

Brandao, J ; Eglese, R W. / A deterministic tabu search algorithm for the capacitated arc routing problem. In: Computers and Operations Research. 2008 ; Vol. 35, No. 4. pp. 1112-1126.

Bibtex

@article{8c6afe98303941de9d5e7811a6eb09c9,
title = "A deterministic tabu search algorithm for the capacitated arc routing problem",
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.",
author = "J Brandao and Eglese, {R W}",
year = "2008",
doi = "10.1016/j.cor.2006.07.007",
language = "English",
volume = "35",
pages = "1112--1126",
journal = "Computers and Operations Research",
issn = "0305-0548",
publisher = "Elsevier Ltd",
number = "4",

}

RIS

TY - JOUR

T1 - A deterministic tabu search algorithm for the capacitated arc routing problem

AU - Brandao, J

AU - Eglese, R W

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

U2 - 10.1016/j.cor.2006.07.007

DO - 10.1016/j.cor.2006.07.007

M3 - Journal article

VL - 35

SP - 1112

EP - 1126

JO - Computers and Operations Research

JF - Computers and Operations Research

SN - 0305-0548

IS - 4

ER -