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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Lawler, E.L., Lenstra, J.K., Rinnooy Khan, A.H.G., Shmoys, D.B.: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. John Wiley & Sons, Chichester (1985) ISBN 0-471-90413-9
Gutin, G., Punnen, A.P.: The Traveling Salesman Problem and Its Variations. Springer, Heidelberg (2006) ISBN 0-387-44459-9
Bing Maps Winforms User Control, https://vearthcontrol.svn.codeplex.com/svn/
Applegate, D.L., Bixby, R.E., Chvatal, V., Cook, W.J.: The Traveling Salesman Problem A Computational Study
Bektas, T.: The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 34, 209–219 (2006)
Üçoluk, G.: Genetic Algorithm Solution of the TSP Avoiding Special Crossover and Mutation. Intelligent Automation and Soft Computing 3(8) (2002)
Engebretsen, L., Karpinski, M.: Approximation hardness of TSP with bounded metrics. In: Yu, Y., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 201–212. Springer, Heidelberg (2001)
Al-Dulaimi, B.F., Ali, H.A.: Enhanced Traveling Salesman Problem Solving by Genetic Algorithm Technique (TSPGA). In: Proceeding of the World Academy of Science, Engineering and Technology, pp. 296–302, Rome 25th -27th (2008)
Zhang, L., Yao, M., Zheng, N.: Optimization and Improvement of Genetic Algorithms Solving Traveling Salesman Problem. In: International Conference on Image Analysis and Signal Processing (2009)
Kaur, B., Mittal, U.: Optimization of TSP using Genetic Algorithm. Advances in Computational Sciences and Technology 3(2), 119–125 (2010) ISSN 0973-6107
Sallabi, O.M., El-Haddad, Y.: An Improved Genetic Algorithm to Solve the Traveling Salesman Problem. World Academy Of Science, Engineering And Technology 52, 471–474 (2009) ISSN: 1307-6892
Holland, J.: Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. The University of Michigan Press, Ann Arbor (1975)
Berman, P., Karpinski, M.: 8/7-Approximation Algorithm for (1,2)-TSP. In: Proc. 17th ACM-SIAM SODA, pp. 641–648 (2006)
Gen, M., Cheng, R.: Genetic algorithms and engineering design, pp. 59–64. Wiley-Interscience, Hoboken (1997)
Nearchou, A.C.: The effect of various operators on the genetic search for large scheduling problems. Elsevier-Internation Journal of Production Economics 88, 191–203 (2004)
Dantzig, G.B., Fulkerson, R., Johnson, S.M.: Solution of a large-scale traveling salesman problem. Operations Research 2, 393–410 (1954)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn., pp. 1027–1033 (Section 35.2: The traveling-salesman problem). MIT Press and McGraw-Hill (2001), ISBN 0-262-03293-7
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nunes, J., Matos, L., Trigo, A. (2011). Taxi Pick-Ups Route Optimization Using Genetic Algorithms. In: Dobnikar, A., Lotrič, U., Šter, B. (eds) Adaptive and Natural Computing Algorithms. ICANNGA 2011. Lecture Notes in Computer Science, vol 6593. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20282-7_42
Download citation
DOI: https://doi.org/10.1007/978-3-642-20282-7_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20281-0
Online ISBN: 978-3-642-20282-7
eBook Packages: Computer ScienceComputer Science (R0)