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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    A partition based match making algorithm for taxi sharing


    Beteiligte:
    Jiajian Xiao, (Autor:in) / Aydt, Heiko (Autor:in) / Lees, Michael (Autor:in) / Knoll, Alois (Autor:in)


    Erscheinungsdatum :

    2013-10-01


    Format / Umfang :

    2043148 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    A Partition-Based Match Making Algorithm for Dynamic Ridesharing

    Pelzer, Dominik / Xiao, Jiajian / Zehe, Daniel et al. | IEEE | 2015



    Taxi sharing method

    ZHANG XIAOLIANG | Europäisches Patentamt | 2015

    Freier Zugriff

    Real-Time Distributed Taxi Ride Sharing

    Bathla, Kanika / Raychoudhury, Vaskar / Saxena, Divya et al. | IEEE | 2018


    Key Technologies of Taxi-Sharing System

    Hao, Zhongna / Qin, Yunmei | ASCE | 2011