A new problem is introduced named the Time-Dependent Prize-Collecting Arc Routing Problem (TD-PARP). 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. © 2012 Elsevier Ltd. All rights reserved.
https://doi.org/10.1016/j.cor.2012.08.001Cite as:
@article{Black_2013,
doi = {10.1016/j.cor.2012.08.001},
url = {https://doi.org/10.1016%2Fj.cor.2012.08.001},
year = 2013,
month = {feb},
publisher = {Elsevier {BV}},
volume = {40},
number = {2},
pages = {526--535},
author = {Dan Black and Richard Eglese and Sanne W{o}hlk},
title = {The time-dependent prize-collecting arc routing problem},
journal = {Computers {&}amp$mathsemicolon$ Operations Research}
}