Black, Daniel and Eglese, Richard and Wøhlk, Sanne (2013) The time-dependent prize-collecting arc routing problem. Computers and Operations Research, 40 (2). pp. 526-535. ISSN 0305-0548Full text not available from this repository.
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.
|Journal or Publication Title:||Computers and Operations Research|
|Uncontrolled Keywords:||Prize-collecting ; Arc routing ; Time-dependent ; Full truck load|
|Subjects:||H Social Sciences > HB Economic Theory|
|Departments:||Lancaster University Management School > Management Science|
|Deposited On:||05 Oct 2012 09:50|
|Last Modified:||24 Mar 2017 04:37|
Actions (login required)