Aarhus University Seal

The time-dependent prize-collecting arc routing problem

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  • Dan Black, University of Edinburgh, United Kingdom
  • Richard Eglese, Lancaster University, United Kingdom
  • Sanne Wøhlk
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.
Original languageEnglish
JournalComputers & Operations Research
Pages (from-to)526-535
Number of pages10
Publication statusPublished - 2013

See relations at Aarhus University Citationformats

ID: 48621096