Home > Research > Publications & Outputs > The time-dependent prize-collecting arc routing...
View graph of relations

The time-dependent prize-collecting arc routing problem

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

The time-dependent prize-collecting arc routing problem. / Black, Daniel; Eglese, Richard; Wøhlk, Sanne.
In: Computers and Operations Research, Vol. 40, No. 2, 02.2013, p. 526-535.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

Black, D, Eglese, R & Wøhlk, S 2013, 'The time-dependent prize-collecting arc routing problem', Computers and Operations Research, vol. 40, no. 2, pp. 526-535. https://doi.org/10.1016/j.cor.2012.08.001

APA

Vancouver

Black D, Eglese R, Wøhlk S. The time-dependent prize-collecting arc routing problem. Computers and Operations Research. 2013 Feb;40(2):526-535. Epub 2012 Aug 10. doi: 10.1016/j.cor.2012.08.001

Author

Black, Daniel ; Eglese, Richard ; Wøhlk, Sanne. / The time-dependent prize-collecting arc routing problem. In: Computers and Operations Research. 2013 ; Vol. 40, No. 2. pp. 526-535.

Bibtex

@article{1ca13a7714da4a9dbf80eb93d112221c,
title = "The time-dependent prize-collecting arc routing problem",
abstract = "A new problem is introduced named the Time-Dependent Prize-Collecting Arc Routing Problem (TDPARP). It is particularly relevant to situations where a transport manager has to choose between a number of full truck load pick-ups and deliveries on a road network where travel times change with the time of day. Two metaheuristic algorithms, one based on Variable Neighborhood Search and one based on Tabu Search, are proposed and tested for a set of benchmark problems, generated from real road networks and travel time information. Both algorithms are capable of finding good solutions, though the VNS approach generally shows better performance.",
keywords = "Prize-collecting, Arc routing , Time-dependent , Full truck load",
author = "Daniel Black and Richard Eglese and Sanne W{\o}hlk",
year = "2013",
month = feb,
doi = "10.1016/j.cor.2012.08.001",
language = "English",
volume = "40",
pages = "526--535",
journal = "Computers and Operations Research",
issn = "0305-0548",
publisher = "Elsevier Ltd",
number = "2",

}

RIS

TY - JOUR

T1 - The time-dependent prize-collecting arc routing problem

AU - Black, Daniel

AU - Eglese, Richard

AU - Wøhlk, Sanne

PY - 2013/2

Y1 - 2013/2

N2 - A new problem is introduced named the Time-Dependent Prize-Collecting Arc Routing Problem (TDPARP). It is particularly relevant to situations where a transport manager has to choose between a number of full truck load pick-ups and deliveries on a road network where travel times change with the time of day. Two metaheuristic algorithms, one based on Variable Neighborhood Search and one based on Tabu Search, are proposed and tested for a set of benchmark problems, generated from real road networks and travel time information. Both algorithms are capable of finding good solutions, though the VNS approach generally shows better performance.

AB - A new problem is introduced named the Time-Dependent Prize-Collecting Arc Routing Problem (TDPARP). It is particularly relevant to situations where a transport manager has to choose between a number of full truck load pick-ups and deliveries on a road network where travel times change with the time of day. Two metaheuristic algorithms, one based on Variable Neighborhood Search and one based on Tabu Search, are proposed and tested for a set of benchmark problems, generated from real road networks and travel time information. Both algorithms are capable of finding good solutions, though the VNS approach generally shows better performance.

KW - Prize-collecting

KW - Arc routing

KW - Time-dependent

KW - Full truck load

U2 - 10.1016/j.cor.2012.08.001

DO - 10.1016/j.cor.2012.08.001

M3 - Journal article

VL - 40

SP - 526

EP - 535

JO - Computers and Operations Research

JF - Computers and Operations Research

SN - 0305-0548

IS - 2

ER -