Comparison of anticipatory algorithms for a dial-a-ride problem
Year of publication: |
2022
|
---|---|
Authors: | Ritzinger, Ulrike ; Puchinger, Jakob ; Rudloff, Christian ; Hartl, Richard F. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 301.2022, 2 (1.9.), p. 591-608
|
Subject: | Dial-a-Ride problem | Dynamic | Real-world application | Stochastic | Transportation | Tourenplanung | Vehicle routing problem | Dynamische Optimierung | Dynamic programming | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Algorithmus | Algorithm |
-
Job shop scheduling with setup times, deadlines and precedence constraints
Balas, Egon, (2008)
-
A memetic algorithm for the patient transportation problem
Zhang, Zhenzhen, (2015)
-
Liu, Ran, (2017)
- More ...
-
Dynamic programming based metaheuristics for the dial-a-ride problem
Ritzinger, Ulrike, (2016)
-
A survey on dynamic and stochastic vehicle routing problems
Ritzinger, Ulrike, (2016)
-
The electric fleet size and mix vehicle routing problem with time windows and recharging stations
Hiermann, Gerhard, (2016)
- More ...