A scenario-based planning for the pickup and delivery problem with time windows,scheduled lines and stochastic demands |
| |
| Institution: | 1. GraphHopper, Munich, Germany;2. Technical University of Berlin, Germany;3. German Aerospace Center (DLR), Berlin, Germany;1. Department of Industrial Engineering and Innovation Sciences, Eindhoven University of Technology, Eindhoven, The Netherlands;2. Department of Computer Science, VU University Amsterdam, Amsterdam, The Netherlands;3. Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands;1. Department of Industrial Engineering and Innovation Sciences, Eindhoven University of Technology, Eindhoven, The Netherlands;2. Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands;3. Perceptive Software, Apeldoorn, The Netherlands |
| |
| 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. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
