Soft Computing

, Volume 17, Issue 2, pp 199–211 | Cite as

A multiobjective approach based on artificial bee colony for the static routing and wavelength assignment problem

  • Álvaro Rubio-LargoEmail author
  • Miguel A. Vega-Rodríguez
  • Juan A. Gómez-Pulido
  • Juan M. Sánchez-Pérez


Nowadays, the most promising technology for designing optical networks is the wavelength division multiplexing. This technique divides the huge bandwidth of an optical fiber link into different wavelengths, providing different available channels per link. However, a problem comes up when it is necessary to interconnect a set of traffic demands. This problem is known as routing and wavelength assignment problem, and due to its complexity (NP-hard problem) it is very suitable for being solved using evolutionary computation. The selected heuristics is the artificial bee colony algorithm, an heuristics based on the behavior of honeybee foraging for nectar. Therefore, we have applied multiobjective optimization to solve the static routing and wavelength assignment problem, and adapted this algorithm to the multiobjective context. New results have been obtained that significantly improve those published in previous researches.


Artificial bee colony Routing and wavelength assignment WDM networks Multiobjective optimization 


  1. Ali M, Ramamurthy B, Deogun J (1999) Routing algorithms for all-optical networks with power considerations: the Unicast case. In: Eighth international conference on computer communications and networks, pp 237–241Google Scholar
  2. Arteta A, Barán B, Pinto D (2007) Routing and wavelength assignment over WDM optical networks: a comparison between MOACOs and classical approaches. In: LANC’07: proceedings of the 4th international IFIP/ACM Latin American conference on networking. ACM, New York, USA, pp 53–63Google Scholar
  3. Auger A, Bader J, Brockhoff D, Zitzler E (2009) Theory of the hypervolume indicator: optimal n-distributions and the choice of the reference point. In: Proceedings of the tenth ACM SIGEVO workshop on foundations of genetic algorithms. ACM, New York, USA, pp 87–102Google Scholar
  4. Banerjee N. Metha V, Pandey S (2004) A genetic algorithm approach for solving the routing and wavelength assignment problem in WDM network. In: 3rd IEEE/IEE international conference on networking, pp 70–78Google Scholar
  5. Barry R, Subramaniam S (1997) The MAX SUM wavelength assignment algorithm for WDM ring networks. Opt Fiber Commun OFC 97:121–122Google Scholar
  6. Birman A, Kershenbaum A (1995) Routing and wavelength assignment methods in single-hop all-optical networks with blocking. In: IEEE Infocom’95, pp 431–438Google Scholar
  7. Chan K, Yum TP (1994) Analysis of least congested path routing in WDM lightwave networks. In: INFOCOM’94. Networking for global communications., 13th Proceedings IEEE, vol 2, pp 962–969Google Scholar
  8. Chlamtac I, Ganz A, Karmi G (1989) Purely optical networks for terabit communication. INFOCOM’89. In: Proceedings of the eighth annual joint conference of the IEEE computer and communications societies. Technology: emerging or converging, vol 3, pp 887–896Google Scholar
  9. Coello CA, Dhaenens C, Jourdan L (eds) (2010) Advances in multi-objective nature inspired computing, studies in computational intelligence, vol 272. Springer, BerlinGoogle Scholar
  10. Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6:182–197CrossRefGoogle Scholar
  11. Grosso A, Leonardi E, Mellia M, Nucci A (2001) Logical topology design over WDM wavelength routed networks robust to traffic uncertanities. IEEE Commun Lett 5(4):172–174CrossRefGoogle Scholar
  12. Hamad AM, Kamal AE (2002) A survey of multicasting protocols for broadcast-and-select single-hop networks. IEEE Netw 16:36–48CrossRefGoogle Scholar
  13. Inkret R, Mikac B, Podnar I (1998) A heuristic approach to wavelength assignment in all-optical network. In: Proceedings of MELECON’98, vol 2, pp 759–763Google Scholar
  14. Insfrán C, Pinto D, Barán B (2006) Diseño de Topologfas Virtuales en Redes Ópticas. Un enfoque basado en Colonia de Hormigas. XXXII Latin-American Conference on Informatics 2006—CLEI2006, vol 8, pp 173–195Google Scholar
  15. Jeong G, Ayanoglu E (1996) Comparison of wavelength-interchanging and wavelength-selective cross-connects in multiWavelength all-optical networks. INFOCOM’96. In: Fifteenth annual joint conference of the IEEE computer societies, vol 1, pp 156–163Google Scholar
  16. Karaboga D, Akay B (2009) A survey: algorithms simulating bee swarm intelligence. Artif Intell Rev 31:61–85CrossRefGoogle Scholar
  17. Karasan E, Ayanoglu E (1998) Effects of wavelength routing and selection algorithms on wavelength conversion gain in WDM optical networks. IEEE/ACM Trans Netw 6:186–196CrossRefGoogle Scholar
  18. Leung D, Grover WD (2005) Capacity planning of survivable mesh-based transport networks under demand uncertainty. Photonic Netw Commun 10:123–140CrossRefGoogle Scholar
  19. Li L, Somani AK (1999) Dynamic wavelength routing using congestion and neighborhood information. IEEE/ACM Trans Netw 7(5):779–786CrossRefGoogle Scholar
  20. Masayuki HH, Murata M, Miyahara H (1997) Performance of alternate routing methods in all-optical switching networks. In: Proceedings of INFOCOM’97, pp 9–17Google Scholar
  21. Morley GD, Grover WD (2001) Tabu search optimization of optical ring transport networks. In: Proceedings IEEE GLOBECOM 2001, pp 2160–2164Google Scholar
  22. Mukherjee B, Banerjee D, Ramamurthy S, Mukherjee A (1996) Some principles for designing a wide-area WDM optical network. IEEE/ACM Trans Netw 4(5):684–696CrossRefGoogle Scholar
  23. Sonmez M (2011) Artificial bee colony algorithm for optimization of truss structures. Appl Soft Comput 11(2):2406–2418CrossRefGoogle Scholar
  24. Ramamurthy R, Mukherjee B (2002) Fixed-alternate routing and wavelength conversion in wavelength-routed optical networks. IEEE/ACM Trans Netw 10(3):351–367CrossRefGoogle Scholar
  25. Ramaswami R, Sivarajan KN (1995) Routing and wavelength assignment in all-optical networks. IEEE/ACM Trans Netw 3:489–500CrossRefGoogle Scholar
  26. Rodriguez-Dagnino R, Lopez-Caudana E, Martinez-Alfaro H, Gonzalez-Velarde J (1999) Simulated annealing and stochastic ruler algorithms for wavelength assignment planning in WDM optical networks. In: IEEE SMC’99, vol 6, pp 1015–1020Google Scholar
  27. Rubio-Largo A, Vega-Rodríguez MA, Gómez-Pulido JA, Sánchez-PTrez JM (2010a) A differential evolution with Pareto Tournaments for solving the routing and wavelength assignment problem in WDM networks. In: Proceedings of the 2010 IEEE congress on evolutionary computation (CEC 2010), vol 10, pp 129–136Google Scholar
  28. Rubio-Largo A, Vega-Rodríguez MA, Gómez-Pulido JA, Sánchez-PTrez JM (2010b) Solving the routing and wavelength assignment problem in WDM networks by using a multiobjective variable neighborhood search algorithm. In: Soft computing models in industrial and environmental applications, 5th international workshop (SOCO 2010), vol 73, pp 47–54Google Scholar
  29. Rubio-Largo A, Vega-Rodríguez MA, Gómez-Pulido JA, Sánchez-PTrez JM (2011) Tackling the static RWA problem by using a multiobjective artificial bee colony algorithm. In: Proceedings of the 11th international work conference on artificial neural networks, volume Part II, (IWANN’11), pp 364–371Google Scholar
  30. Saha M, Sengupta I (2005) A genetic algorithm based approach for static virtual topology design in optical networks. In: IEEE indicom 2005 conference, pp 392–395Google Scholar
  31. Schaerer M, Barán B (2003) A multiobjective ant colony system for vehicle routing problem with time windows. In: IASTED international conference on applied informatics, pp 97–102Google Scholar
  32. Shiann-Tsong S, Yue-Ru C, Yu-Jie C, Hsuen-Wen T (2001) A novel optical IP router architecture for WDM networks. In: ICOIN’01: proceedings of the 15th international conference on information networking, p 335Google Scholar
  33. Subramaniam S, Barry R (1997) Wavelength assignment in fixed routing WDM networks. IEEE Int Confer Commun 1:406–410Google Scholar
  34. Thompson D, Bilbro G (2000) Comparison of a genetic algorithm and simulated annealing algorithm for the design of an ATM network. IEEE Commun Lett 4(8):267–269CrossRefGoogle Scholar
  35. Varela GN, Sinclair MC (1999) Ant colony optimisation for virtual-wavelength-path routing and wavelength allocation. In: Proceedings of the congress on evolutionary computation (CEC’99), pp 1809–1816Google Scholar
  36. Weicker N, Szabo G, Weicker K, Widmayer P (2003) Evolutionary multiobjective optimization for base station transmitter placement with frequency assignment. IEEE Trans Evol Comput 7(2):189–203CrossRefGoogle Scholar
  37. Yan S, Ali M, Deogun J (2001) Route optimization of multicast sessions in sparse light-splitting optical networks. In: Proceedings of IEEE GLOBECOM 2001, pp 2134–2138Google Scholar
  38. Yeh WC, Hsieh TJ (2011) Solving reliability redundancy allocation problems using an artificial bee colony algorithm. Comput Oper Res 38(11):1465–1473MathSciNetCrossRefGoogle Scholar
  39. Zang H, Jue JP, Mukherjee B (2000) A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks. Opt NetwMag 1:47–60Google Scholar
  40. Zhang X, Qiao C (1998) Wavelength assignment for dynamic traffic in multi-fiber WDM networks. In: ICCCN’98, pp 479–585Google Scholar
  41. Zitzler E, Thiele L, Laumanns M, Fonseca C, da Fonseca V (2003) Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans Evol Comput 7(2):117–132CrossRefGoogle Scholar
  42. Zong L, Ramamurthy B (2001) Optimisation of amplifier placement in switch-based optical Network. In: Proceedings of IEEE ICC’01, vol 1, pp 224–228Google Scholar

Copyright information

© Springer-Verlag 2012

Authors and Affiliations

  • Álvaro Rubio-Largo
    • 1
    Email author
  • Miguel A. Vega-Rodríguez
    • 1
  • Juan A. Gómez-Pulido
    • 1
  • Juan M. Sánchez-Pérez
    • 1
  1. 1.Department of TC2, Polytechnic SchoolUniversity of ExtremaduraCáceresSpain

Personalised recommendations