We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 December 2024
Reseach Article

Solving Routing Problem using Particle Swarm Optimization

by Abhishek Toofani
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 52 - Number 18
Year of Publication: 2012
Authors: Abhishek Toofani
10.5120/8301-1692

Abhishek Toofani . Solving Routing Problem using Particle Swarm Optimization. International Journal of Computer Applications. 52, 18 ( August 2012), 16-18. DOI=10.5120/8301-1692

@article{ 10.5120/8301-1692,
author = { Abhishek Toofani },
title = { Solving Routing Problem using Particle Swarm Optimization },
journal = { International Journal of Computer Applications },
issue_date = { August 2012 },
volume = { 52 },
number = { 18 },
month = { August },
year = { 2012 },
issn = { 0975-8887 },
pages = { 16-18 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume52/number18/8301-1692/ },
doi = { 10.5120/8301-1692 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:52:36.258652+05:30
%A Abhishek Toofani
%T Solving Routing Problem using Particle Swarm Optimization
%J International Journal of Computer Applications
%@ 0975-8887
%V 52
%N 18
%P 16-18
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In a graph there are so many paths can exist from a source to a destination node. Among them finding optimal path is very difficult problem. It is an NP hard problem to find path in a graph. In this paper a swarm intelligence technique called Particle swarm Optimization is used to solve routing problem which give optimal path from graph. Here discrete mathematics is used to encode particle in PSO, which break search space in small search space and solve this discrete optimization.

References
  1. Kennedy, J. Bur. of Labor Stat. , 1995, Proceedings. IEEE International Conference on neural network.
  2. F. Xiang, L. Junzhou, W. Jieyi, G. Guanqun, 1999, QoS routing based on genetic.
  3. Chang Wook Ahn, Student, R. S. Ramakrishna, 2002, a genetic algorithm for shortesh path routing problem and sizing of populations, ieee transactions on evolutionary computation. Vol. 6, no. 6.
  4. Yiheng Xu1, Jinglu Hu, Kotaro Hirasawa, Xiaohong Pang, 2007, a new cooperative approach to discrete particle swarm optimization, SICE Annual Conference.
  5. Guoliang Xue,2003, minimum cost multicast and unicast routing in communication network, ieee transactions on communications, vol. 51, no. 5,
  6. Rehab F. Abdel-Kader,2011, an improved discrete PSO with GA operators for efficient QoS- multicast routing, International Journal of Hybrid Information Technology Vol. 4, No. 2.
  7. E. Baburaj1, and V. Vasudevan2, 2008, An Intelligent Mesh Based Multicast Routing Algorithm for MANETs using particle Swarm Optimization, IJCSNS International Journal of Computer 214 Science and Network Security, VOL. 8 No. 5.
  8. N. Punnagai and P. Visu, 12 & 13 April 2012, QoS Multicast routing for NP Completeness and PSO Optimization under Inaccurate Network Information, International Conference on Computing and Control Engineering (ICCCE 2012).
  9. Taoshen LI, Zhigang ZHAO, Zhihui GE, 2011, An Adaptive Swarm Optimization Algorithm for Anycast routing, Journal of Computational Information Systems 7:5 (2011) 1559-1566.
  10. Davoud Sedighizadeh and Ellips Masehian, 2009, Particle Swarm Optimization Methods,Taxonomy and application, International Journal of Computer Theory and Engineering Vol. , No. 5.
  11. Pandhapon Sombuntham and Voratas Kachitvichayanukul, 2010, A Particl Swarm Optimization Algorithms for Multi-depot Vehicle Routing problem with Pickup and Delivery Requests.
Index Terms

Computer Science
Information Sciences

Keywords

Particle swarm Optimization Swarm intelligence Unicast routing