An adaptive large neighborhood search heuristic for the pickup and delivery problem with time Windows and scheduled lines

V. Ghilas, E. Demir, T. van Woensel

Research output: Contribution to journalArticleAcademicpeer-review

58 Citations (Scopus)
5 Downloads (Pure)

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.
Original languageEnglish
Pages (from-to)12-30
JournalComputers & Operations Research
Volume72
DOIs
Publication statusPublished - 2016

Fingerprint Dive into the research topics of 'An adaptive large neighborhood search heuristic for the pickup and delivery problem with time Windows and scheduled lines'. Together they form a unique fingerprint.

Cite this