New Optimization Guidance for Dynamic Dial-a-Ride Problems

Christian Ackermann () and Julia Rieck
Additional contact information
Christian Ackermann: University of Hildesheim
Julia Rieck: University of Hildesheim

A chapter in Operations Research Proceedings 2021, 2022, pp 283-288 from Springer

Abstract: Abstract In the dial-a-ride problem, customers have to be transported from different pickup to drop-off locations. Various constraints such as time windows and a maximum ride time per passenger need to be considered. In the dynamic version of the problem, not all customer requests are known in advance, but arrive during the operation time. Therefore, the maximization of the number of served customers is usually set as the optimization goal. Nevertheless, in the vast majority of known heuristics, the total distance is used to guide the optimization. In this paper, we present different metrics that should enable the evaluation of the insertion potential of future customers and lead to a higher acceptance rate through their use in solution procedures. We show that even a single metric can provide better results than the distances and present a Markov decision process-based approach to enable an agent trained by reinforcement learning to perform even more anticipatory decision making by considering multiple metrics simultaneously.

Keywords: Dynamic dial-a-ride problem; Metrics; Reinforcement learning (search for similar items in EconPapers)
Date: 2022
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:lnopch:978-3-031-08623-6_42

Ordering information: This item can be ordered from
http://www.springer.com/9783031086236

DOI: 10.1007/978-3-031-08623-6_42

Access Statistics for this chapter

More chapters in Lecture Notes in Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().