An Exploratory Study of Taxi Sharing Schemas

• Type: Article in International Conference Proceedings Book
• Date: 2016

Authors

Eugénio Oliveira (Author) FEUP; E Silva (Author) FEUP; Rosaldo J. F. Rossetti (Author) FEUP; Zafeiris Kokkinogenis (Author) FEUP; Daniel Castro Silva (Author) FEUP; Álvaro Câmara (Author) FEUP; João Ulisses (Author) Other; urbano, j (Author) FEUP

Conference proceedings International

Title: IEEE 19th International Conference on Intelligent Transportation Systems: Proceedings

Pages: 247-252

ITSC 2016 - 19th IEEE International Conference on Intelligent Transportation Systems

Rio de Janeiro, 1 de novembro de 2016

Indexing

ISI Web of Knowledge - 6 Citations

Scopus - 6 Citations

Other information

Authenticus ID: P-00M-AM3

DOI: 10.1109/ITSC.2016.7795562

Abstract (EN): 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.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 6