As an important mode of urban transportation, taxi is of considerable significance for the commuters. The taxi service stations are important for the efficient operations of taxis. Current approaches for the location optimization of taxi service stations are not well aligned with the actual demand. The present study uses the taxi GPS data to identify and extract actual service needs. Then based on the K-Means clustering algorithm, we obtain the demand details and then use the DBSCAN (Density-Based Spatial Clustering of Applications with Noise) clustering algorithm to obtain candidate locations. A multi-stage and bi-objective optimization model of placing taxi service stations is proposed based on the maximal covering model. Its two objectives are the maximal demand covering and the minimal cost during accepting service. An experiment conducted based on the data of Wuxi city in China demonstrates that the proposed approach exhibits good performance in placing taxi service stations.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Multi-stage optimization of taxi service stations location using GPS data


    Contributors:
    Zhang, Yong (author) / Feng, Donghuan (author) / Zhang, Rui (author) / Geng, Nana (author)


    Publication date :

    2017-03-01


    Size :

    710867 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Taxi location system

    Nakamura,K. / Sugiura,Y. / Ikuta,Y. et al. | Automotive engineering | 1992


    TRAILER TOWING TAXI AND TAXI SERVICE METHOD USING TRAILER TOWING TAXI

    IWATSUKA KOICHI / OGAWA YOSHINARI | European Patent Office | 2020

    Free access

    Taxi Operation and Management System Based on Distributed Only Taxi Stations Solving Strategy

    Zhao, L. / Xing, J.P. | British Library Conference Proceedings | 2013


    Multi-attribute taxi logistics optimization

    Li, Sonny (Sonny Heng) | DSpace@MIT | 2006

    Free access