Ghilas, Veaceslav, Demir, Emrah ![]() |
Abstract
The Pickup and Delivery Problem with Time Windows, Scheduled Lines and Stochastic Demands (PDPTW-SLSD) concerns scheduling a set of vehicles to serve a set of requests, whose expected demands are known in distribution when planning, but are only revealed with certainty upon the vehicles’ arrival. In addition, a part of the transportation plan can be carried out on limited-capacity scheduled public transportation line services. This paper proposes a scenario-based sample average approximation approach for the PDPTW-SLSD. An adaptive large neighborhood search heuristic embedded into sample average approximation method is used to generate good-quality solutions. Computational results on instances with up to 40 requests (i.e., 80 locations) reveal that the integrated transportation networks can lead to operational cost savings of up to 16% compared with classical pickup and delivery systems.
Item Type: | Article |
---|---|
Date Type: | Publication |
Status: | Published |
Schools: | Business (Including Economics) |
Subjects: | H Social Sciences > HE Transportation and Communications |
Uncontrolled Keywords: | Freight transportation; Pickup and delivery problem; Scheduled lines; Stochastic demands; Heuristic algorithm |
Publisher: | Elsevier |
ISSN: | 0191-2615 |
Date of Acceptance: | 23 April 2016 |
Last Modified: | 02 Nov 2022 09:55 |
URI: | https://orca.cardiff.ac.uk/id/eprint/96821 |
Citation Data
Cited 38 times in Scopus. View in Scopus. Powered By Scopus® Data
Actions (repository staff only)
![]() |
Edit Item |