Skip to main content
SpringerLink
Log in

Independent travel recommendation algorithm based on analytical hierarchy process and simulated annealing for professional tourist

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

Independent travelers, especially professional independent travelers, tend to plan their trip schedules according to their interests, preferred hotels, landmarks they wish to visit, budgets, time availability and various other factors. Hence, travel schedule planning is valuable for satisfying the unique needs of each traveler. In this paper, we propose an algorithm for independent travel recommendation, consisting of three steps. Firstly, landmarks in the destination are selected under the specific constraints, which is modeled as a 0-1 knapsack problem. Then, the landmarks will be evaluated comprehensively using AHP (Analytic Hierarchy Process) model, and the greedy simulated annealing algorithm is adopted to select the best landmarks with high evaluation scores. Next, with AHP-decision model, a most reasonable free line to the tourist destination is selected from multiple candidates. Lastly, the path planning among the landmarks is abstracted as a TSP (Travelling Sales Problem) problem, and the simulated annealing algorithm based on roulette wheel selection is adopted to solve it. Through simulation experiments, by comparing with package tour from the aspects of landmark selection, valid sightseeing time ratio, valid sightseeing consumption ratio and the tourist satisfaction, the proposed algorithm is evaluated and analyzed. Simulation results illustrate the feasibility and rationality of our approach, which can be used as an effective reference deciding individualized travel schedules and trip planning.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19

Similar content being viewed by others

References

  1. Kurata Y (2010) Interactive Assistance for Tour Planning. Spatial Cognition VII. Proceedings International Conference Spatial Cognition 2010, pp 289–302. https://doi.org/10.1007/978-3-642-14749-4_25

  2. Barange M, De Loor P, Louis V, Querrec R, Soler J, Trinh T-H, Maisel E, Chevaillier P (2011) Get involved in an interactive virtual tour of brest harbour: Follow the guide and participate. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6895:93-99. https://doi.org/10.1007/978-3-642-23974-8_10

  3. Thompson GM (1993) Representing employee requirements in labour tour scheduling. Omega 21:6. https://doi.org/10.1016/0305-0483(93)90007-8

    Article  Google Scholar 

  4. Bottcher M, Schneider H, Hackstein L (2012) Application and evaluation of a cost apportionment approach for integrating tour planning aspects into applied location planning. Logist Res 5:65–76. https://doi.org/10.1007/s12159-012-0081-1

    Article  Google Scholar 

  5. Almi’ani K, Viglas A, Libman L (2016) Tour and path planning methods for efficient data gathering using mobile elements. Int J Ad Hoc Ubiquit Comput 21:11–25. https://doi.org/10.1504/IJAHUC.2016.074386

    Article  Google Scholar 

  6. Yi S (2014) Research on application of improved genetic algorithm in full independent tourist route planning. Dissertation, China Jiliang University (in Chinese)

  7. Zhang P (2014) Research and implement of self-organized expeditions. Dissertation, Shanghai Jiao Tong University (in Chinese)

  8. Liu C, Chen J (2008) The personal tour planning engine based on genetic algorithm. Proceedings of the 2008 International Conference on Advanced Infocomm Technology ICAIT ’08. https://doi.org/10.1145/1509315.1509316

  9. Huang H-C (2013) The application of ant colony optimization algorithm in tour route planning. J Theor Appl Inf Technol

  10. Li Y (2015) Design and Implementation of IOS-client for a Free Tour application. Dissertation, Beijing Jiaotong University (in Chinese)

  11. Gao Y, Xue R (2013) An improved simulated annealing and genetic algorithm for TSP. 2013 5th IEEE International Conference on Broadband Network Multimedia Technology, pp. 6–9. https://doi.org/10.1109/ICBNMT.2013.6823904

  12. Maeda Y, Miyaji T, Miyakawa M (2006) Evaluation of the preset travel routes in a self-determination support system. Annual International Conference of the IEEE Engineering in Medicine and Biology - Proceedings, pp. 5920–5923. https://doi.org/10.1109/IEMBS.2006.259908

  13. Zhao C (2012) Basic theory and key technology of personalized tourism information service system. Dissertation, Lanzhou University

  14. Wang X, Spiegler E, Timnat YM (1998) Application of simulated annealing algorithm to thermally choked ram accelerator design. 34th AIAA/ASME/SAE/ASEE Joint Propulsion Conference and Exhibit

  15. Cabrera G, Roncagliolo G, Riquclme SD, Cubillos JP, Sotou RC (2012) A hybrid particle swarm optimization - simulated annealing algorithm for the probabilistic travelling salesman problem. Stud Inf Control 21:49–58

    Google Scholar 

  16. Lee B-J, Lee S, Im D-Y, Kim H-J, Park G-L, Lee J (2012) Tour and charging scheduler development based on simulated annealing for electric vehicles. Commun Comput Inf Sci, pp. 189–194. https://doi.org/10.1007/978-3-642-35521-928

  17. Zheng J, Han X (2010) Study on the selection of venture capitalists based on fuzzy AHP. Proceedings - 3rd International Conference on Information Management, Innovation Management and Industrial Engineering, ICIII 2010 2:570–573. https://doi.org/10.1109/ICIII.2010.303

  18. Udo GJ, Kirs PJ (2002) Information Technology adoption decision analysis using AHP. Proceedings - Annual Meeting of the Decision Sciences Institute, pp. 1601–1606

  19. Maity S, Roy A, Maiti M (2015) A Modified Genetic Algorithm for solving uncertain Constrained Solid Travelling Salesman Problems,. Comput Ind Eng 83:273–296. https://doi.org/10.1016/j.cie.2015.02.023

    Article  Google Scholar 

  20. Chakraborty S, Bhowmik S (2015) Blending roulette wheel selection with simulated annealing for job shop scheduling problem. Proceedings of Michael Faraday IET International Summit 2015 100:7

  21. Goyal S, Gupta R (2010) Optimization of fidelity with adaptive genetic watermarking algorithm using roulette-wheel. Proceedings - 2010 International Conference on Computational Intelligence and Communication Networks, CICN 2010, pp. 591–596. https://doi.org/10.1109/CICN.2010.117

  22. Chen R-M, Feng C-H (2011) Intrusion detection analysis by integrating roulette wheel and pseudo-random into back propagation networks. Proc Int Conf Mach Learn Cybern 2:751–756. https://doi.org/10.1109/ICMLC.2011.6016820

    Google Scholar 

  23. Zou Y-P, Liu H-L (2008) New dynamic load balancing method based on roulette wheel selection and its implementation. Tongxin Xuebao/Journal on Communications 29:18–23

    Google Scholar 

  24. Abbaspour RA, Samadzadegan F (2011), Time-dependent personal tour planning and scheduling in metropolises. Expert Syst Appl. https://doi.org/10.1016/j.eswa.2011.04.025

  25. Yang L, Aimin Z, Guixu Z (2011) Simulated annealing with probabilistic neighborhood for traveling salesman problems. 2011 Seventh International Conference on Natural Computation (ICNC 2011) 3. https://doi.org/10.1109/ICNC.2011.6022345

  26. de Groot C, Wurtz D, Hoffmann KH (1991) Optimizing complex problems by nature’s algorithms: simulated annealing and evolution strategy-a comparative study. Parallel Problem Solving from Nature. 1st Workshop, PPSN 1 Proceedings, pp. 445–454. https://doi.org/10.1007/BFb0029786

  27. Triki E, Collette Y, Siarry P (2005) A theoretical study on the behavior of simulated annealing leading to a new cooling schedule. Eur J Oper Res 166:77–92. https://doi.org/10.1016/j.ejor.2004.03.035

    Article  MathSciNet  MATH  Google Scholar 

  28. Zhu J-W, Rui T, Liao M, Zhang J-L (2010) Multi-group ant colony algorithm based on simulated annealing method. J Shanghai Univ

  29. Allahyari S, Salari M, Vigo D (2015) A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem. Eur J Oper Res 242:756–768. https://doi.org/10.1016/j.ejor.2014.10.048

    Article  MathSciNet  MATH  Google Scholar 

  30. Ismail Z (2008) Traveling salesman approach for solving petrol distribution using simulated annealing. Am J Appl Sci 5:1543–1546. https://doi.org/10.3844/ajassp.2008.1543.1546

    Article  Google Scholar 

  31. Shih-Wei L (2015) A simulated annealing heuristic for the multiconstraint team orienteering problem with multiple time windows. Appl Soft Comput 37:632–642. https://doi.org/10.1016/j.asoc.2015.08.058

    Article  Google Scholar 

  32. Guangming L, Xiaomeng S, Jian W (2011) A simulated annealing- new genetic algorithm and its application, 2011. Int Conf Electron Optoelectron (ICEOE 2011) 3:246–249. https://doi.org/10.1109/ICEOE.2011.6013350

    Google Scholar 

  33. Li J, Xinhui W, Haitao J (2013) A mixed optimization algorithm based on simulated annealing particle swarm algorithm and genetic algorithm. In J Digit Content Technol Appl 7:451–457. https://doi.org/10.4156/jdcta.vol7.issue5.54

    Article  Google Scholar 

  34. Bisht S (2004) Hybrid genetic-simulated annealing algorithm for optimal weapon allocation in multilayer defence scenario. Def Sci J 54:395–405

    Article  Google Scholar 

  35. Vohra R (1988) Probabilistic analysis of the longest Hamiltonian tour problem. Networks 18:13–18. https://doi.org/10.1002/net.3230180103

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This paper is partially supported by The National Natural Science Foundation of China (No. 61363019, No.61563044 and No. 61640206), Open Research Fund Program of State key Laboratory of Hydroscience and Engineering (No.sklhse-2017-A-05), and National Natural Science Foundation of Qinghai Province (No. 2014-ZJ-718, No. 2015-ZJ-725).

Author information

Authors and Affiliations

  1. State Key Laboratory of Plateau Ecology and Agriculture, Department of Computer Technology and Applications, Qinghai University, Xining, 810016, China

    Qingyi Pan & Xiaoying Wang

  2. State Key Laboratory of Hydroscience and Engineering, Tsinghua University, Beijing, 100084, China

    Qingyi Pan & Xiaoying Wang

Authors
  1. Qingyi Pan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiaoying Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiaoying Wang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Pan, Q., Wang, X. Independent travel recommendation algorithm based on analytical hierarchy process and simulated annealing for professional tourist. Appl Intell 48, 1565–1581 (2018). https://doi.org/10.1007/s10489-017-1014-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-017-1014-0

Keywords

Search

Navigation