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

Research

Electronic data

Keywords

View graph of relations

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

Research output: Working paper

Published

Standard

A Deterministic Tabu Search Algorithm for the Capacitated Arc Routing Problem (CARP). / Brandao, J; Eglese, R W.
Lancaster University: The Department of Management Science, 2005. (Management Science Working Paper Series).

Research output: Working paper

Harvard

Brandao, J & Eglese, RW 2005 'A Deterministic Tabu Search Algorithm for the Capacitated Arc Routing Problem (CARP)' Management Science Working Paper Series, The Department of Management Science, Lancaster University.

APA

Brandao, J., & Eglese, R. W. (2005). A Deterministic Tabu Search Algorithm for the Capacitated Arc Routing Problem (CARP). (Management Science Working Paper Series). The Department of Management Science.

Vancouver

Brandao J, Eglese RW. A Deterministic Tabu Search Algorithm for the Capacitated Arc Routing Problem (CARP). Lancaster University: The Department of Management Science. 2005. (Management Science Working Paper Series).

Author

Brandao, J ; Eglese, R W. / A Deterministic Tabu Search Algorithm for the Capacitated Arc Routing Problem (CARP). Lancaster University : The Department of Management Science, 2005. (Management Science Working Paper Series).

Bibtex

@techreport{300f93357ad5442ab642d1c5de6f3fb6,
title = "A Deterministic Tabu Search Algorithm for the Capacitated Arc Routing Problem (CARP)",
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.",
keywords = "Heuristics, Arc Routing, Tabu Search",
author = "J Brandao and Eglese, {R W}",
year = "2005",
language = "English",
series = "Management Science Working Paper Series",
publisher = "The Department of Management Science",
type = "WorkingPaper",
institution = "The Department of Management Science",

}

RIS

TY - UNPB

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

AU - Brandao, J

AU - Eglese, R W

PY - 2005

Y1 - 2005

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.

KW - Heuristics

KW - Arc Routing

KW - Tabu Search

M3 - Working paper

T3 - Management Science Working Paper Series

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

PB - The Department of Management Science

CY - Lancaster University

ER -