A Novel Optimized Travel Planner
DOI:
https://doi.org/10.54060/JIEEE/003.01.007Keywords:
Dijkstra’s algorithm, shortest path, graph, node, edge, time complexity, space complexityAbstract
In 1959, Dijkstra announced a method for determining the shortest path between two nodes in a network. This algorithm has received much attention because it can deal with various real-life problems. The algorithm is a greedy type. Other types of algorithms are also created and compared. Application-related changes are made to the original algorithm. The time complexity of the algorithm increases at the expense of space complexity. Space is more complex with modern hardware, so that you can implement such an algorithm.
Downloads
References
D. Gavalas, C. Konstantopoulos, K. Mastakas, G. Pantziou, "A survey on algorithmic approaches for solving tourist trip design problems", Journal of Heuristics, vol. 20, no. 3, pp. 291-328, 2014.
C. Chung-Hua, H. Chenyang, "A Platform for Travel Planning by using Google Maps", 16th IEEE Int. Conf. Mobile Data Management, vol. 2, pp. 120-125, Jun. 2015.
F.B. Zhan, C. Noon, "Shortest Path Algorithms: An Evaluation Using Real Road Networks", Transportation Science, vol. 32, no. 1, pp. 65-73, November 1996.
D. Gavalas, C. Konstantopoulos, K. Mastakas, G. Pantziou, "Mobile recommender systems in tourism", Journal of Network and Computer Applications, vol. 39, pp. 319-333, 2014.
C. Chung-Hua and H. Chenyang, "A Platform for Travel Planning by using Google Maps", 16th IEEE Int. Conf. Mobile Data Management, vol. 2, pp. 120-125, Jun. 2015.
T. Angskun and J. Angskun, "A travel planning optimization under energy and time constraints", Int. Conf. Information and Multimedia Technology ICIMT, pp. 131-134, Dec. 2009.
E. H.-C. Lu, C.-Y. Lin and V. S. Tseng, "Trip-mine: An efficient trip planning approach with travel time constraints", Proc. IEEE 12th Int. Conf. Mobile Data Management ser. MDM '11, vol. 1, pp. 152-161, 2011.
W. C. Chia, L. S. Yeong, F. J. Xian Lee and S. I. Ch'ng, "Trip planning route optimization with operating hour and duration of stay constraints," 2016 11th International Conference on Computer Science & Education (ICCSE), 2016, pp. 395-400, doi: 10.1109/ICCSE.2016.7581613.
A.V. Goldberg, “A simple shortest path algorithm with linear average time”, in: ESA, 2001, pp. 230–241.
J. B. Orlin, K. Madduri, K. Subramani, and M. Williamson, “A faster algorithm for the single source shortest path problem with few distinct positive lengths,” J. Discrete Algorithms (Amst.), vol. 8, no. 2, pp. 189–198, 2010.
W. A. K. D. Wijesinghe, A. G. L. D. P. Amarasinghe, T. M. U. A. Bandara, Aruna Ishara Gamage, Devanshi Ganegoda, "VOYAGER – Smart Travel Guidance Cross Platform Mobile Application", 2021 3rd International Conference on Advancements in Computing (ICAC), pp.163-168, 2021.
Sumit S. Muddalkar, Nishant S. Chaturkar, Khushal D. Ingole, Shreyash B. Wadaskar, Rahul B. Lanjewar, "Electric Vehicle Charging Station Finding App", International Journal of Advanced Research in Science, Communication and Technology, pp.607, 2022.
Larisa Kuznetsova, Arthur Zhigalov, Natalia Yanishevskaya, Denis Parfenov, Irina Bolodurina, "Application of a Modified Ant Colony Imitation Algorithm for the Traveling Salesman Problem with Time Windows When Designing an Intelligent Assistant", Advances in Intelligent Systems, Computer Science and Digital Economics, vol.1127, pp.346, 2020.
Patrick Kaltenrieder, Jorge Parra, Thomas Krebs, Noémie Zurlinden, Edy Portmann, Thomas Myrach, Designing Cognitive Cities, vol.176, pp.235, 2019.
Baivab Maulik, Aditi P Nayak, Sanjana U, Simmi Alok, Divyaprabha K N, "Design and Implementation of Virtual Tour Guide App", 2022 International Conference on Advanced Computing Technologies and Applications (ICACTA), pp.1-6, 2022.
Downloads
Published
How to Cite
CITATION COUNT
Issue
Section
