Hybrid co-evolutionary particle swarm optimization and noising metaheuristics for the delay constrained least cost path problem

• Ahn, C.W., Ramakrishna, R.S.: A genetic algorithm for shortest path routing problem and the sizing of populations. IEEE Trans. Evol. Comput. 6(6), 566–579 (2002)

  Article  Google Scholar 

• Barbosa, H.J.C.: A genetic algorithm for min-max problems. In: Proceedings of the First International Conference on Evolutionary Computation and its Applications, Moscow, pp. 99–109 (1996)

• Beasley, J.E., Christofides, N.: An algorithm for the resource constrained shortest path. Networks 19(3), 379–394 (1989)

  Article  MATH  MathSciNet  Google Scholar 

• Blokh, D., Gutin, G.: An approximation algorithm for combinatorial optimization problems with two parameters. Australas. J. Comb. 14, 157–164 (1995)

  MathSciNet  Google Scholar 

• Boeringer, D.W., Werner, D.H.: Particle swarm optimization versus genetic algorithms for phased array synthesis. IEEE Trans. Antennas Propag. 52(3), 771–779 (2004)

  Article  Google Scholar 

• Cagnina, L., Esquivel, S., Gallard, R.: Particle swarm optimization for sequencing problem: a case study. In: Proceedings of the IEEE Conference on Evolutionary Computation, pp. 536–541 (2004)

• Charon, I., Hurdy, O.: The noising method: a new method for combinatorial optimization. Oper. Res. Lett. 14(3), 133–137 (1993)

  Article  MATH  MathSciNet  Google Scholar 

• Charon, I., Hurdy, O.: The noising methods: a generalization of some metaheuristics. Eur. J. Oper. Res. 135, 86–101 (2001)

  Article  MATH  Google Scholar 

• Chen, S., Song, M., Sahni, S.: Two techniques for fast computation of constrained shortest paths. IEEE/ACM Trans. Netw. 18, 105–115 (2008)

  Article  Google Scholar 

• Clerc, M.: The swarm and queen: Towards a deterministic and adaptive particle swarm optimization. In: Proceedings of the IEEE Congress on Evolutionary Computation, pp. 1951–1957 (1999)

• Clerc, M.: Discrete particle swarm optimization illustrated by the traveling salesman problem. In: New Optimization Techniques in Engineering, pp. 219–239. Springer, Berlin (2004)

  Google Scholar 

• DeNeve, H., Mieghem, P.V.: A multiple quality of service routing algorithm for PNNI. In: Proceedings of the IEEE ATM Workshop, Virginia, USA, pp. 324–328 (1998)

• Dijkstra, E.: A note on two problems in connexion with graphs. Numer. Math. 1, 269–271 (1959)

  Article  MATH  MathSciNet  Google Scholar 

• Eberhart, R.C., Shi, Y.: Comparison between genetic algorithms and particle swarm optimization. In: Proceedings of the Seventh Annual Conference on Evolutionary Programming, pp. 611–616. Springer, Berlin (1998)

  Google Scholar 

• Elbeltagi, E., Hegazy, T., Grierson, D.: Comparison among five evolutionary-based optimization algorithms. Adv. Eng. Inf. 19(1), 43–53 (2005)

  Article  Google Scholar 

• Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, New York (1979)

  MATH  Google Scholar 

• Gen, M., Cheng, R., Wang, D.: Genetic algorithms for solving shortest path problems. In: Proceedings of the IEEE International Conference on Evolutionary Computation, pp. 401– 406 (1997)

• Handler, G., Zang, I.: A dual algorithm for the constrained shortest path problem. Networks 10, 293–310 (1980)

  Article  MathSciNet  Google Scholar 

• Hassan, R., Cohanim, B., DeWeck, O.L., Venter, G.: A comparison of particle swarm optimization and the genetic algorithm. In: Proceedings of the First AIAA Multidisciplinary Design Optimization Specialist Conference, pp. 18–21 (2005)

• Hillis, W.D.: Coevolving parasites improve simulated evolution as an optimization procedure. Physica D 42, 228–234 (1990)

  Article  Google Scholar 

• Hu, X., Eberhart, R.C.: Swarm intelligence for permutation optimization: a case study of n-queens problem. In: Proceedings of the IEEE Swarm Intelligence Symposium, pp. 243–246 (2003)

• Inagaki, J., Haseyama, M., Kitajima, H.: A genetic algorithm for determining multiple routes and its applications. In: Proceedings of the IEEE International Symposium on Circuits and Systems, pp. 137–140 (1999)

• Jeffrey, J.: Algorithms for finding path with multiple constraints. Networks 14, 95–116 (1984)

  Article  MATH  MathSciNet  Google Scholar 

• JongDe, K.A., Potter, M.A.: Evolving complex structures via cooperative co-evolution. In: Proceedings of the Fourth Annual Conference on Evolutionary Computation, San Diego, CA, pp. 1–3 (1995)

• Jüttner, A., Szviatovszki, B., Mécs, I., Rajkó, Z.: Lagrange relaxation based method for the QoS routing problem. In: Proceedings of IEEE INFOCOM, pp. 859–868 (2001)

• Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of the IEEE International Conference on Neural Networks, pp. 1942–1948 (1995)

• Kennedy, J.: Small worlds and mega-minds: Effects of neighborhood topology on particle swarm performance. In: Proceedings of the Congress of Evolutionary Computation, vol. 3, pp. 1931–1938 (1999)

• Krohling, R.A., Hoffmann, F., Coelho, L.S.: Co-evolutionary particle swarm optimization for min-max problems using Gaussian distribution. In: Proceedings of the Congress on Evolutionary Computation, vol. 1, pp. 959–964 (2004)

• Lee, W.C., Hluchyj, M.G., Humblet, P.A.: Routing subject to quality of service constraints in integrated communication networks. IEEE Netw. 9(4), 14–16 (1995)

  Article  Google Scholar 

• Liang, G., Matta, I.: Search space reduction in QoS routing. In: Proceedings of the 19th International Conference on Distributed Computing Systems, pp. 142–149 (1999)

• Michalewicz, Z.: Genetic algorithms numerical optimization and constraints. In: Proceedings of the Sixth International Conference on Genetic Algorithms, pp. 151–158 (1995)

• Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs. Springer, New York (1996)

  MATH  Google Scholar 

• Mohemmed, A.W., Sahoo, N.C.: Efficient computation of shortest paths in networks using particle swarm optimization and noising metaheuristics. Discrete Dyn. Nat. Soc. (2007a). doi:10.1155/2007/27383

  MATH  MathSciNet  Google Scholar 

• Mohemmed, A.W., Sahoo, N.C.: Particle swarm optimization combined with local search and velocity re-initialization for shortest path computation in network. In: Proceedings of the IEEE Swarm Intelligence Symposium, USA, pp. 266–272 (2007b)

• Mohemmed, A.W., Sahoo, N.C., Tan, K.G.: Solving shortest path problem using particle swarm optimization. Appl. Soft Comput. 8(4), 1643–1653 (2008)

  Article  Google Scholar 

• Mouser, C.R., Dunn, S.A.: Comparing genetic algorithms and particle swarm optimization for an inverse problem exercise. Aust. N.Z. Ind. Appl. Math. (ANZIAM) J. 46(E), C89–C101 (2005)

  MathSciNet  Google Scholar 

• Munemoto, M., Takai, Y., Sato, Y.: A migration scheme for the genetic adaptive routing algorithm. In: Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, pp. 2774–2779 (1998)

• Pornavalai, C., Chakraborty, G., Shiratori, N.: Routing with multiple QoS requirements for supporting multimedia applications. J. High Speed Netw. 9, 357–373 (1998)

  Google Scholar 

• Potter, M.A., JongDe, K.A.: A cooperative co-evolutionary approach to function optimization. In: Proceedings of the Third Parallel Problem Solving from Nature, Israel, pp. 249–257 (1994)

• Potter, M.A., JongDe, K.A.: Evolving neural networks with collaborative species. In: Proceedings of the Summer Computer Simulation Conference, Canada, pp. 340–345, July 1995

• Salman, A., Imtiaz, A., Al-Madani, S.: Particle swarm optimization for task assignment problem. Microprocess. Microsyst. 26(8), 363–371 (2002)

  Article  Google Scholar 

• Shi, Y., Krohling, R.A.: Co-evolutionary panicle swarm optimization to solving min-max problems. In: Proceedings of the IEEE Conference on Evolutionary Computation, Hawaii, pp. 1682–1687 (2002)

• Wang, K.-P., Huang, L., Zhou, C.-G., Pang, W.: Particle swarm optimization for traveling salesman problem. In: Proceedings of International Conference on Machine Learning and Cybernetics, pp. 1583–1585 (2003)

• Waxman, B.: Routing of multipoint connections. IEEE J. Sel. Areas Commun. 6(9), 1617–1622 (1988)

  Article  Google Scholar 

• Widyono, R.: The design and evaluation of routing algorithms for real time channels. Tenet Group, Dept. EECS, Univ. California, Berkeley, CA, Tech. Rep. TR-94-024 (1994)

• Zhanfeng, J., Varaiya, P.: Heuristic methods for delay constrained least cost routing using K-shortest-paths. IEEE Trans. Automat. Control 51(4), 707–712 (2006)

  Article  MathSciNet  Google Scholar 

Download references