Table of Contents Author Guidelines Submit a Manuscript
Discrete Dynamics in Nature and Society
Volume 2007, Article ID 27383, 25 pages
http://dx.doi.org/10.1155/2007/27383
Research Article

Efficient Computation of Shortest Paths in Networks Using Particle Swarm Optimization and Noising Metaheuristics

Faculty of Engineering and Technology, Multimedia University, Jalan Ayer Keroh Lama, Melaka 75450, Malaysia

Received 13 March 2007; Accepted 4 April 2007

Copyright © 2007 Ammar W. Mohemmed and Nirod Chandra Sahoo. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. F. B. Zahn and C. E. Noon, “Shortest path algorithms: an evaluation using real road networks,” Transportation Science, vol. 32, no. 1, pp. 65–73, 1998. View at Zentralblatt MATH
  2. J. Moy, “Open shortest path first Version 2. RFQ 1583,” Internet Engineering Task Force, 1994 http://www.ietf.org/.
  3. G. Desaulniers and F. Soumis, “An efficient algorithm to find a shortest path for a car-like robot,” IEEE Transactions on Robotics and Automation, vol. 11, no. 6, pp. 819–828, 1995. View at Publisher · View at Google Scholar
  4. N. Deo and C. Y. Pang, “Shortest-path algorithms: taxonomy and annotation,” Networks, vol. 14, no. 2, pp. 275–323, 1984. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. E. L. Lawler, “Combinatorial Optimization: Networks and Matroids,” Holt, Rinehart and Winston, New York, NY, USA, 1976. View at Zentralblatt MATH · View at MathSciNet
  6. M. R. Garey and D. S. Johnson, “Computers and Intractability. A Guide to the Theory of NP-Completeness,” W. H. Freeman, San Francisco, Calif, USA, 1979. View at Zentralblatt MATH · View at MathSciNet
  7. M. K. M. Ali and F. Kamoun, “Neural networks for shortest path computation and routing in computer networks,” IEEE Transactions on Neural Networks, vol. 4, no. 6, pp. 941–954, 1993. View at Publisher · View at Google Scholar · View at PubMed
  8. J. Wang, “A recurrent neural network for solving the shortest path problem,” in Proceedings of IEEE International Symposium on Circuits and Systems (ISCAS '94), vol. 6, pp. 319–322, London, UK, May-June 1994. View at Publisher · View at Google Scholar
  9. F. Araujo, B. Ribeiro, and L. Rodrigues, “A neural network for shortest path computation,” IEEE Transactions on Neural Networks, vol. 12, no. 5, pp. 1067–1073, 2001. View at Publisher · View at Google Scholar · View at PubMed
  10. M. Munemoto, Y. Takai, and Y. Sato, “A migration scheme for the genetic adaptive routing algorithm,” in Proceedings of IEEE International Conference on Systems, Man, and Cybernetics, vol. 3, pp. 2774–2779, San Diego, Calif, USA, October 1998. View at Publisher · View at Google Scholar
  11. J. Inagaki, M. Haseyama, and H. Kitajima, “A genetic algorithm for determining multiple routes and its applications,” in Proceedings of IEEE International Symposium on Circuits and Systems (ISCAS '99), vol. 6, pp. 137–140, Orlando, Fla, USA, May-June 1999. View at Publisher · View at Google Scholar
  12. C. W. Ahn and R. S. Ramakrishna, “A genetic algorithm for shortest path routing problem and the sizing of populations,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 6, pp. 566–579, 2002. View at Publisher · View at Google Scholar
  13. M. Gen, R. Cheng, and D. Wang, “Genetic algorithms for solving shortest path problems,” in Proceedings of the IEEE International Conference on Evolutionary Computation, pp. 401–406, Indianapolis, Ind, USA, April 1997. View at Publisher · View at Google Scholar
  14. G. Raidl and B. A. Julstrom, “A weighted coding in a genetic algorithm for the degree-constrained minimum spanning tree problem,” in Proceedings of the ACM Symposium on Applied Computing (SAC '00), vol. 1, pp. 440–445, Como, Italy, March 2000. View at Publisher · View at Google Scholar
  15. Z. Fu, A. Kurnia, A. Lim, and B. Rodrigues, “Shortest path problem with cache dependent path lengths,” in Proceedings of the Congress on Evolutionary Computation (CEC '03), vol. 4, pp. 2756–2761, Canberra, Australia, December 2003. View at Publisher · View at Google Scholar
  16. J. Kuri, N. Puech, M. Gagnaire, and E. Dotaro, “Routing foreseeable light path demands using a tabu search meta-heuristic,” in Proceedings of IEEE Global Telecommunication Conference (GLOBECOM '02), vol. 3, pp. 2803–2807, Taipei, Taiwan, November 2002. View at Publisher · View at Google Scholar
  17. J. Kennedy and R. C. Eberhart, “Particle swarm optimization,” in Proceedings of IEEE International Conference on Neural Networks, vol. 4, pp. 1942–1948, Perth, Western Australia, November-December 1995. View at Publisher · View at Google Scholar
  18. R. Hassan, B. Cohanim, O. L. DeWeck, and G. Venter, “A comparison of particle swarm optimization and the genetic algorithm,” in Proceedings of the 1st AIAA Multidisciplinary Design Optimization Specialist Conference, Austin, Tex, USA, April 2005.
  19. E. Elbeltagi, T. Hegazy, and D. Grierson, “Comparison among five evolutionary-based optimization algorithms,” Advanced Engineering Informatics, vol. 19, no. 1, pp. 43–53, 2005. View at Publisher · View at Google Scholar
  20. C. R. Mouser and S. A. Dunn, “Comparing genetic algorithms and particle swarm optimization for an inverse problem exercise,” The Australian & New Zealand Industrial and Applied Mathematics Journal, vol. 46, part C, pp. C89–C101, 2005. View at Zentralblatt MATH · View at MathSciNet
  21. R. C. Eberhart and Y. Shi, “Comparison between genetic algorithms and particle swarm optimization,” in Proceedings of the 7th International Conference on Evolutionary Programming, pp. 611–616, Springer, San Diego, Calif, USA, March 1998.
  22. D. W. Boeringer and D. H. Werner, “Particle swarm optimization versus genetic algorithms for phased array synthesis,” IEEE Transactions on Antennas and Propagation, vol. 52, no. 3, pp. 771–779, 2004. View at Publisher · View at Google Scholar
  23. A. Salman, I. Ahmad, and S. Al-Madani, “Particle swarm optimization for task assignment problem,” Microprocessors and Microsystems, vol. 26, no. 8, pp. 363–371, 2002. View at Publisher · View at Google Scholar
  24. K.-P. Wang, L. Huang, C.-G. Zhou, and W. Pang, “Particle swarm optimization for traveling salesman problem,” in Proceedings of the 2nd International Conference on Machine Learning and Cybernetics (ICMLC '03), vol. 3, pp. 1583–1585, Xi'an, China, November 2003. View at Publisher · View at Google Scholar
  25. M. Clerc, “Discrete particle swarm optimization illustrated by the traveling salesman problem,” 2000, http://www.mauriceclerc.net/.
  26. L. Cagnina, S. Esquivel, and R. Gallard, “Particle swarm optimization for sequencing problem: a case study,” in Proceedings of the IEEE Conference on Evolutionary Computation (CEC '04), vol. 1, pp. 536–541, Portland, Ore, USA, June 2004. View at Publisher · View at Google Scholar
  27. X. Hu, R. C. Eberhart, and Y. Shi, “Swarm intelligence for permutation optimization: a case study of n-queens problem,” in Proceedings of the IEEE Swarm Intelligence Symposium (SIS '03), pp. 243–246, Indianapolis, Ind, USA, April 2003. View at Publisher · View at Google Scholar
  28. I. Charon and O. Hudry, “The noising method: a new method for combinatorial optimization,” Operations Research Letters, vol. 14, no. 3, pp. 133–137, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  29. I. Charon and O. Hurdy, “The noising methods: a generalization of some metaheuristics,” European Journal of Operational Research, vol. 135, no. 1, pp. 86–101, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  30. X. Hu, Y. Shi, and R. C. Eberhart, “Recent advances in particle swarm,” in Proceedings of the Congress on Evolutionary Computation (CEC '04), vol. 1, pp. 90–97, Portland, Ore, USA, June 2004. View at Publisher · View at Google Scholar
  31. Y. Shi, “Particle swarm optimization,” Feature article, IEEE Neural Networks Society, February 2004.
  32. J. Kennedy and R. Mendes, “Population structure and particle swarm performance,” in Proceedings of the Congress on Evolutionary Computation (CEC '02), vol. 2, pp. 1671–1676, Honolulu, Hawaii, USA, May 2002. View at Publisher · View at Google Scholar
  33. J. Kennedy, “Small worlds and mega-minds: effects of neighborhood topology on particle swarm performance,” in Proceedings of the Congress on Evolutionary Computation (CEC '99), vol. 3, pp. 1931–1938, Washington, DC, USA, July 1999. View at Publisher · View at Google Scholar
  34. M. Clerc, “The swarm and queen: towards a deterministic and adaptive particle swarm optimization,” in Proceedings of the Congress on Evolutionary Computation (CEC '99), vol. 3, pp. 1951–1957, Washington, DC, USA, July 1999. View at Publisher · View at Google Scholar
  35. R. C. Eberhart and Y. Shi, “Comparing inertia weights and constriction factors in particle swarm optimization,” in Proceedings of the Congress on Evolutionary Computation (CEC '00), vol. 1, pp. 84–88, La Jolla, Calif, USA, July 2000. View at Publisher · View at Google Scholar
  36. P. J. Angeline, “Evolutionary optimization versus particle swarm optimization: philosophy and performance difference,” in Proceedings of the 7th International Conference on Evolutionary Programming, pp. 601–610, San Diego, Calif, USA, March 1998.
  37. P. Srinivas and R. Battiti, “The gregarious particle swarm optimizer (G-PSO),” in Proceedings of the 8th Annual Conference Genetic and Evolutionary Computation (GECCO '06), pp. 67–74, Seattle, Wash, USA, July 2006. View at Publisher · View at Google Scholar
  38. X.-F. Xie, W.-J. Zang, and Z.-L. Yang, “Dissipative particle swarm optimization,” in Proceedings of the Congress on Evolutionary Computation (CEC '02), vol. 2, pp. 1456–1461, Honolulu, Hawaii, USA, May 2002. View at Publisher · View at Google Scholar
  39. M. Iqbal, A. A. Freitas, and C. G. Johnson, “Varying the topology and probability of re-initialization in particle swarm optimization,” in Proceedings of the 7th International Conference on Artificial Evolution, Lille, France, October 2005.
  40. F. Rothlauf, D. E. Goldberg, and A. Heinzl, “Network random keys: a tree network representation scheme for genetic and evolutionary algorithms,” Evolutionary Computation, vol. 10, no. 1, pp. 75–97, 2002. View at Publisher · View at Google Scholar · View at PubMed
  41. V. Kelner, F. Capitanescu, O. Léonard, and L. Wehenkel, “A hybrid optimization technique coupling evolutionary and local search algorithms,” in Proceedings of the 3rd International Conference on Advanced Computational Methods in Engineering (ACOMEN '05), Ghent, Belgium, May-June 2005.
  42. T. A. Feo and M. G. C. Resende, “Greedy randomized adaptive search procedures,” Journal of Global Optimization, vol. 6, no. 2, pp. 109–133, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  43. K. Yasuda and T. Kanazawa, “Proximate optimality principle based Tabu search,” in Proceedings of IEEE International Conference on Systems, Man and Cybernetics, vol. 2, pp. 1560–1565, October 2003. View at Publisher · View at Google Scholar
  44. B. M. Waxman, “Routing of multipoint connections,” Journal of Selected Areas in Communications, vol. 6, no. 9, pp. 1617–1622, 1988. View at Publisher · View at Google Scholar
  45. Y. Shi and R. C. Eberhart, “Empirical study of particle swarm optimization,” in Proceedings of the Congress on Evolutionary Computation (CEC '99), vol. 3, pp. 1945–1950, Washington, DC, USA, July 1999. View at Publisher · View at Google Scholar
  46. A. Carlisle and G. Dozier, “An off-the-shelf PSO,” in Proceedings of the Workshop on Particle Swarm Optimization, pp. 1–6, Indianapolis, Ind, USA, April 2001.
  47. M. Clerc and J. Kennedy, “The particle swarm explosion, stability, and convergence in a multidimensional complex space,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 1, pp. 58–73, 2002. View at Publisher · View at Google Scholar