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

A Comparative Analysis for Determining the Optimal Path using PSO and GA

by Kavitha Sooda, T. R. Gopalakrishnan Nair
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 32 - Number 4
Year of Publication: 2011
Authors: Kavitha Sooda, T. R. Gopalakrishnan Nair
10.5120/3890-5444

Kavitha Sooda, T. R. Gopalakrishnan Nair . A Comparative Analysis for Determining the Optimal Path using PSO and GA. International Journal of Computer Applications. 32, 4 ( October 2011), 8-12. DOI=10.5120/3890-5444

@article{ 10.5120/3890-5444,
author = { Kavitha Sooda, T. R. Gopalakrishnan Nair },
title = { A Comparative Analysis for Determining the Optimal Path using PSO and GA },
journal = { International Journal of Computer Applications },
issue_date = { October 2011 },
volume = { 32 },
number = { 4 },
month = { October },
year = { 2011 },
issn = { 0975-8887 },
pages = { 8-12 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume32/number4/3890-5444/ },
doi = { 10.5120/3890-5444 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:18:16.163670+05:30
%A Kavitha Sooda
%A T. R. Gopalakrishnan Nair
%T A Comparative Analysis for Determining the Optimal Path using PSO and GA
%J International Journal of Computer Applications
%@ 0975-8887
%V 32
%N 4
%P 8-12
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Significant research has been carried out recently to find the optimal path in network routing. Among them, the evolutionary algorithm approach is an area where work is carried out extensively. We in this paper have used particle swarm optimization (PSO) and genetic algorithm (GA) for finding the optimal path and the concept of region based network is introduced along with the use of indirect encoding. We demonstrate the advantage of fitness value and hop count in both PSO and GA. A comparative study of PSO and genetic algorithm (GA) is carried out, and it was found that PSO converged to arrive at the optimal path much faster than GA.

References
  1. Araujo, B. Ribeiro, L. Rodrigues. 2001. A neural network for shortest path computation. IEEE Trans. Neural Network. 12(5), 1067-1073.
  2. M.Gen, R.Cheng, D.Wang. 1997. Genetic algorithm for solving shortest path problems. In Proceedings of the IEEE International Conference on Evolutionary Computation, 401-406.
  3. Bellman, Richard. 1958. On a routing problem. J. Quarterly of Applied Mathematics: 16, 87–90.
  4. Dijkstra, E. W. 1959 .A note on two problems in connection with graphs. Numerische Mathematik 1(1959), 269–271.
  5. Ammar,W. Mohemmed., Nirod, Chandra. Sahoo., Tan, Kim. Geok. 2008. Solving shortest path problem using particle swarm optimization. J. Elsevier, Applied Soft Computing, 1643-1653.
  6. Carolina, Fortuna., Michael, Mohorcic. 2009. Trends in the development of communication networks: Cognitive networks. J. Computer Networks. 53 (2009) 1354–1376.
  7. David, Raymer., Sven, van. Der. Meer., John, Strassner. 2008. From Autonomic Computing to Autonomic Networking: an Architectural Perspective. Fifth IEEE Workshop on Engineering of Autonomic and Autonomous Systems, 174-183.
  8. J.Arunadevi, Dr.V.Rajamani. 2010. Optimized routing in Mobile Ad Hoc Networks using Evolutionary Location Intelligence. IJCA Special Issue on “Mobile Ad-hoc Networks” MANETs. 120-123.
  9. Floyd, Robert. W. 1962. Algorithm 97: Shortest Path. Communications of the ACM 5, 1962 (6): 345.
  10. Johnson, Donald. B. 1993. Efficient algorithms for shortest paths in sparse networks. Journal of the ACM 24 (1), 1–13.
  11. R.Hssan, B. Cohanim, O.L. DeWeck, G. Venter. 2005. A comparison of particle swarm optimization and genetic algorithm. In Proceedings of the First AIAA Multidisciplinary Design Optimization Specialist Conference, 18-21.
  12. C.R. Mouser, S.A. Dunn. 2005. Comparing genetic algorithms and particle swarm optimization for an inverse problem exercise. Aust. N. Z. Ind. Appl. Math. (ANZIAM) J.46 (E), C89-C101.
  13. Kennedy, R.C.Eberhart. 1995. Particle swarm optimization. In Proceedings of the IEEE International Conference on Neural Networks, 1942-1948.
  14. Shengxiang, Yang., Hui, Cheng., and Fang, Wang. 2010. Genetic Algorithms with Immigrants and memory schemes for dynamic shortest path routing problems in mobile AdHoc networks. IEEE Transactions on systems, man, and cybernetics – applications and reviews, 40(1).
Index Terms

Computer Science
Information Sciences

Keywords

Region based network Shortest Path Problem

Powered by PhDFocusTM