Research output: Contribution to Journal/Magazine › Journal article › peer-review
Research output: Contribution to Journal/Magazine › Journal article › peer-review
}
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 -