An exploratory study of taxi sharing schemas

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.

[1]  Daniel Castro Silva,et al.  A comparative study of meta-heuristics for the aircraft landing scheduling problem , 2016, 2016 11th Iberian Conference on Information Systems and Technologies (CISTI).

[2]  Rosaldo J. F. Rossetti,et al.  Policy and incentive designs evaluation: A social-oriented framework for Artificial Transportation Systems , 2014, 17th International IEEE Conference on Intelligent Transportation Systems (ITSC).

[3]  Djamel Khadraoui,et al.  A transport based clearing system for dynamic carpooling business services , 2011, 2011 11th International Conference on ITS Telecommunications.

[4]  J. Dunn,et al.  Transportation , 1999 .

[5]  Kathryn A. Dowsland,et al.  Simulated Annealing , 1989, Encyclopedia of GIS.

[6]  Rosaldo J. F. Rossetti,et al.  Social Simulation of Rescue Teams' Dynamic Planning , 2016, WorldCIST.

[7]  Ronghui Liu,et al.  Advances in Artificial Transportation Systems and Simulation , 2014 .

[8]  Rosaldo J. F. Rossetti,et al.  A systematic review protocol on shared transportation , 2016, 2016 11th Iberian Conference on Information Systems and Technologies (CISTI).

[9]  Jeng-Fung Chen.  APPROACHES FOR THE VEHICLE ROUTING PROBLEM WITH SIMULTANEOUS DELIVERIES AND PICKUPS , 2006 .

[10]  Álvaro Torralba,et al.  Solving Multi-modal and Uni-modal Transportation Problems through TIMIPlan , 2012 .

[11]  Rosaldo J. F. Rossetti,et al.  A MULTI-AGENT DEMAND MODEL , 2002 .

[12]  Ramayya Krishnan,et al.  Understanding Sequential Decisions via Inverse Reinforcement Learning , 2013, 2013 IEEE 14th International Conference on Mobile Data Management.

[13]  Hassan Artail,et al.  The shared-taxi problem: Formulation and solution methods , 2014 .

[14]  Ibrahim H. Osman,et al.  Hybrid Genetic Algorithm, Simulated Annealing and Tabu Search Methods for Vehicle Routing Problems with Time Windows , 1997 .

[15]  Gábor Nagy,et al.  A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries , 2008, J. Comb. Optim..

[16]  Peter Rossmanith,et al.  Simulated Annealing , 2008, Taschenbuch der Algorithmen.

[17]  Manuel Laguna,et al.  Tabu Search , 1997 .

[18]  Djamel Khadraoui,et al.  Carpooling: A Multi-Agent Simulation In Netlogo , 2011, ECMS.

[19]  Daniel Castro Silva,et al.  MoCaS: Mobile Carpooling System , 2015, WorldCIST.

[20]  Rosaldo J. F. Rossetti,et al.  Playing Transportation Seriously: Applications of Serious Games to Artificial Transportation Systems , 2013, IEEE Intelligent Systems.

[21]  Alexandre Xavier Martins,et al.  EXPERIÊNCIAS COM SIMULATED ANNEALING E BUSCA TABU NA RESOLUÇÃO DO PROBLEMA DE ALOCAÇÃO DE SALAS , 2002 .

[22]  Penousal Machado,et al.  An Inverted Ant Colony Optimization approach to traffic , 2014, Eng. Appl. Artif. Intell..