i-manager Publications

Personalized Itinerary Planning Using an Adaptive Genetic Algorithm

Madhuravani*, Kakkurla Vivek**, Mohammed Sammer Khan***, Chinthapally Rishitha Reddy****, Kodiganti Shiva Prasad *****

*-*****Sreyas Institute of Engineering and Technology, Hyderabad, India.

Periodicity:January - March'2023
DOI : https://doi.org/10.26634/jit.12.1.19804

Abstract

Planning an itinerary for travelling can be tedious, time-consuming, and challenging. This is especially true for tourists who have limited time budgets and are unfamiliar with a wide range of Points-of-Interest (POIs) in a city. To address this challenge, this paper proposes an Adaptive Genetic Algorithm (AGA) for personalized itinerary planning. This approach considers travelers' preferences, such as mandatory POIs, total number of POIs, POI popularity, POI cost, and POI rating. It views the itinerary planning problem as a multi-objective optimization problem and proposes an Adaptive Genetic Algorithm (AGA) to solve this problem. The results show that the AGAM algorithm is a promising approach for personalized itinerary planning. It is able to find itineraries that meet the traveler's preferences that are efficient in terms of time, cost, and overall rating.

Keywords

Adaptive Genetic Algorithm, Personalized Itinerary Planning, Multi-Objective Optimization, POIs.

How to Cite this Article?

Madhuravani, Vivek, K., Khan, M. S., Reddy, C. R., and Prasad, K. S. (2023). Personalized Itinerary Planning Using an Adaptive Genetic Algorithm. i-manager’s Journal on Information Technology, 12(1), 8-14. https://doi.org/10.26634/jit.12.1.19804

References

[1]. Al-Dulaimi, B. F., & Ali, H. A. (2008). Enhanced Traveling Salesman Problem Solving by Genetic Algorithm Technique (TSPGA). International Journal of Mathematical and Computational Sciences, 2(2), 123- 129.

[2]. Bhagel, A. S., & Rastogi, R. (2011). Effective approaches for solving large travelling salesman problems with small populations. International Journal of Advances in Engineering Research (IJAER), 1(1).

[3]. Borovska, P. (2006, June). Solving the travelling salesman problem in parallel by genetic algorithm on multicomputer cluster. In International Conference on Computer Systems and Technologies-CompSysTech (pp. 1-6).

[4]. Brezina Jr, I., & Čičková, Z. (2011). Solving the travelling salesman problem using the ant colony optimization. Management Information Systems, 6(4), 10-14.

[5]. Chudasama, C., Shah, S. M., & Panchal, M. (2011, December). Comparison of parents selection methods of genetic algorithm for TSP. In International Conference on Computer Communication and Networks CSI-COMNET- 2011 (pp. 85-87).

[6]. Ding, C., Cheng, Y., & He, M. (2007). Two-level genetic algorithm for clustered traveling salesman problem with application in large-scale TSPs. Tsinghua Science & Technology, 12(4), 459-465.

[7]. Dwivedi, V., Chauhan, T., Saxena, S., & Agrawal, P. (2012). Travelling salesman problem using genetic algorithm. International Journal of Computer Applications (IJCA), (1), 25-30.

[8]. Fan, H. (2010). Discrete particle swarm optimization for TSP based on neighborhood. Journal of Computational Information Systems, 6(10), 3407-3414.

[9]. Kumar, N. (2012). A genetic algorithm approach to study travelling salesman problem. Journal of Global Research in Computer Science, 3(3), 33-37.

[10]. Moon, C., Kim, J., Choi, G., & Seo, Y. (2002). An efficient genetic algorithm for the traveling salesman problem with precedence constraints. European Journal of Operational Research, 140(3), 606-617.

[11]. Penev, M. K. V. S. S. (2005). Genetic operators crossover and mutation in solving the TSP problem. In International Conference on Computer Systems and Technologies (pp. 1-6).

[12]. Philip, A., Taofiki, A. A., & Kehinde, O. (2011). A genetic algorithm for solving travelling salesman problem. International Journal of Advanced Computer Science and Applications, 2(1), 26-29.

[13]. Ray, S. S., Bandyopadhyay, S., & Pal, S. K. (2004, August). New operators of genetic algorithms for traveling salesman problem. In Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004, 2, 497-500. IEEE.

[14]. Shi, X. H., Liang, Y. C., Lee, H. P., Lu, C., & Wang, Q. X. (2007). Particle swarm optimization-based algorithms for TSP and generalized TSP. Information Processing Letters, 103(5), 169-176.

[15]. Sivanandam, S. N., & Deepa, S. N. (2009). A comparative study using genetic algorithm and particle swarm optimization for lower order system modelling. International Journal of the Computer, the Internet and Management, 17(3), 1-10.

[16]. Snyder, L. V., & Daskin, M. S. (2006). A random-key genetic algorithm for the generalized traveling salesman problem. European Journal of Operational Research, 174(1), 38-53.

[17]. Yang, R. (1997, September). Solving large travelling salesman problems with small populations. In Second International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications (pp. 157-162). IET.

If you have access to this article please login to view the article or kindly login to purchase the article

Single Article

	North Americas,UK, Middle East,Europe		India	Rest of world
	USD	EUR	INR	USD-ROW
Online	15	15

ADD TO CART

Options for accessing this content:

If you would like institutional access to this content, please recommend the title to your librarian.
If you already have i-manager's user account: Login above and proceed to purchase the article.
New Users: Please register, then proceed to purchase the article.