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

Ghilas, Veaceslav, Demir, Emrah ORCID: https://orcid.org/0000-0002-4726-2556 and Van Woensel, Tom 2016. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines. Computers & Operations Research 72 , pp. 12-30. 10.1016/j.cor.2016.01.018

Full text not available from this repository.

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.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Business (Including Economics)
Publisher:	Elsevier
ISSN:	0305-0548
Last Modified:	02 Nov 2022 09:45
URI:	https://orca.cardiff.ac.uk/id/eprint/96306

Citation Data

Cited 86 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item