This paper analyses the use of exact offline optimization methods for benchmarking online taxi dispatching strategies where the objective is to minimize the total passenger waiting time. First, a general framework for simulating dynamic transport services in MATSim (Multi-Agent Transport Simulation) is described. Next, the model of online taxi dispatching is defined, followed by a formulation of the offline problem as a mixed integer programming problem. Three benchmarks based on the offline problem are presented and compared to two simple heuristic strategies and a hypothetical simulation with teleportation of idle taxis. The benchmarks are evaluated and compared using the simulation scenario of taxi services in the city of Mielec. The obtained (approximate) lower and upper bounds for the minimum total passenger waiting time indicate directions for further research.


    Access

    Download


    Export, share and cite



    Title :

    BENCHMARKING MINIMUM PASSENGER WAITING TIME IN ONLINE TAXI DISPATCHING WITH EXACT OFFLINE OPTIMIZATION METHODS


    Contributors:


    Publication date :

    2014




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown





    New Taxi–Passenger Dispatching Model at Terminal Station

    Wang, Liwei / Yan, Xuedong | ASCE | 2019


    A Smart Taxi Dispatching System

    Awang, R.-M. / ITS Congress Association | British Library Conference Proceedings | 2000


    Taxi guiding and dispatching system

    LI MINGXIAN / WANG HANLEI / DONG YIPENG et al. | European Patent Office | 2015

    Free access

    Taxi dispatch control system and method for taxi dispatching

    NAKAMURA KAZUTO | European Patent Office | 2021

    Free access