Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.

Article

Download BibTeX

Title

An Assignment-Based Approach to Efficient Real-Time City-Scale Taxi Dispatching

Authors

[ 1 ] Instytut Maszyn Roboczych i Pojazdów Samochodowych, Wydział Maszyn Roboczych i Transportu, Politechnika Poznańska | [ P ] employee

Year of publication

2016

Published in

IEEE Intelligent Systems

Journal year: 2016 | Journal volume: vol. 31 | Journal number: no. 1

Article type

scientific article

Publication language

english

Abstract

EN This study proposes and evaluates an efficient real-time taxi dispatching strategy that solves the linear assignment problem to find a globally optimal taxi-to-request assignment at each decision epoch. The authors compare the assignment-based strategy with two popular rule-based strategies. They evaluate dispatching strategies in detail in the city of Berlin and the neighboring region of Brandenburg using the microscopic large-scale MATSim simulator. The assignment-based strategy produced better results for both drivers (less idle driving) and passengers (less waiting). However, computing the assignments for thousands of taxis in a huge road network turned out to be computationally demanding. Certain adaptations pertaining to the cost matrix calculation were necessary to increase the computational efficiency and assure real-time responsiveness.

Pages (from - to)

68 - 77

DOI

10.1109/MIS.2016.2

URL

https://ieeexplore.ieee.org/document/7389909

Ministry points / journal

40

Impact Factor

2,374

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.