Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6892800 | Computers & Operations Research | 2016 | 30 Pages |
Abstract
The Pickup and Delivery Problem with Time Windows and Scheduled Lines (PDPTW-SL) concerns scheduling a set of vehicles to serve freight requests such that a part of the journey can be carried out on a scheduled public transportation line. Due to the complexity of the problem, which is NP-hard, we propose an Adaptive Large Neighborhood Search (ALNS) heuristic algorithm to solve the PDPTW-SL. Complex aspects such as fixed lines׳ schedules, synchronization and time-windows constraints are efficiently considered in the proposed algorithm. Results of extensive computational experiments show that the ALNS is highly effective in finding good-quality solutions on the generated PDPTW-SL instances with up to 100 freight requests that reasonably represent real life situations.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Veaceslav Ghilas, Emrah Demir, Tom Van Woensel,