Advertisement

Application of Intelligent Algorithms for the Development of a Virtual Automated Planning Assistant for the Optimal Tourist Travel Route

  • Natalia Yanishevskaya
  • Larisa Kuznetsova
  • Ksenia Lokhacheva
  • Lubov Zabrodina
  • Denis ParfenovEmail author
  • Irina Bolodurina
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 1126)

Abstract

The article considers an approach based on the use of the production model of knowledge representation, as well as the algorithm of the ant colony simulation method for finding the optimal route in a loaded graph taking into account the time of stops and sightseeing. At the first stage of the system, the intelligent module, based on a small survey of users, selects the most interesting objects for the user, taking into account his preferences regarding recreation, mode of travel, as well as time and budget constraints. In the second stage, the route planning module builds the optimal route between the places proposed by the system in the first stage. The results of the study show that the proposed software-algorithmic solution is relevant and allows the user to build the optimal route for a tourist trip between objects.

Keywords

Tourism Travel Intellectual recommendation systems Optimization Route planning Coordinate descent method TSP The production model 

Notes

Acknowledgment

The study was conducted with the support of the Ministry of Education of the Orenburg region in the framework of the research “Intellectual virtual assistant for planning trips to the sights of the Orenburg region” (project no. 3 on 14 August 2019). The studies were performed in accordance with the R & D plan for 2019–2020 at the Federal State Scientific Institution «Federal Research Centre of Biological Systems and Agro-technologies of the Russian Academy of Sciences» (# 0761-2019-0004).

References

  1. 1.
    Shakhovska, N., Shakhovska, K., Fedushko, S.: Some aspects of the method for tourist route creation. In: Proceedings of the International Conference of Artificial Intelligence, Medical Engineering, Education, pp. 527–537. Springer, Cham (2018)Google Scholar
  2. 2.
    Rodríguez, B., Molina, J., Pérez, F., et al.: Interactive design of personalized tourism routes. J. Tour. Manag. 33(4), 926–940 (2002)CrossRefGoogle Scholar
  3. 3.
    Chang, H.-T., Chang, Y.-M., et al.: ATIPS: automatic travel itinerary planning system for domestic areas. J. Comput. Intell. Neurosci. 2016, 13 (2016)Google Scholar
  4. 4.
    Xie, M., Lakshmanan, L.V.S., Wood P.T.: CompRec-Trip: a composite recommendation system for travel planning. In: Proceedings of the IEEE 27th International Conference on Data Engineering, ICDE 2011, pp. 1352–1355. IEEE (2011)Google Scholar
  5. 5.
    Wang, H., Zhang, F., Cui, P.: A parking lot induction method based on Dijkstra algorithm. In: Proceedings of the 2017 Chinese Automation Congress (CAC), pp. 5247–5251. IEEE (2017)Google Scholar
  6. 6.
    Miah, Md.S.U., Masuduzzaman, Md., Sarkar, W., Islam, H.M.M., Porag, F., Hossain, S.: Intelligent tour planning system using crowd sourced data. Int. J. Educ. Manag. Eng. (IJEME) 8(1), 22–29 (2018)CrossRefGoogle Scholar
  7. 7.
    Hsu, C.-M., Lian, F.-L., Ting, J.-A., et al: A road detection based on bread-first search in urban traffic scenes. In: Proceedings of the 2011 8th Asian Control Conference (ASCC), pp. 1393–1397. IEEE (2011)Google Scholar
  8. 8.
    Hougardy, S.: The Floyd-Warshall algorithm on graphs with negative cycles. J. Inf. Process. Lett. 110(8–9), 279–281 (2010)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Cui, S.-G., Wang, H., Yang, L.: A simulation study of A-star algorithm for robot path planning. In: Proceedings of the 16th International Conference on Mechatronics Technology, pp. 506–509. IEEE (2012)Google Scholar
  10. 10.
    Djojo M. A., Karyono K.: Computational load analysis of Dijkstra, A*, and Floyd-Warshall algorithms in mesh network. In: Proceedings of the 2013 International Conference on Robotics, Biomimetics, Intelligent Computational Systems, pp. 104–108. IEEE (2013)Google Scholar
  11. 11.
    Furculita, A.G., Ulinic, M.V., Rus, A.B., et al: Implementation issues for modified Dijkstra’s and Floyd-Warshall algorithms in OpenFlow. In: Proceedings of the 2013 RoEduNet International Conference 12th Edition: Networking in Education and Research, pp. 1–6. IEEE (2013)Google Scholar
  12. 12.
    Dela Cruz, J.C., Magwili, G.V., Mundo, J.P.E., et al: Items-mapping and route optimization in a grocery store using Dijkstra’s, Bellman-Ford and FloydWarshall algorithms. In: Proceedings of the IEEE Region 10 Annual International Conference, pp. 243–246. IEEE (2017)Google Scholar
  13. 13.
    Risald, R., Mirino, A., Suyoto: Best route selection using Dijkstra and Floyd-Warshall algorithm. In: Proceedings of the 2017 11th International Conference on Information & Communication Technology and System, pp. 155–158. IEEE (2017)Google Scholar
  14. 14.
    Zulfiqar, L.O.M., Isnanto, R.R., Nurhayati, O.D.: Optimal distribution route planning based on collaboration of Dijkstra and sweep algorithm. In: Proceedings of the 2018 10th International Conference on Information Technology and Electrical Engineering, pp. 371–375. IEEE (2018)Google Scholar
  15. 15.
    Liu, J., Li, W.: Greedy permuting method for genetic algorithm on traveling salesman problem. In: Proceedings of the 2018 8th International Conference on Electronics Information and Emergency Communication, pp. 47–51. IEEE (2018)Google Scholar
  16. 16.
    Gupta, I.K., Choubey, A., Choubey, S.: Randomized bias genetic algorithm to solve traveling salesman problem. In: Proceedings of the 2017 8th International Conference on Computing, Communication and Networking Technologies (ICCCNT), pp. 1–6. IEEE (2017)Google Scholar
  17. 17.
    Chen, H., et al: Ant colony optimization with tabu table to solve TSP problem. In: Proceedings of the 2018 37th Chinese Control Conference (CCC), pp. 2523–2527. IEEE (2018)Google Scholar
  18. 18.
    Yang, N., Ma, X., Li, P.: An improved angle-based crossover tabu search for the larger-scale traveling salesman problem. In: Proceedings of the 2009 WRI Global Congress on Intelligent Systems, pp. 584–587. IEEE (2009)Google Scholar
  19. 19.
    Liu, Y., Shen, X., Chen, H.: An adaptive ant colony algorithm based on common information for solving the traveling salesman problem. In: Proceedings of the 2012 International Conference on Systems and Informatics, ICSAI 2012, pp. 763–766. IEEE (2012)Google Scholar
  20. 20.
    Bolodurina, I., Parfenov, D.: The optimization of traffic management for cloud application and services in the virtual data center. In: Proceedings of the International Conference on Parallel Computing Technologies, pp. 418–426. Springer, Cham (2017)Google Scholar
  21. 21.
    Dennouni, N., Yvan, P., Lancieri, L., Slama, Z.: Towards an incremental recommendation of POIs for mobile tourists without profiles. Int. J. Intell. Syst. Appl. (IJISA) 10(10), 42–52 (2018)Google Scholar

Copyright information

© The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Orenburg State UniversityOrenburgRussia
  2. 2.Federal State Scientific Institution «Federal Research Centre of Biological Systems and Agro-Technologies of the Russian Academy of Sciences»OrenburgRussia

Personalised recommendations