Abstract
Nowadays, the Route Optimization Problem (ROP) is one of the most studied combinational optimization problems that researchers study. Although it is easy to define, its solution is hard. Therefore, it is one of the NP-hard problems in the research literature. It can be used to solve real-life problems such as route planning and scheduling, and transportation and logistics applications. Using the optimal tour results in efficient use of time and fuel. This paper aims to develop an Android Application that can provide optimal tour (shortest distance) to visit a set of clients. Genetic Algorithm is used to solves the problem and is implemented using the Google API and Android OS. The source code of the application is available at url https://github.com/Genethh/VentasExpress.
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
References
Bryant, K., Benjamin, A.: Genetic algorithms and the traveling salesman problem, pp. 10–12. Department of Mathematics, Harvey Mudd College (2000)
Garey, M.R.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1997)
Helshani, L.: An android application for Google map navigation system, solving the travelling salesman problem, optimization throught genetic algorithm. In: Velencei, J. (ed.) Proceedings of FIKUSZ 2015, pp. 89–102. Faculty of Business and Management, Óbuda University, Keleti (2015). https://ideas.repec.org/h/pkk/sfyr15/89-102.html
Hervert-Escobar, L., Alexandrov, V.: Iterative projection approach for solving the territorial business sales optimization problem. Procedia Comput. Sci. 122, 1069–1076 (2017)
Larranaga, P., Kuijpers, C.M.H., Murga, R.H., Inza, I., Dizdarevic, S.: Genetic algorithms for the travelling salesman problem: a review of representations and operators. Artif. Intell. Rev. 13(2), 129–170 (1999)
Liu, R., Jiang, Z., Geng, N.: A hybrid genetic algorithm for the multi-depot open vehicle routing problem. OR spectr. 36(2), 401–421 (2014)
Narwadi, T., Subiyanto: An application of traveling salesman problem using the improved genetic algorithm on android Google Maps. In: AIP Conference Proceedings, vol. 1818, p. 020035. AIP Publishing (2017)
Razali, N.M., Geraghty, J., et al.: Genetic algorithm performance with different selection strategies in solving TSP. In: Proceedings of the World Congress on Engineering, vol. 2, pp. 1134–1139. International Association of Engineers Hong Kong (2011)
Reese, A.: Random number generators in genetic algorithms for unconstrained and constrained optimization. Nonlinear Anal.: Theory Methods Appl. 71(12), e679–e692 (2009)
Vaira, G., Kurasova, O.: Genetic algorithm for VRP with constraints based on feasible insertion. Informatica 25(1), 155–184 (2014)
Veness, C.: Calculate distance and bearing between two latitude/longitude points using Haversine formula in javascript. Movable Type Scripts (2011)
Wang, Y.: The hybrid genetic algorithm with two local optimization strategies for traveling salesman problem. Comput. Ind. Eng. 70, 124–133 (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Zambrano-Vega, C., Acosta, G., Loor, J., Suárez, B., Jaramillo, C., Oviedo, B. (2019). A Sales Route Optimization Mobile Application Applying a Genetic Algorithm and the Google Maps Navigation System. In: Rocha, Á., Ferrás, C., Paredes, M. (eds) Information Technology and Systems. ICITS 2019. Advances in Intelligent Systems and Computing, vol 918. Springer, Cham. https://doi.org/10.1007/978-3-030-11890-7_50
Download citation
DOI: https://doi.org/10.1007/978-3-030-11890-7_50
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-11889-1
Online ISBN: 978-3-030-11890-7
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)