Solving SONET Problems Using a Hybrid Scatter Search Algorithm

  • Anabela Moreira BernardinoEmail author
  • Eugénia Moreira Bernardino
  • Juan Manuel Sánchez-Pérez
  • Juan Antonio Gómez-Pulido
  • Miguel Angel Vega-Rodríguez
Part of the Studies in Computational Intelligence book series (SCI, volume 399)


Nowadays the Synchronous Optical NETworking (SONET) standard is widely used in telecommunications. In this paper we consider three problems that arise in SONET networks: (1) Weighted Ring Edge-Loading Problem (WRELP), (2) SONET Ring Assignment Problem (SRAP) and, (3) Intraring Synchronous Optical Network Design Problem (IDP), known to be NP-hard. WRELP asks for a routing scheme such that the maximum load on the edges of a ring will be minimum. In SRAP the objective is to minimise the number of rings (i.e., DXCs). In IDP the objective is to minimise the number of ADMs. The last two problems are subject to a ring capacity constraint. We study these three problems without demand splitting and for solving them we propose a Hybrid Scatter Search (HSS) algorithm. Coupled with the Scatter Search algorithm, we use a Tabu Search algorithm to locate the global minimum. We show that HSS is able to achieve feasible solutions, improving the results obtained by previous approaches.


Communication networks Weighted ring edge-loading problem SONET design problems Scatter search algorithm Bio-inspired algorithms 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Goralski, W.J.: SONET. McGraw-Hill Professional (2002)Google Scholar
  2. 2.
    Cosares, S., Saniee, I.: An optimistion problem related to balancing loads on SONET rings. Telecommunication Systems 3(2), 165–181 (1994)CrossRefGoogle Scholar
  3. 3.
    Dell’Amico, M., Labbé, M., Maffioli, F.: Exact solution of the SONET Ring Loading Problem. Oper. Res. Lett. 25(3), 119–129 (1999)zbMATHCrossRefGoogle Scholar
  4. 4.
    Schrijver, A., Seymour, P., Winkler, P.: The ring loading problem. SIAM Journal of Discrete Mathematics 11, 1–14 (1998)MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    Goldschmidt, O., Laugier, A., Olinick, E.V.: SONET/SDH Ring Assignment with Capacity Constraints Discrete. Appl. Math. 129, 99–128 (2003)MathSciNetzbMATHGoogle Scholar
  6. 6.
    Aringhieri, R., Dell’Amico, M.: Comparing Metaheuristic Algorithms for Sonet Network Design Problems. Journal of Heuristics 11, 35–57 (2005)zbMATHCrossRefGoogle Scholar
  7. 7.
    Pelleau, M., Van Hentenryck, P., Truchet, C.: Sonet Network Design Problems. In: EPTCS 5, LSCS 2009, pp. 81–95 (2009)Google Scholar
  8. 8.
    Lee, Y., Sherali, H.D., Han, J., Kim, S.: A Branch-and-Cut Algorithm for Solving an Intraring Synchronous Optical Network Design Problem. Networks 35, 223–232 (2000)MathSciNetzbMATHCrossRefGoogle Scholar
  9. 9.
    Goldschmidt, O., Hochbaum, D.S., Levin, A., Olinick, E.V.: The Sonet Edge-Partition Problem. Networks 41, 3–23 (2003)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Glover, F.: Heuristics for integer programming using surrogate constraints. Decision Sciences 8, 156–166 (1977)CrossRefGoogle Scholar
  11. 11.
    Laguna, M.: Scatter search. In: Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Applied Optimistion, pp. 183–193. Oxford University Press (2002)Google Scholar
  12. 12.
    Myung, Y.S., Kim, H.G.: On the ring loading problem with demand splitting. Operations Research Letters 32(2), 167–173 (2004)MathSciNetzbMATHCrossRefGoogle Scholar
  13. 13.
    Wang, B.F.: Linear time algorithms for the ring loading problem with demand splitting. Journal of Algorithms 54(1), 45–57 (2005)MathSciNetzbMATHCrossRefGoogle Scholar
  14. 14.
    Kim, S.-S., Kim, I.-H., Mani, V., Kim, H.J.: Ant Colony Optimistion for SONET Ring Loading Problem. International Journal of Innovative Computing, Information and Control 4(7), 1617–1626 (2008)Google Scholar
  15. 15.
    Bernardino, A.M., Bernardino, E.M., Sánchez-Pérez, J.M., Vega-Rodríguez, M.A., Gómez-Pulido, J.A.: Solving ring loading problems using Bio-inspired algorithms. Journal of Network and Computer Applications 34(2), 668–685 (2011)CrossRefGoogle Scholar
  16. 16.
    Bernardino, A.M., Bernardino, E.M., Sánchez-Pérez, J.M., Vega-Rodríguez, M.A., Gómez-Pulido, J.A.: Solving the ring arc-loading problem using a Hybrid Scatter Search Algorithm. In: International Conference on Evolutionary Computation (2010)Google Scholar
  17. 17.
    Aringhieri, R., Dell’Amico, M., Grasselli, L.: Solution of the sonet ring assignment problem with capacity constraints. Technical Report 12, DISMI. University of Modena and Reggio Emilia (2001)Google Scholar
  18. 18.
    Macambira, E.M., Meneses, C.N., Pardalos, P.M., Resende, M.G.C.: A novel integer programming formulation for the K-SONET ring assignment problem. AT&T Labs Research Technical Report TD-6HLLNR (2005)Google Scholar
  19. 19.
    Macambira, E.M., Maculan, N., Souza, C.C.: A column generation approach for SONET ring assignment. Networks 47(3), 157–171 (2006)MathSciNetzbMATHCrossRefGoogle Scholar
  20. 20.
    Bastos, L.O., Ochi, L.S., Macambira, E.M.: A relative neighbourhood GRASP for the SONET ring assignment problem. In: Proceedings of the International Network Optimization Conference, pp. 833–838 (2005)Google Scholar
  21. 21.
    Bastos, L.O., Ochi, L.S., Macambira, E.M.: GRASP with Path-Relinking for the SONET Ring Assignment Problem. In: Proc. Fifth International Conference on Hybrid Intelligent Systems (HIS 2005), pp. 239–244 (2005)Google Scholar
  22. 22.
    Bastos, L.O., Ochi, L.S.: A genetic algorithm with evolutionary path-relinking for the Sonet Ring Assignment Problem. In: International Conference on Engineering Optimization - EngOpt 2008, RJ. Proc. of the EngOpt 2008 - Sponsoring Societies: Mathematical Programming Society (MPS), ISSMO, EUROPT, ABCM. RJ : EngOpt, v. 1 (2008)Google Scholar
  23. 23.
    Laguna, M.: Clustering for the design of sonet rings in interoffice telecomunications. Management Sciennce 40(11), 1533–1541 (1994)zbMATHCrossRefGoogle Scholar
  24. 24.
    Glover, F., Laguna, M., Marti, R.: Scatter Search and Path Relinking: Advances and Applications. In: Handbook of Metaheuristics, vol. 57, pp. 1–35. Springer, Heidelberg (2003)Google Scholar
  25. 25.
    Bernardino, A.M., Bernardino, E.M., Sánchez-Pérez, J.M., Vega-Rodríguez, M.A., Gómez-Pulido, J.A.: A Hybrid Scatter Search Algorithm to Assign Terminals to Concentrators. In: IEEE Congress on Evolutionary Computation (CEC 2010), pp. 329–336. IEEE Computer Society, IEEE press, Los Alamitos (2010)Google Scholar
  26. 26.
    Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers (1997)Google Scholar

Copyright information

© Springer-Verlag GmbH Berlin Heidelberg 2012

Authors and Affiliations

  • Anabela Moreira Bernardino
    • 1
    Email author
  • Eugénia Moreira Bernardino
    • 1
  • Juan Manuel Sánchez-Pérez
    • 2
  • Juan Antonio Gómez-Pulido
    • 2
  • Miguel Angel Vega-Rodríguez
    • 2
  1. 1.Computer Science and Communication Research Centre School of Technology and ManagementPolytechnic Institute of LeiriaLeiriaPortugal
  2. 2.Department of Technologies of Computers and CommunicationsPolytechnic School University of ExtremaduraCáceresSpain

Personalised recommendations