Abstract
The time-dependent prize-collecting arc routing problem (TD-PARP) determines a number of full truckload orders and plans a vehicle route to maximize profit, which is calculated as total collected revenue (prizes) minus total travel cost. The travel cost on an arc is proportional to the travel time via the arc and changes over time. This study proposes an iterated greedy (IG) heuristic for the TD-PARP. Computational study on 41 benchmark problems indicates that the proposed IG heuristic outperforms existing approaches. The proposed IG heuristic obtains the best solutions to most of the benchmark problems.
| Original language | English |
|---|---|
| Article number | 4138 |
| Pages (from-to) | 54-66 |
| Number of pages | 13 |
| Journal | Computers and Industrial Engineering |
| Volume | 90 |
| DOIs | |
| State | Published - 01 12 2015 |
Bibliographical note
Publisher Copyright:© 2015 Elsevier Ltd.
Keywords
- Iterated greedy heuristic
- Metaheuristics
- Prize-collecting arc routing problem
- Time-dependent
Fingerprint
Dive into the research topics of 'Iterated greedy heuristic for the time-dependent prize-collecting arc routing problem'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver