skip to main content
10.1145/2093698.2093820acmotherconferencesArticle/Chapter ViewAbstractPublication PagesisabelConference Proceedingsconference-collections
research-article

Using a hybrid honey bees mating optimisation algorithm for solving SONET/SDH design problems

Published: 26 October 2011 Publication History

Abstract

In this paper we propose a hybrid Honey Bees Mating Optimisation (HBMO) algorithm to solve two problems that arise in the design of optical telecommunication networks known as SONET/SDH Ring Assignment Problem (SRAP) and Intraring Synchronous Optical Network Design Problem (IDP). In SRAP the objective is to minimise the number of rings. In IDP the objective is to minimise the number of Add-Drop Multiplexers (ADMs). Both problems are subject to a ring capacity constraint. HBMO algorithm simulates the mating process of real honey bees. We apply a hybridisation of HBMO to solve these two combinatorial optimisation problems. The feasibility of Hybrid HBMO is demonstrated and compared with the solutions obtained by other algorithms from literature.

References

[1]
Abbass, H. A. 2001. Marriage in honey-bee optimization (MBO): a haplometrosis polygynous swarming approach. In IEEE Congress on Evolutionary Computation (Seoul, Korea, May 27--30, 2001). IEEE Press. 207--214.
[2]
Abbass, H. A. 2001. A monogenous MBO approach to satisfiabiality. In Proceedings of the Int. Conference on Computational Intelligence for Modelling, Control and Automation (Las Vegas, NV, USA, July 9--11, 2001).
[3]
Aringhieri, R. and Dell'Amico, M. 2005. Comparing Metaheuristic Algorithms for Sonet Network Design Problems. Journal of Heuristics. 11, 1 (Jan. 2005), 35--57.
[4]
Bastos, L. O., Ochi, L. S. and Macambira, E. M. 2005. A relative neighbourhood GRASP for the SONET ring assignment problem. In Proceedings of the International Network Optimization Conference (Lisboa, Portugal, March, 2005) 833--838.
[5]
Bastos, L. O., Ochi, L. S. and Macambira, E. M. 2005. GRASP with Path-Relinking for the SONET Ring Assignment Problem. In Proceedings of the Fifth International Conference on Hybrid Intelligent Systems -HIS'05 (Rio de Janeiro, Brazil, November 6--9, 2005). IEEE Computer Society. 239--244.
[6]
Bastos, L. O. 2005. Heuristic Solutions for the SONET Ring Assignment Problem. Master Thesis. UFF, Niterói/RJ.
[7]
Bastos, L. O., Ochi, L. S. 2008. A genetic algorithm with evolutionary path-relinking for the Sonet Ring Assignment Problem. In Proceedings of the International Conference on Engineering Optimization - EngOpt2008 (Rio de Janeiro, Brazil, June 1--5, 2008).
[8]
Bernardino, E. M., Bernardino, A. M., Sánchez-Pérez, J. M., Vega-Rodríguez, M. A. and Gómez-Pulido, J. A. 2010. Hybrid HBMO Algorithm to assign terminals to concentrators. In Proceedings of the 3rd International Symposium on Applied Sciences on Biomedical and Communication Technologie - ISABEL 2010 (Rome, Italy, November 7--10, 2010). IEEE Press.
[9]
Bernardino, A. M., Bernardino, E. M., Sánchez-Pérez, J. M., Vega-Rodríguez, M. A. and Gómez-Pulido, J. A. 2011. Solving SONET problems using a Hybrid Scatter Search Algorithm. In Studies in Computational Intelligence. Springer, Berlin/Heidelberg.
[10]
Goldschmidt, O., Laugier, A. and Olinick, E. V. 2003. SONET/SDH Ring Assignment with Capacity Constraints. Discrete Applied Mathematics. 129, 1 (June. 2003), 99--128.
[11]
Goldschmidt, O., Hochbaum, D. S., Levin, A. and Olinick, E. V. 20003. The Sonet Edge-Partition Problem. Networks. 41, 1 (Dec. 2003), 3--23.
[12]
Lee, Y., Sherali, H. D., Han, J. and Kim, S. 2000. A Branch-and-Cut Algorithm for Solving an Intraring Synchronous Optical Network Design Problem. Networks. 35, 3 (Apr. 2000), 223--232.
[13]
Macambira, E. M., Maculan, N. and Souza, C. C. 2006. A column generation approach for SONET ring assignment. Networks. 47, 3 (Feb. 2006), 157--171.
[14]
Oliveira, W. 2010. Parallel Evolutionary Algorithm to the SONET/SDH Ring Assignment Problem. Master Thesis. UFRN, Natal/RN.
[15]
Pelleau, M., Van Hentenryck, P. and Truchet, C. 2009. Sonet Network Design Problems. In Proceedings of the Sixth International Workshop on Local Search Techniques in Constraint Satisfaction (Lisbon, Portugal, September 20, 2009). EPTCS 5, 81--95.
[16]
Silva, A. C. G., Marinho, E. S., Oliveira, W. and Aloise, D. J. 2009. Genetic Algorithm and Memetic Algorithm with Vocabulary Building for the SONET Ring Assignment Problem. In Proceedings of the EU/MEeting 2009 - European Chapter on Metaheuristics (Porto, Portugal, April 29--30, 2009). 69--74.

Cited By

View all
  • (2016)Split procedure for graph partitioning: an application to the SONET ring problemIFAC-PapersOnLine10.1016/j.ifacol.2016.07.86649:12(763-768)Online publication date: 2016

Index Terms

  1. Using a hybrid honey bees mating optimisation algorithm for solving SONET/SDH design problems

        Recommendations

        Comments

        Information & Contributors

        Information

        Published In

        cover image ACM Other conferences
        ISABEL '11: Proceedings of the 4th International Symposium on Applied Sciences in Biomedical and Communication Technologies
        October 2011
        949 pages
        ISBN:9781450309134
        DOI:10.1145/2093698
        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Sponsors

        • Universitat Pompeu Fabra
        • IEEE
        • Technical University of Catalonia Spain: Technical University of Catalonia (UPC), Spain
        • River Publishers: River Publishers
        • CTTC: Technological Center for Telecommunications of Catalonia
        • CTIF: Kyranova Ltd, Center for TeleInFrastruktur

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        Published: 26 October 2011

        Permissions

        Request permissions for this article.

        Check for updates

        Author Tags

        1. SONET design problems
        2. bio-inspired algorithms
        3. communication networks
        4. honey bees mating optimisation algorithm

        Qualifiers

        • Research-article

        Conference

        ISABEL '11
        Sponsor:
        • Technical University of Catalonia Spain
        • River Publishers
        • CTTC
        • CTIF

        Contributors

        Other Metrics

        Bibliometrics & Citations

        Bibliometrics

        Article Metrics

        • Downloads (Last 12 months)0
        • Downloads (Last 6 weeks)0
        Reflects downloads up to 10 Feb 2025

        Other Metrics

        Citations

        Cited By

        View all
        • (2016)Split procedure for graph partitioning: an application to the SONET ring problemIFAC-PapersOnLine10.1016/j.ifacol.2016.07.86649:12(763-768)Online publication date: 2016

        View Options

        Login options

        View options

        PDF

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        Figures

        Tables

        Media

        Share

        Share

        Share this Publication link

        Share on social media