Taxi sharing services have been increasing in the past few years in several countries. In this paper we propose a solution to taxi sharing problem based on Vehicle Routing Problem (VRP) with Temporal Restriction. We approach the problem in a static way, for testing purposes. Two metaheuristics were used to determine the best travel plans for taxi sharing service, taking into account the pickup and delivery time of each passenger. Tabu Search (TS) and Simulated Annealing (SA) were used to solve the problem, as literature review suggested, presenting good results. Four test scenario were used with 10, 20, 30 and 40 passengers, knowing their starting location. Analysis of solutions found by TS and SA are compared to the average cost to conclude which is the best travel plan to be used by taxi sharing service.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    An exploratory study of taxi sharing schemas




    Publication date :

    2016-11-01


    Size :

    323082 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Taxi sharing method

    ZHANG XIAOLIANG | European Patent Office | 2015

    Free access

    Real-Time Distributed Taxi Ride Sharing

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


    Alternative Pickup Locations in Taxi-Sharing: A Feasibility Study

    Aliari, Sanaz / Haghani, Ali | Transportation Research Record | 2022


    Key Technologies of Taxi-Sharing System

    Hao, Zhongna / Qin, Yunmei | ASCE | 2011


    Limited Information-Sharing Strategy for Taxi–Customer Searching Problem in Nonbooking Taxi Service

    Lee, Der-Horng / Wu, Xian / Sun, Lijun | Transportation Research Record | 2013