dc.contributor.authorKümmel, Michal
dc.contributor.authorBusch, Fritz
dc.contributor.authorWang, David Zhi Wei
dc.identifier.citationKümmel, M., Busch, F., & Wang, D. Z. W. (2016). Taxi dispatching and stable marriage. Procedia Computer Science, 83, 163-170. doi:10.1016/j.procs.2016.04.112en_US
dc.description.abstractThis 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 for matching men and women according to their preferences in polynomial time. The results of the custom built simulation model show that the taxi dispatching strategy based on the stable marriage matching improves the taxi operation performance in all observed indicators (taxi profit, number of served passengers, not-occupied and total taxi mileage and passenger waiting time) as compared to the standard first-come, first-served strategy.en_US
dc.description.sponsorshipNRF (Natl Research Foundation, S’pore)en_US
dc.format.extent8 p.en_US
dc.relation.ispartofseriesProcedia Computer Scienceen_US
dc.rights© 2016 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)en_US
dc.subjectReal-time Taxi Dispatchingen_US
dc.subjectStable Marriage Assignment Algorithmen_US
dc.subjectDRNTU::Engineering::Civil engineeringen_US
dc.titleTaxi dispatching and stable marriageen_US
dc.typeJournal Article
dc.contributor.schoolSchool of Civil and Environmental Engineeringen_US
dc.description.versionPublished versionen_US

Files in this item


This item appears in the following Collection(s)

Show simple item record