A partition based match making algorithm for taxi sharing

Jiajian Xiao, Heiko Aydt, Michael Lees, Alois Knoll

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

Taxi sharing can help to improve the utilisation of taxis. Passengers for sharing are always chosen with some objectives in mind, for example, to minimise the inconvenience caused due to de-tours when picking up or dropping off other passengers. In this paper, we describe a method that optimises the match making process in order to minimise the inconvenience imposed on passengers. This method is based on the idea of dividing the road network into several partitions so that a certain quality of service requirement regarding inconvenience is satisfied. More precisely, this can be considered as a constrained optimisation problem.We describe a procedure how to decide on optimal parameters for the partitioning algorithm. In addition, we analyse the theoretical maximum sharing potential of commuters in Singapore using a simulation-based approach.

Original languageEnglish
Title of host publication2013 16th International IEEE Conference on Intelligent Transportation Systems
Subtitle of host publicationIntelligent Transportation Systems for All Modes, ITSC 2013
Pages2393-2400
Number of pages8
DOIs
StatePublished - 2013
Event2013 16th International IEEE Conference on Intelligent Transportation Systems: Intelligent Transportation Systems for All Modes, ITSC 2013 - The Hague, Netherlands
Duration: 6 Oct 20139 Oct 2013

Publication series

NameIEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC

Conference

Conference2013 16th International IEEE Conference on Intelligent Transportation Systems: Intelligent Transportation Systems for All Modes, ITSC 2013
Country/TerritoryNetherlands
CityThe Hague
Period6/10/139/10/13

Fingerprint

Dive into the research topics of 'A partition based match making algorithm for taxi sharing'. Together they form a unique fingerprint.

Cite this