1. An exploratory study of taxi sharing schemas
- Author
-
Eugénio Oliveira, Daniel Castro Silva, Joana Urbano, Joao Ulisses, Zafeiris Kokkinogenis, Rosaldo J. F. Rossetti, Elis Regina Silva, and Alvaro Camara
- Subjects
Service (systems architecture) ,Engineering ,021103 operations research ,business.industry ,0211 other engineering and technologies ,02 engineering and technology ,Tabu search ,Transport engineering ,Public transport ,Vehicle routing problem ,Simulated annealing ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,Scenario testing ,business ,Metaheuristic ,Average cost - Abstract
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.
- Published
- 2016
- Full Text
- View/download PDF