An Assignment-Based Approach to Efficient Real-Time City-Scale Taxi Dispatching. Maciejewski, M., Bischoff, J., & Nagel, K. IEEE Intelligent Systems, 31(1):68-77, IEEE, 1, 2016. Website abstract bibtex © 2001-2011 IEEE.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.
@article{
title = {An Assignment-Based Approach to Efficient Real-Time City-Scale Taxi Dispatching},
type = {article},
year = {2016},
identifiers = {[object Object]},
keywords = {Computational modeling,Dispatching,Heuristic algorithms,Public transportation,Real-time systems,Vehicle dynamics,Vehicles},
pages = {68-77},
volume = {31},
websites = {http://ieeexplore.ieee.org/document/7389909/},
month = {1},
publisher = {IEEE},
id = {e738ef03-e049-3594-9d80-eea7e2fc6b90},
created = {2020-01-15T12:34:14.050Z},
file_attached = {false},
profile_id = {b8bb86b0-2c01-3ebb-b066-8c77b393d3cc},
group_id = {8fe4ad94-b417-3a1e-85a0-b9d7ccc60bbd},
last_modified = {2020-01-15T12:34:16.638Z},
read = {true},
starred = {true},
authored = {false},
confirmed = {true},
hidden = {false},
citation_key = {Maciejewski2016},
folder_uuids = {ab988724-fb48-4cfc-b686-2d2750b932cc},
private_publication = {false},
abstract = {© 2001-2011 IEEE.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.},
bibtype = {article},
author = {Maciejewski, Michal and Bischoff, Joschka and Nagel, Kai},
journal = {IEEE Intelligent Systems},
number = {1}
}
Downloads: 0
{"_id":"NLygJz6HNuSuKFGvd","bibbaseid":"maciejewski-bischoff-nagel-anassignmentbasedapproachtoefficientrealtimecityscaletaxidispatching-2016","authorIDs":[],"author_short":["Maciejewski, M.","Bischoff, J.","Nagel, K."],"bibdata":{"title":"An Assignment-Based Approach to Efficient Real-Time City-Scale Taxi Dispatching","type":"article","year":"2016","identifiers":"[object Object]","keywords":"Computational modeling,Dispatching,Heuristic algorithms,Public transportation,Real-time systems,Vehicle dynamics,Vehicles","pages":"68-77","volume":"31","websites":"http://ieeexplore.ieee.org/document/7389909/","month":"1","publisher":"IEEE","id":"e738ef03-e049-3594-9d80-eea7e2fc6b90","created":"2020-01-15T12:34:14.050Z","file_attached":false,"profile_id":"b8bb86b0-2c01-3ebb-b066-8c77b393d3cc","group_id":"8fe4ad94-b417-3a1e-85a0-b9d7ccc60bbd","last_modified":"2020-01-15T12:34:16.638Z","read":"true","starred":"true","authored":false,"confirmed":"true","hidden":false,"citation_key":"Maciejewski2016","folder_uuids":"ab988724-fb48-4cfc-b686-2d2750b932cc","private_publication":false,"abstract":"© 2001-2011 IEEE.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.","bibtype":"article","author":"Maciejewski, Michal and Bischoff, Joschka and Nagel, Kai","journal":"IEEE Intelligent Systems","number":"1","bibtex":"@article{\n title = {An Assignment-Based Approach to Efficient Real-Time City-Scale Taxi Dispatching},\n type = {article},\n year = {2016},\n identifiers = {[object Object]},\n keywords = {Computational modeling,Dispatching,Heuristic algorithms,Public transportation,Real-time systems,Vehicle dynamics,Vehicles},\n pages = {68-77},\n volume = {31},\n websites = {http://ieeexplore.ieee.org/document/7389909/},\n month = {1},\n publisher = {IEEE},\n id = {e738ef03-e049-3594-9d80-eea7e2fc6b90},\n created = {2020-01-15T12:34:14.050Z},\n file_attached = {false},\n profile_id = {b8bb86b0-2c01-3ebb-b066-8c77b393d3cc},\n group_id = {8fe4ad94-b417-3a1e-85a0-b9d7ccc60bbd},\n last_modified = {2020-01-15T12:34:16.638Z},\n read = {true},\n starred = {true},\n authored = {false},\n confirmed = {true},\n hidden = {false},\n citation_key = {Maciejewski2016},\n folder_uuids = {ab988724-fb48-4cfc-b686-2d2750b932cc},\n private_publication = {false},\n abstract = {© 2001-2011 IEEE.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.},\n bibtype = {article},\n author = {Maciejewski, Michal and Bischoff, Joschka and Nagel, Kai},\n journal = {IEEE Intelligent Systems},\n number = {1}\n}","author_short":["Maciejewski, M.","Bischoff, J.","Nagel, K."],"urls":{"Website":"http://ieeexplore.ieee.org/document/7389909/"},"bibbaseid":"maciejewski-bischoff-nagel-anassignmentbasedapproachtoefficientrealtimecityscaletaxidispatching-2016","role":"author","keyword":["Computational modeling","Dispatching","Heuristic algorithms","Public transportation","Real-time systems","Vehicle dynamics","Vehicles"],"downloads":0},"bibtype":"article","creationDate":"2020-01-15T12:20:52.451Z","downloads":0,"keywords":["computational modeling","dispatching","heuristic algorithms","public transportation","real-time systems","vehicle dynamics","vehicles"],"search_terms":["assignment","based","approach","efficient","real","time","city","scale","taxi","dispatching","maciejewski","bischoff","nagel"],"title":"An Assignment-Based Approach to Efficient Real-Time City-Scale Taxi Dispatching","year":2016}