Taxi dispatching and stable marriage
This study explores the challenge of the dynamic dispatching of taxis to the immediate passenger booking requests. In particular, the study leverages on a stable marriage assignment algorithm and applies it for dispatching taxis to passengers. The stable marriage algorithm was developed initially fo...
Main Authors: | Kümmel, Michal, Busch, Fritz, Wang, David Zhi Wei |
---|---|
Other Authors: | School of Civil and Environmental Engineering |
Format: | Journal Article |
Language: | English |
Published: |
2018
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/89724 http://hdl.handle.net/10220/47119 |
Similar Items
-
Zone-Agnostic Greedy Taxi Dispatch Algorithm Based on Contextual Matching Matrix for Efficient Maximization of Revenue and Profit
by: Youngrae Kim, et al.
Published: (2021-10-01) -
Framework for automated taxi operation : the family model
by: Kümmel, Michal, et al.
Published: (2018) -
BENCHMARKING MINIMUM PASSENGER WAITING TIME IN ONLINE TAXI DISPATCHING WITH EXACT OFFLINE OPTIMIZATION METHODS
by: Michał Maciejewski
Published: (2014-06-01) -
An integrated solution for the aircraft taxi and gate assignment problems
by: John Behrends, et al.
Published: (2017-01-01) -
CONGESTION EFFECTS OF AUTONOMOUS TAXI FLEETS
by: Michal Maciejewski, et al.
Published: (2018-12-01)