Welcome to Open Science
Contact Us
Home Books Journals Submission Open Science Join Us News
Tourism Strategy Evaluated by Genetic and Ant Colony Algorithms
Current Issue
Volume 5, 2018
Issue 5 (September)
Pages: 114-120   |   Vol. 5, No. 5, September 2018   |   Follow on         
Paper in PDF Downloads: 48   Since Sep. 13, 2018 Views: 1175   Since Sep. 13, 2018
Authors
[1]
Xiaoyang Zheng, Institute of Liangjiang Artificial Intelligence, Chongqing University of Technology, Chongqing, China.
[2]
Qingsong Liu, College of Science, Chongqing University of Technology, Chongqing, China.
[3]
Yong Fu, College of Science, Chongqing University of Technology, Chongqing, China.
Abstract
Tourism has experienced continued growth and travel experience has played an important role affecting leisure. Consequently, it is very important to provide optimal tourism strategy for tourists. The main task of this article is that the Genetic algorithm (GA) and Ant Colony Optimization algorithm (ACO) are implemented to choose the best travel route from ten cities in China, respectively. First, the principles of the two optimization algorithms are introduced. Second, two types of travel strategies by air and by car are evaluated by using the GA and ACO, respectively. The different optimal routes are obtained by different algorithm parameters, while the length of these optimal routes is the same 6259 kilometer. Then, these different optimal travel routes can be provided for different tourists. Finally, the influences on the optimal path caused by the parameters of each algorithm are analyzed and compared, respectively. It can be found that the change of the parameters has a great influence on the convergence of the ACO. By comparing the travel time by air with that by car, we offer the tourism strategy and the corresponding the best travel route for tourists.
Keywords
Tourism Strategy, Genetic Algorithm, Ant Colony Optimization, Optimal Path
Reference
[1]
J. H. Holland. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. University of Michigan Press, Ann Arbor, MI, 1975.
[2]
M. Dorigo. Optimization, Learning and Natural Algorithms, PhD thesis, Politecnico di Milano, Italy, 1992.
[3]
Kerman Iran. Research in Random Parameters of Genetic Algorithm and Its Application on TSP and Optimization Problem, Walailak Journal Science and Technol. 2015, 12 (1).
[4]
Zengrui Tian, Yang Zhao and Yuanjun Zhao. The Design of the Best Travel Route Based on Genetic Algorithm and Ant Colony Algorithm. Mathematics in Practice and Theory, 2016, 46 (24): 41-48.
[5]
Hao Wang, Kaijun Wu. Ant colony algorithm and its application in Traveling Salesman Problem (TSP) (City number, 70). Microcomputer Information, 2010, 26 (16-3): 199-201.
[6]
Yue LI. Improvement and Research on TSP Problem by Immune Algorithm Based on Genetic Algorithm. Journal of Communication University of China, 2017.
[7]
Yingying Yu, Yan Chen and Taoying Li. Improved ant colony genetic algorithm for traveling salesman problem, Computer Simulation, 2013, 30 (11): 317-320.
[8]
Yong Li and Shihua Gong, Dynamic ant colony optimsation for TSP, Int J Adv Manuf Technol. 2003, 22: 528-533.
[9]
Meimei Yu. Improved genetic algorithm based on ant colony algorithm. Journal of Anhui University of Science andTechnology, 2009, 29 (3): 58-63.
[10]
J. Ning, Q. Zhang, C. Zhang and B. Zhang. A best-path-updating information-guided ant colony optimization algorithm. Information Sciences, 2018, 433–434: 142-162.
[11]
D. Alves, M. Neto, F. Ferreira. A novel algorithm based on ant colony optimization and game theory for travelling salesman problem. International Conference, 2018: 62-66.
[12]
J. D. Shang, LI Pan-Le. A Novel Hybrid Parallel Genetic Algorithm to Solve Traveling Salesman Problems. International Conference on Artificial Intelligence Science & Technology, 2017: 54-64.
[13]
] K. Deep, H. Mebrahtu, A. K. Nagar. Novel GA for metropolitan stations of Indian railways when modelled as a TSP. International Journal of System Assurance Engineering & Management, 2018: 1-7.
[14]
H. Allaoua. Combination of Genetic Algorithm with Dynamic Programming for solving TSP. International Journal of Advances in Soft Computing & Its Applications, 2017, 9 (2): 31-44.
[15]
Decai Zong, Kangkang Wang and Yong Ding. A review of the ant colony algorithm for solving travel problems. Computer and Mathematics, 2004, 11: 2004-2013.
[16]
T. Narwadi, Subiyanto. An application of traveling salesman problem using the improved genetic algorithm on android google maps. International Conference on Education, 2017, 1818.
[17]
Hui Wang. Comparison of several intelligent algorithms for solving TSP problem in industrial engineering. Systems Engineering Procedia, 2012, 4: 226-235.
Open Science Scholarly Journals
Open Science is a peer-reviewed platform, the journals of which cover a wide range of academic disciplines and serve the world's research and scholarly communities. Upon acceptance, Open Science Journals will be immediately and permanently free for everyone to read and download.
CONTACT US
Office Address:
228 Park Ave., S#45956, New York, NY 10003
Phone: +(001)(347)535 0661
E-mail:
LET'S GET IN TOUCH
Name
E-mail
Subject
Message
SEND MASSAGE
Copyright © 2013-, Open Science Publishers - All Rights Reserved