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

Comparative Analysis of Search Algorithms

by Maharshi J. Pathak, Ronit L. Patel, Sonal P. Rami
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 179 - Number 50
Year of Publication: 2018
Authors: Maharshi J. Pathak, Ronit L. Patel, Sonal P. Rami
10.5120/ijca2018917358

Maharshi J. Pathak, Ronit L. Patel, Sonal P. Rami . Comparative Analysis of Search Algorithms. International Journal of Computer Applications. 179, 50 ( Jun 2018), 40-43. DOI=10.5120/ijca2018917358

@article{ 10.5120/ijca2018917358,
author = { Maharshi J. Pathak, Ronit L. Patel, Sonal P. Rami },
title = { Comparative Analysis of Search Algorithms },
journal = { International Journal of Computer Applications },
issue_date = { Jun 2018 },
volume = { 179 },
number = { 50 },
month = { Jun },
year = { 2018 },
issn = { 0975-8887 },
pages = { 40-43 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume179/number50/29520-2018917358/ },
doi = { 10.5120/ijca2018917358 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:58:53.991492+05:30
%A Maharshi J. Pathak
%A Ronit L. Patel
%A Sonal P. Rami
%T Comparative Analysis of Search Algorithms
%J International Journal of Computer Applications
%@ 0975-8887
%V 179
%N 50
%P 40-43
%D 2018
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Nowadays many artificial intelligence search algorithms are available to figure out the problem of shortest path finding. The paper presents the detailed study of informed search and uninformed search techniques. The paper focuses more towards uninformed search strategies such as BFS, DFS, and UCS and informed search strategies like A*, and Best First Search. The paper includes working of search techniques, their merits, and demerits, where these algorithms are applicable, also open and closed list for each algorithm are shown. At last comparison of search techniques based on complexity, optimality and completeness are presented in tabular form.

References
  1. Deepika Garg, COMPARATIVE STUDY OF VARIOUS SEARCHING ALGORITHMS, National Conference on Innovative Trends in Computer Science Engineering (ITCSE-2015) held at BRCMCET, Bahal on 4th April 2015.
  2. Chandel, and Manu Sood, Searching and Optimization Techniques in Artificial Intelligence: A Comparative Study & Complexity Analysis, International Journal of Advanced Research in Computer Engineering & Technology (IJARCET) Volume 3 Issue 3, March 2014.
  3. Mr. Girish P Potdar, and Dr.R C Thool, COMPARISON OF VARIOUS HEURISTIC SEARCH TECHNIQUES FOR FINDING SHORTEST PATH, International Journal of Artificial Intelligence & Applications (IJAIA), Vol. 5, No. 4, July 2014.
  4. LIU Jingang, and LIU Yujun, Application of A* algorithm in Traffic Navigational System, Information Engineering and Electronic Commerce (IEEC), 2010 2nd International Symposium on. IEEE, 2010.
  5. Phanthong, Thanapong, et al. Application of A* algorithm for real-time path re-planning of an unmanned surface vehicle avoiding underwater obstacles. Journal of Marine Science and Application 13.1 (2014): 105-116.
  6. R.E. Korf, Scientific Paper on Artificial Intelligence Search Algorithms, University of California Los Angeles, June 1999.
  7. Eric A Hansen, and Rong Zhou, Anytime Heuristic Search, Journal of Artificial Intelligence Research 28, pp 267-287, 2007.
  8. Anne L. Gardner, Search: An Overview, AI magazine, Vol. 2, Number 1. Sept. 1980.
  9. A.Martelli, On the search complexity of admissible search algorithms, Al, Vol. 8, pp 1-13, 1977.
  10. R.K.Ahuja, K. Mehlhorn, J.B.Orlin and R.E.Tarjan, Faster algorithms for shortest path algorithms, Journal of the Association for Computing Machinery,Vol. 37, No. 2, pp 213-223, April 1990.
Index Terms

Computer Science
Information Sciences

Keywords

Artificial intelligence informed search search algorithms shortest path algorithms uninformed search.

Powered by PhDFocusTM