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.
An exploratory study of taxi sharing schemas
2016-11-01
323082 byte
Conference paper
Electronic Resource
English
Real-Time Distributed Taxi Ride Sharing
IEEE | 2018
|Alternative Pickup Locations in Taxi-Sharing: A Feasibility Study
Transportation Research Record | 2022
|Key Technologies of Taxi-Sharing System
ASCE | 2011
|Limited Information-Sharing Strategy for Taxi–Customer Searching Problem in Nonbooking Taxi Service
Transportation Research Record | 2013
|