Taxi pick-ups route optimization using genetic algorithms

Authors:
Jorge Nunes;Luís Matos;António Trigo
Affiliations:
Coimbra Institute of Engineering, Coimbra, Portugal;Coimbra Institute of Engineering, Coimbra, Portugal;Coimbra Institute of Engineering, Coimbra, Portugal
Venue:
ICANNGA'11 Proceedings of the 10th international conference on Adaptive and natural computing algorithms - Volume Part I
Year:
2011

Citing 4
Cited 0

Introduction to algorithms

Introduction to algorithms
Approximation Hardness of TSP with Bounded Metrics

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
8/7-approximation algorithm for (1,2)-TSP

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)

The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a case study of a taxi drive company whose problem is the pick up passengers more efficiently in order to save time and fuel. The taxi company journey starts and ends in the two near by locations, which can be address as the same location for the problem solving, transforming this problem in a typical Travelling Salesman Problem where the goal is, given a set of cities and roads, to find the best route by which to visit every city and return home. The result of the study is a user-friendly software tool that allows the selection on a map of the pick-up locations of the taxi passengers presenting afterwards in the same map the best route that was computed using a genetic algorithm. The taxi company is currently using the developed software.