CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Automated Optimum Route Generator and Data Analyzer

by Nitin Arora, Somansh Garg, Varad Sant, Rohit Goyal
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 181 - Number 48
Year of Publication: 2019
Authors: Nitin Arora, Somansh Garg, Varad Sant, Rohit Goyal
10.5120/ijca2019918654

Nitin Arora, Somansh Garg, Varad Sant, Rohit Goyal . Automated Optimum Route Generator and Data Analyzer. International Journal of Computer Applications. 181, 48 ( Apr 2019), 17-21. DOI=10.5120/ijca2019918654

@article{ 10.5120/ijca2019918654,
author = { Nitin Arora, Somansh Garg, Varad Sant, Rohit Goyal },
title = { Automated Optimum Route Generator and Data Analyzer },
journal = { International Journal of Computer Applications },
issue_date = { Apr 2019 },
volume = { 181 },
number = { 48 },
month = { Apr },
year = { 2019 },
issn = { 0975-8887 },
pages = { 17-21 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume181/number48/30479-2019918654/ },
doi = { 10.5120/ijca2019918654 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T01:10:00.807092+05:30
%A Nitin Arora
%A Somansh Garg
%A Varad Sant
%A Rohit Goyal
%T Automated Optimum Route Generator and Data Analyzer
%J International Journal of Computer Applications
%@ 0975-8887
%V 181
%N 48
%P 17-21
%D 2019
%I Foundation of Computer Science (FCS), NY, USA
Abstract

As a traveler, it has become a necessity to first select the most optimum analyze route that is the shortest path to travel the cities and then travel through the path. This paper is aimed to provide its users the most optimized path to travel, that will consume the minimum amount of time and distance. To achieve this, Travelling Salesman Problem algorithm through genetic algorithm has been implemented. The paper also provides with the feature of a data analyzer. This aims to analyze the data provided by the users for a particular city and generate the ratings based on the data. To provide the feature of data analyzer, Knuth-Morris-Pratt algorithm for pattern matching and TRIE data structure for efficient retrieval of data has been used. As every traveler always ensure the reviews and rating of the place before visiting it, getting a brief review and knowing the rating of the city will help them in selecting the city to visit.

References
  1. https://iccl.inf.tu-dresden.de/w/images/b/b7/GA_for_TSP.pdf
  2. Knuth, Donald; Morris, James H.; Pratt, Vaughan (1977). "Fast pattern matching in strings". SIAM Journal on Computing. 6 (2): 323–350.doi:10.1137/0206024.
  3. Van Brummelen, Glen Robert (2013). Heavenly Mathematics: The Forgotten Art of Spherical Trigonometry. Princeton University Press. ISBN 9780691148922. 0691148929. Retrieved 2015-11-10.
  4. Brass, Peter (2008). Advanced Data Structures. Cambridge University Press.
  5. Black, Paul E. (2009-11-16). "trie". Dictionary of Algorithms and Data Structures. National Institute of Standards and Technology. Archived from the original on 2010-05- 19.
  6. EH.L. Aarts, J.H.M. Korst and RJ.M. van Laarhoven, A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem, J. Statist. Phys. 50(1988) 189 - 206.
  7. Garima Pandey, Mamta Martolia and Nitin Arora. A Novel String Matching Algorithm and Comparison with KMP Algorithm. International Journal of Computer Applications 179(3):6-8, December 2017.
Index Terms

Computer Science
Information Sciences

Keywords

Route Optimization Genetic Algorithms Travelling Salesman Problem Time Complexity KMP Algorithm

Powered by PhDFocusTM