An Application on Mobile Devices with Android and IOS Operating Systems Using Google Maps APIs for the Traveling Salesman Problem

References

• Applegate, D. L., R. E. Bixby, V. Chvatal, and W. J. Cook. 2011. The traveling salesman problem: A computational study. Princeton University Press, 41 William Street, Princeton, New Jersey, USA.
   Google Scholar
• Arora, S. 1998. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. Journal of the ACM (JACM) 45 (5):753–82. doi:10.1145/290179.290180.
   Web of Science ®Google Scholar
• Ascheuer, N., M. Fischetti, and M. Grötschel. 2001. Solving the asymmetric travelling salesman problem with time windows by branch-and-cut. Mathematical Programming 90 (3):475–506. doi:10.1007/PL00011432.
   Web of Science ®Google Scholar
• Aydin, A., and S. Telceken. 2015. Artificial intelligence aided recommendation based mobile trip planner for Eskisehir city. In Industrial Electronics and Applications (ICIEA), Auckland, New Zealand, 15–17 June 2015, 1650–54.
   Google Scholar
• Dantzig, G., R. Fulkerson, and S. Johnson. 1954. Solution of a large-scale traveling-salesman problem. Journal of the Operations Research Society of America 2 (4):393–410. doi:10.1287/opre.2.4.393.
   Web of Science ®Google Scholar
• Dorigo, M., 1992. Optimization, learning and natural algorithms. Ph. D. Thesis, Politecnico di Milano, Milano, Italy.
   Google Scholar
• Fajardo, J. T., and C. M. Oppus. 2010. A mobile disaster management system using the android technology. WSEAS Transactions on Communications 9 (6):343–53.
   Google Scholar
• Garey, M. R., and D. S. Johnson. 1979. Computers and intractability: A guide to the theory of NP-Completeness. New York: W. H. Freeman And Company, New York, USA.
   Google Scholar
• Held, M., and R. M. Karp. 1962. A dynamic programming approach to sequencing problems. Journal of the Society for Industrial and Applied Mathematics 10 (1):196–210. doi:10.1137/0110015.
   Google Scholar
• Helshani, L. 2015. An android application for google map navigation system, solving the travelling salesman problem, optimization throught genetic algorithm. Proceedings of FIKUSZ, 89, Óbuda University, Budapest, Hungary.
   Google Scholar
• Hingrajiya, K. H., R. K. Gupta, and G. S. Chandel. 2012. An ant colony optimization algorithm for solving travelling salesman problem. International Journal of Scientific and Research Publications 2 (8):1–6.
   Google Scholar
• Hlaing, Z. C., and M. A. Khine. 2011. Solving traveling salesman problem by using improved ant colony optimization algorithm. International Journal of Information and Education Technology 1 (5):404. doi:10.7763/IJIET.2011.V1.67.
   Google Scholar
• Holland, J. H. 1975. Adaptation in natural and artificial systems. Ann Arbor: The University of Michigan Press, London, England.
   Google Scholar
• Jana, S., and M. Chattopadhyay. 2015. An event-driven university campus navigation system on android platform. In Applications and Innovations in Mobile Computing (AIMoC), Kolkata, India, 12-14 February 2015, 182–87.
   Google Scholar
• Johnson, D. S. 1990. Local optimization and the Traveling Salesman Problem. In International Colloquium on Automata, Languages, and Programming (ICALP), England, 16–20 July 1990, 446–461.
   Google Scholar
• Johnson, D. S., and L. A. McGeoch. 1997. The traveling salesman problem: A case study in local optimization. Local Search in Combinatorial Optimization 1:215–310.
   Google Scholar
• Király, A., and J. Abonyi. 2015. Redesign of the supply of mobile mechanics based on a novel genetic optimization algorithm using Google Maps API. Engineering Applications of Artificial Intelligence 38:122–30. doi:10.1016/j.engappai.2014.10.015.
   Web of Science ®Google Scholar
• Li, B., L. Wang, and W. Song. 2008. Ant colony optimization for the traveling salesman problem based on ants with memory. Natural Computation 7:496–501.
   Google Scholar
• Menger, K. 1932. Das botenproblem. In Ergebnisse eines Mathematischen Kolloquiums, Vol. 2. Leipzig, Germany: Teubner.
   Google Scholar
• Miller, D. L., and J. F. Pekny. 1991. Exact solution of large asymmetric traveling salesman problems. Ed., K. Menger, Science 251 (4995):754–61. doi:10.1126/science.251.4995.754.
   PubMed Web of Science ®Google Scholar
• Mohammed, K. S. 2013. Modified ant colony optimization for solving traveling salesman problem. International Journal of Engineering & Computer Science 13 (5):1–5.
   Google Scholar
• Osaba, E., X. S. Yang, F. Diaz, P. Lopez-Garcia, and R. Carballedo. 2016. An improved discrete bat algorithm for symmetric and asymmetric Traveling Salesman Problems. Engineering Applications of Artificial Intelligence 48:59–71. doi:10.1016/j.engappai.2015.10.006.
   Web of Science ®Google Scholar
• Silva, C. A., and T. A. Runkler. 2004. Ant colony optimization for dynamic traveling salesman problems. In ARCS Workshops, Brussels, Belgium, 22–24 September 2008, 259–66.
   Google Scholar
• Strategy Analytics. 2015. Global smartphone shipments growth slows to 15 percent in Q2 2015. July,Boston, United States, Strategy Analytics Inc.
   Google Scholar
• Zhang, W., and R. E. Korf. 1996. A study of complexity transitions on the asymmetric traveling salesman problem. Artificial Intelligence 81 (1):223–39. doi:10.1016/0004-3702(95)00054-2.
   Web of Science ®Google Scholar