Solving large-scale SONET network design problems using bee-inspired algorithms
In the past years, the number of users of Internet-based applications has exponentially increased and consequently the request for transmission capacity or bandwidth has significantly augmented. When managed properly, the ring networks are uniquely suited to deliver a large amount of bandwidth in a...
Saved in:
| Published in | Optical switching and networking Vol. 9; no. 2; pp. 97 - 117 |
|---|---|
| Main Authors | , , , , |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier B.V
01.04.2012
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 1573-4277 1872-9770 |
| DOI | 10.1016/j.osn.2011.11.001 |
Cover
| Abstract | In the past years, the number of users of Internet-based applications has exponentially increased and consequently the request for transmission capacity or bandwidth has significantly augmented. When managed properly, the ring networks are uniquely suited to deliver a large amount of bandwidth in a reliable and inexpensive way. In this paper, we consider two problems that arise in the design of optical telecommunication networks, namely the SONET Ring Assignment Problem (SRAP) and the Intraring Synchronous Optical Network Design Problem (IDP), known to be NP-hard. 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. Both problems are subject to a ring capacity constraint. To solve these problems, we propose two bee-inspired algorithms: Hybrid Artificial Bee Colony and Hybrid Bees Algorithm. We hybridise the basic form of these algorithms with local search, in order to refine newly constructed solutions. We also perform comparisons with other algorithms from the literature and use larger instances. The simulation results verify the effectiveness and robustness of the proposed algorithms. |
|---|---|
| AbstractList | In the past years, the number of users of Internet-based applications has exponentially increased and consequently the request for transmission capacity or bandwidth has significantly augmented. When managed properly, the ring networks are uniquely suited to deliver a large amount of bandwidth in a reliable and inexpensive way. In this paper, we consider two problems that arise in the design of optical telecommunication networks, namely the SONET Ring Assignment Problem (SRAP) and the Intraring Synchronous Optical Network Design Problem (IDP), known to be NP-hard. 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. Both problems are subject to a ring capacity constraint. To solve these problems, we propose two bee-inspired algorithms: Hybrid Artificial Bee Colony and Hybrid Bees Algorithm. We hybridise the basic form of these algorithms with local search, in order to refine newly constructed solutions. We also perform comparisons with other algorithms from the literature and use larger instances. The simulation results verify the effectiveness and robustness of the proposed algorithms. |
| Author | Vega-Rodríguez, Miguel Angel Bernardino, Eugénia Moreira Sánchez-Pérez, Juan Manuel Gómez-Pulido, Juan Antonio Bernardino, Anabela Moreira |
| Author_xml | – sequence: 1 givenname: Eugénia Moreira surname: Bernardino fullname: Bernardino, Eugénia Moreira email: eugenia.bernardino@ipleiria.pt organization: Department of Computer Science–Computer Science and Communication Research Centre, School of Technology and Management, Polytechnic Institute of Leiria, 2400 Leiria, Portugal – sequence: 2 givenname: Anabela Moreira surname: Bernardino fullname: Bernardino, Anabela Moreira email: anabela.bernardino@ipleiria.pt organization: Department of Computer Science–Computer Science and Communication Research Centre, School of Technology and Management, Polytechnic Institute of Leiria, 2400 Leiria, Portugal – sequence: 3 givenname: Juan Manuel surname: Sánchez-Pérez fullname: Sánchez-Pérez, Juan Manuel email: sanperez@unex.es organization: Department of Technologies of Computers and Communications, Polytechnic School, University of Extremadura, 10071 Cáceres, Spain – sequence: 4 givenname: Juan Antonio surname: Gómez-Pulido fullname: Gómez-Pulido, Juan Antonio email: jangomez@unex.es organization: Department of Technologies of Computers and Communications, Polytechnic School, University of Extremadura, 10071 Cáceres, Spain – sequence: 5 givenname: Miguel Angel surname: Vega-Rodríguez fullname: Vega-Rodríguez, Miguel Angel email: mavega@unex.es organization: Department of Technologies of Computers and Communications, Polytechnic School, University of Extremadura, 10071 Cáceres, Spain |
| BookMark | eNp9kMtKAzEUhoNUsK0-gLt5gRmTuSQTXEmpFxC7aF2HJHMypk6TkowV396UunJR-OGcxfkO_N8MTZx3gNAtwQXBhN5tCx9dUWJCihSMyQWakpaVOWcMT9LesCqvS8au0CzGLcZ1Xbd0ilZrPxys67NBhh7yqOUA2Xr1ttxkDsZvHz6zDqLtXbYPXg2wi9lXPN4rgNy6uLcBukwOvQ92_NjFa3Rp5BDh5m_O0fvjcrN4zl9XTy-Lh9dcl5yNedVwCgZDqyTpas6gNAobTqnipm6oabHiijaAMSNtW3e8MRVnihNeGampqeaInf7q4GMMYIS2oxytd2OQdhAEi6MXsRXJizh6ESnJSyLJP3If7E6Gn7PM_YmBVOlgIYioLTgNXaqvR9F5e4b-BXvDfjo |
| CitedBy_id | crossref_primary_10_1016_j_jnca_2012_04_005 crossref_primary_10_1080_18756891_2012_718157 crossref_primary_10_1016_j_ins_2014_08_040 |
| Cites_doi | 10.1007/s10732-005-6998-7 10.1109/ICHIS.2005.52 10.1002/net.10054 10.1016/S0166-218X(02)00236-6 10.1287/mnsc.40.11.1533 10.4204/EPTCS.5.7 10.1016/j.amc.2009.03.090 10.1002/net.20102 10.1007/s10898-007-9149-x 10.1016/j.asoc.2007.05.007 10.1016/j.jnca.2010.11.003 10.1007/s10462-009-9127-4 10.1002/(SICI)1097-0037(200005)35:3<223::AID-NET6>3.0.CO;2-J |
| ContentType | Journal Article |
| Copyright | 2011 Elsevier B.V. |
| Copyright_xml | – notice: 2011 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.osn.2011.11.001 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1872-9770 |
| EndPage | 117 |
| ExternalDocumentID | 10_1016_j_osn_2011_11_001 S1573427711000828 |
| GroupedDBID | --K --M .~1 0R~ 123 1B1 1~. 1~5 4.4 457 4G. 5VS 7-5 71M 8P~ AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABBOA ABFNM ABJNI ABMAC ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADMUD ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD AXJTR BJAXD BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF HZ~ IHE J1W JJJVA KOM M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 RIG ROL RPZ SDF SDG SES SEW SPC SPCBC SST SSV SSZ T5K ~G- AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c297t-3596ef0e8ba1d497e2fb0f966b9f456f80b9b65e0071884d95f397b9193fac6f3 |
| IEDL.DBID | .~1 |
| ISSN | 1573-4277 |
| IngestDate | Thu Apr 24 23:14:48 EDT 2025 Wed Oct 01 06:42:15 EDT 2025 Fri Feb 23 02:33:55 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | SONET assignment problem Optical telecommunication networks Bee-inspired algorithms Intraring SONET design problem |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c297t-3596ef0e8ba1d497e2fb0f966b9f456f80b9b65e0071884d95f397b9193fac6f3 |
| PageCount | 21 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_osn_2011_11_001 crossref_primary_10_1016_j_osn_2011_11_001 elsevier_sciencedirect_doi_10_1016_j_osn_2011_11_001 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | April 2012 2012-4-00 |
| PublicationDateYYYYMMDD | 2012-04-01 |
| PublicationDate_xml | – month: 04 year: 2012 text: April 2012 |
| PublicationDecade | 2010 |
| PublicationTitle | Optical switching and networking |
| PublicationYear | 2012 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | A.C.G. Silva, E.S. Marinho, W. Oliveira, D.J. Aloise, 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, 2009. Karaboga, Basturk (br000175) 2008; 8 D.T. Pham, A.A. Afify, E. Koç, Manufacturing cell formation using the bees algorithm, in: Innovative Production Machines and Systems Virtual Conference, Cardiff, UK, 2007. R. Aringhieri, M. Dell’Amico, L. Grasselli, Solution of the sonet ring assignment problem with capacity constraints, Technical Report 12, DISMI, University of Modena and Reggio Emilia, 2001. Goldschmidt, Laugier, Olinick (br000010) 2003; 129 D. Karaboga, B. Basturk, Artificial bee colony (ABC), harmony search and bees algorithms on numerical optimization, in: Innovative Production Machines and Systems Virtual Conference, 2009. Goldschmidt, Hochbaum, Levin, Olinick (br000030) 2003; 41 Kennedy, Eberhart, Shi (br000040) 2001 Bernardino, Bernardino, Sánchez-Pérez, Vega-Rodríguez, Gómez-Pulido (br000130) 2011; 34 Karaboga, Akay (br000045) 2009; 31 Karaboga, Basturk (br000165) 2007; 39 Aringhieri, Dell’Amico (br000015) 2005; 11 L.O. Bastos, L.S. Ochi, E.M. Macambira, A relative neighbourhood GRASP for the SONET ring assignment problem, in: Proceedings of the International Network Optimization Conference, 2005, pp. 833–838. Bernardino, Bernardino, Sánchez-Pérez, Vega-Rodríguez, Gómez-Pulido (br000125) 2011 E.M. Macambira, C.N. Meneses, P.M. Pardalos, M.G.C. Resende, A novel integer programming formulation for the K-SONET ring assignment problem, AT&T Labs Research Technical Report TD-6HLLNR, 2005. Bees algorithm. Website Macambira, Maculan, Souza (br000065) 2006; 47 Bernardino, Bernardino, Sánchez-Pérez, Vega-Rodríguez, Gómez-Pulido (br000135) 2010 L.O. Bastos, L.S. Ochi, E.M. Macambira, GRASP with path-relinking for the SONET ring assignment problem, in: Proceedings of the Fifth International Conference on Hybrid Intelligent Systems, HIS’05, 2005, pp. 239–244. B. Basturk, D. Karaboga, An artificial bee colony (ABC) algorithm for numeric function optimization, in: IEEE Swarm Intelligence Symposium, 2006. D.T. Pham, A. Ghanbarzadeh, E. Koç, S. Otri, S. Rahim, M. Zaidi, The bees algorithm, Technical Note, Manufacturing Engineering Centre, Cardiff University, UK, 2005. Lee, Sherali, Han, Kim (br000025) 2000; 35 Laguna (br000110) 1994; 40 D. Karaboga, An idea based on honey bee swarm for numerical optimization, Technical Report TR06, Erciyes University, Engineering Faculty, Computer Engineering Department, 2005. L.O. Bastos, L.S. Ochi, A genetic algorithm with evolutionary path-relinking for the sonet ring assignment problem, in: Proceedings of the International Conference on Engineering Optimization—EngOpt2008, Sponsoring Societies: Mathematical Programming Society, MPS, ISSMO, EUROPT, ABCM, 2008. W. Oliveira, Parallel evolutionary algorithm to the SONET/SDH ring assignment problem, Master Thesis, UFRN, Natal/RN, 2010. Bernardino, Bernardino, Sánchez-Pérez, Vega-Rodríguez, Gómez-Pulido (br000120) 2010 Memetic algorithms. Website . Karaboga, Basturk (br000180) 2009; 214 L.O. Bastos, Heuristic solutions for the SONET ring assignment problem, Master Thesis, UFF, Niterói/RJ, 2005. W.K.S. Soares, Heuristics using vocabulary building to the SONET ring assignment problem, Master Thesis, UFRN, Natal/RN, 2008. M. Pelleau, P. Van Hentenryck, C. Truchet, Sonet network design problems, in: Y. Deville, C. Solnon (Eds.), Sixth International Workshop on Local Search Techniques in Constraint Satisfaction, LSCS’09, EPTCS 5, 2009, pp. 81–95. A.M. Bernardino, E.M. Bernardino, J.M. Sánchez-Pérez, M.A. Vega-Rodríguez, J.A. Gómez-Pulido, Solving SONET problems using a hybrid scatter search algorithm, in: Computational Intelligence, IJCCI 2010, Revised Selected Papers, Springer, Berlin, Heidelberg (in press). A.C.G. Silva, Genetic algorithm and memetic algorithm with vocabulary building for the SONET ring assignment problem, Master Thesis, UFRN, Natal/RN, 2008. Artificial bee colony algorithm. Website Karaboga, Basturk (br000170) 2007 Goralski (br000005) 2002 Eiben, Smith (br000035) 2003 Eiben (10.1016/j.osn.2011.11.001_br000035) 2003 Kennedy (10.1016/j.osn.2011.11.001_br000040) 2001 Macambira (10.1016/j.osn.2011.11.001_br000065) 2006; 47 10.1016/j.osn.2011.11.001_br000145 10.1016/j.osn.2011.11.001_br000100 Goralski (10.1016/j.osn.2011.11.001_br000005) 2002 10.1016/j.osn.2011.11.001_br000105 10.1016/j.osn.2011.11.001_br000050 10.1016/j.osn.2011.11.001_br000190 10.1016/j.osn.2011.11.001_br000070 Goldschmidt (10.1016/j.osn.2011.11.001_br000030) 2003; 41 10.1016/j.osn.2011.11.001_br000075 10.1016/j.osn.2011.11.001_br000095 10.1016/j.osn.2011.11.001_br000150 Karaboga (10.1016/j.osn.2011.11.001_br000165) 2007; 39 Lee (10.1016/j.osn.2011.11.001_br000025) 2000; 35 10.1016/j.osn.2011.11.001_br000090 Karaboga (10.1016/j.osn.2011.11.001_br000045) 2009; 31 Bernardino (10.1016/j.osn.2011.11.001_br000135) 2010 Goldschmidt (10.1016/j.osn.2011.11.001_br000010) 2003; 129 Laguna (10.1016/j.osn.2011.11.001_br000110) 1994; 40 Bernardino (10.1016/j.osn.2011.11.001_br000125) 2011 Bernardino (10.1016/j.osn.2011.11.001_br000120) 2010 Bernardino (10.1016/j.osn.2011.11.001_br000130) 2011; 34 Karaboga (10.1016/j.osn.2011.11.001_br000170) 2007 Karaboga (10.1016/j.osn.2011.11.001_br000175) 2008; 8 Aringhieri (10.1016/j.osn.2011.11.001_br000015) 2005; 11 10.1016/j.osn.2011.11.001_br000055 10.1016/j.osn.2011.11.001_br000155 10.1016/j.osn.2011.11.001_br000115 10.1016/j.osn.2011.11.001_br000060 10.1016/j.osn.2011.11.001_br000160 10.1016/j.osn.2011.11.001_br000080 10.1016/j.osn.2011.11.001_br000020 Karaboga (10.1016/j.osn.2011.11.001_br000180) 2009; 214 10.1016/j.osn.2011.11.001_br000185 10.1016/j.osn.2011.11.001_br000085 10.1016/j.osn.2011.11.001_br000140 |
| References_xml | – reference: A.M. Bernardino, E.M. Bernardino, J.M. Sánchez-Pérez, M.A. Vega-Rodríguez, J.A. Gómez-Pulido, Solving SONET problems using a hybrid scatter search algorithm, in: Computational Intelligence, IJCCI 2010, Revised Selected Papers, Springer, Berlin, Heidelberg (in press). – volume: 34 start-page: 668 year: 2011 end-page: 685 ident: br000130 article-title: Solving ring loading problems using bio-inspired algorithms publication-title: Journal of Network and Computer Applications – reference: B. Basturk, D. Karaboga, An artificial bee colony (ABC) algorithm for numeric function optimization, in: IEEE Swarm Intelligence Symposium, 2006. – volume: 129 start-page: 99 year: 2003 end-page: 128 ident: br000010 article-title: SONET/SDH ring assignment with capacity constraints publication-title: Discrete Applied Mathematics – reference: D.T. Pham, A. Ghanbarzadeh, E. Koç, S. Otri, S. Rahim, M. Zaidi, The bees algorithm, Technical Note, Manufacturing Engineering Centre, Cardiff University, UK, 2005. – reference: D. Karaboga, B. Basturk, Artificial bee colony (ABC), harmony search and bees algorithms on numerical optimization, in: Innovative Production Machines and Systems Virtual Conference, 2009. – start-page: 267 year: 2010 end-page: 276 ident: br000135 article-title: Using the Bees Algorithm to assign terminals to concentrators publication-title: Trends in Applied Intelligent Systems – year: 2003 ident: br000035 article-title: Introduction to Evolutionary Computing – reference: A.C.G. Silva, E.S. Marinho, W. Oliveira, D.J. Aloise, 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, 2009. – volume: 35 start-page: 223 year: 2000 end-page: 232 ident: br000025 article-title: A branch-and-cut algorithm for solving an intraring synchronous optical network design problem publication-title: Networks – reference: A.C.G. Silva, Genetic algorithm and memetic algorithm with vocabulary building for the SONET ring assignment problem, Master Thesis, UFRN, Natal/RN, 2008. – reference: Artificial bee colony algorithm. Website: – reference: L.O. Bastos, L.S. Ochi, E.M. Macambira, GRASP with path-relinking for the SONET ring assignment problem, in: Proceedings of the Fifth International Conference on Hybrid Intelligent Systems, HIS’05, 2005, pp. 239–244. – reference: L.O. Bastos, L.S. Ochi, A genetic algorithm with evolutionary path-relinking for the sonet ring assignment problem, in: Proceedings of the International Conference on Engineering Optimization—EngOpt2008, Sponsoring Societies: Mathematical Programming Society, MPS, ISSMO, EUROPT, ABCM, 2008. – volume: 39 start-page: 459 year: 2007 end-page: 471 ident: br000165 article-title: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm publication-title: Journal of Global Optimization – volume: 40 start-page: 1533 year: 1994 end-page: 1541 ident: br000110 article-title: Clustering for the design of sonet rings in interoffice telecomunications publication-title: Management Science – volume: 8 start-page: 687 year: 2008 end-page: 697 ident: br000175 article-title: On the performance of artificial bee colony (ABC) algorithm publication-title: Applied Soft Computing – volume: 41 start-page: 3 year: 2003 end-page: 23 ident: br000030 article-title: The sonet edge-partition problem publication-title: Networks – volume: 47 start-page: 157 year: 2006 end-page: 171 ident: br000065 article-title: A column generation approach for SONET ring assignment publication-title: Networks – volume: 11 start-page: 35 year: 2005 end-page: 57 ident: br000015 article-title: Comparing metaheuristic algorithms for sonet network design problems publication-title: Journal of Heuristics – reference: E.M. Macambira, C.N. Meneses, P.M. Pardalos, M.G.C. Resende, A novel integer programming formulation for the K-SONET ring assignment problem, AT&T Labs Research Technical Report TD-6HLLNR, 2005. – reference: D. Karaboga, An idea based on honey bee swarm for numerical optimization, Technical Report TR06, Erciyes University, Engineering Faculty, Computer Engineering Department, 2005. – year: 2001 ident: br000040 article-title: Swarm Intelligence – reference: W.K.S. Soares, Heuristics using vocabulary building to the SONET ring assignment problem, Master Thesis, UFRN, Natal/RN, 2008. – reference: . – reference: Memetic algorithms. Website: – reference: W. Oliveira, Parallel evolutionary algorithm to the SONET/SDH ring assignment problem, Master Thesis, UFRN, Natal/RN, 2010. – year: 2011 ident: br000125 article-title: Efficient load balancing using the bees algorithm publication-title: Trends in Applied Intelligent Systems – reference: Bees algorithm. Website: – reference: L.O. Bastos, L.S. Ochi, E.M. Macambira, A relative neighbourhood GRASP for the SONET ring assignment problem, in: Proceedings of the International Network Optimization Conference, 2005, pp. 833–838. – start-page: 789 year: 2007 end-page: 798 ident: br000170 article-title: Artificial bee colony (ABC) optimization algorithm for solving constrained optimization problems publication-title: Proceedings of the 12th International Fuzzy Systems Association World Congress on Foundations of Fuzzy Logic and Soft Computing – volume: 214 start-page: 108 year: 2009 end-page: 132 ident: br000180 article-title: A comparative study of artificial bee colony algorithm publication-title: Applied Mathematics and Computation – reference: L.O. Bastos, Heuristic solutions for the SONET ring assignment problem, Master Thesis, UFF, Niterói/RJ, 2005. – reference: M. Pelleau, P. Van Hentenryck, C. Truchet, Sonet network design problems, in: Y. Deville, C. Solnon (Eds.), Sixth International Workshop on Local Search Techniques in Constraint Satisfaction, LSCS’09, EPTCS 5, 2009, pp. 81–95. – reference: D.T. Pham, A.A. Afify, E. Koç, Manufacturing cell formation using the bees algorithm, in: Innovative Production Machines and Systems Virtual Conference, Cardiff, UK, 2007. – volume: 31 start-page: 68 year: 2009 end-page: 85 ident: br000045 article-title: A survey: algorithms simulating bee swarm intelligence publication-title: Artificial Intelligence Review – start-page: 61 year: 2010 end-page: 70 ident: br000120 article-title: Efficient load balancing for a resilient packet ring using artificial bee colony publication-title: Applications of Evolutionary Computation, EvoApplications 2010: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoMUSART, and EvoTRANSLOG – year: 2002 ident: br000005 article-title: SONET – reference: R. Aringhieri, M. Dell’Amico, L. Grasselli, Solution of the sonet ring assignment problem with capacity constraints, Technical Report 12, DISMI, University of Modena and Reggio Emilia, 2001. – start-page: 789 year: 2007 ident: 10.1016/j.osn.2011.11.001_br000170 article-title: Artificial bee colony (ABC) optimization algorithm for solving constrained optimization problems – volume: 11 start-page: 35 issue: 1 year: 2005 ident: 10.1016/j.osn.2011.11.001_br000015 article-title: Comparing metaheuristic algorithms for sonet network design problems publication-title: Journal of Heuristics doi: 10.1007/s10732-005-6998-7 – ident: 10.1016/j.osn.2011.11.001_br000075 doi: 10.1109/ICHIS.2005.52 – year: 2011 ident: 10.1016/j.osn.2011.11.001_br000125 article-title: Efficient load balancing using the bees algorithm – volume: 41 start-page: 3 issue: 1 year: 2003 ident: 10.1016/j.osn.2011.11.001_br000030 article-title: The sonet edge-partition problem publication-title: Networks doi: 10.1002/net.10054 – ident: 10.1016/j.osn.2011.11.001_br000145 – ident: 10.1016/j.osn.2011.11.001_br000055 – start-page: 61 year: 2010 ident: 10.1016/j.osn.2011.11.001_br000120 article-title: Efficient load balancing for a resilient packet ring using artificial bee colony – ident: 10.1016/j.osn.2011.11.001_br000090 – ident: 10.1016/j.osn.2011.11.001_br000185 – volume: 129 start-page: 99 issue: 1 year: 2003 ident: 10.1016/j.osn.2011.11.001_br000010 article-title: SONET/SDH ring assignment with capacity constraints publication-title: Discrete Applied Mathematics doi: 10.1016/S0166-218X(02)00236-6 – ident: 10.1016/j.osn.2011.11.001_br000105 – volume: 40 start-page: 1533 issue: 11 year: 1994 ident: 10.1016/j.osn.2011.11.001_br000110 article-title: Clustering for the design of sonet rings in interoffice telecomunications publication-title: Management Science doi: 10.1287/mnsc.40.11.1533 – ident: 10.1016/j.osn.2011.11.001_br000160 – year: 2002 ident: 10.1016/j.osn.2011.11.001_br000005 – ident: 10.1016/j.osn.2011.11.001_br000020 doi: 10.4204/EPTCS.5.7 – ident: 10.1016/j.osn.2011.11.001_br000155 – volume: 214 start-page: 108 issue: 1 year: 2009 ident: 10.1016/j.osn.2011.11.001_br000180 article-title: A comparative study of artificial bee colony algorithm publication-title: Applied Mathematics and Computation doi: 10.1016/j.amc.2009.03.090 – year: 2001 ident: 10.1016/j.osn.2011.11.001_br000040 – ident: 10.1016/j.osn.2011.11.001_br000085 – volume: 47 start-page: 157 issue: 3 year: 2006 ident: 10.1016/j.osn.2011.11.001_br000065 article-title: A column generation approach for SONET ring assignment publication-title: Networks doi: 10.1002/net.20102 – ident: 10.1016/j.osn.2011.11.001_br000190 – volume: 39 start-page: 459 issue: 3 year: 2007 ident: 10.1016/j.osn.2011.11.001_br000165 article-title: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm publication-title: Journal of Global Optimization doi: 10.1007/s10898-007-9149-x – ident: 10.1016/j.osn.2011.11.001_br000060 doi: 10.1109/ICHIS.2005.52 – start-page: 267 year: 2010 ident: 10.1016/j.osn.2011.11.001_br000135 article-title: Using the Bees Algorithm to assign terminals to concentrators – ident: 10.1016/j.osn.2011.11.001_br000150 – ident: 10.1016/j.osn.2011.11.001_br000115 – ident: 10.1016/j.osn.2011.11.001_br000070 – ident: 10.1016/j.osn.2011.11.001_br000095 – ident: 10.1016/j.osn.2011.11.001_br000050 – volume: 8 start-page: 687 issue: 1 year: 2008 ident: 10.1016/j.osn.2011.11.001_br000175 article-title: On the performance of artificial bee colony (ABC) algorithm publication-title: Applied Soft Computing doi: 10.1016/j.asoc.2007.05.007 – ident: 10.1016/j.osn.2011.11.001_br000140 – ident: 10.1016/j.osn.2011.11.001_br000080 doi: 10.1109/ICHIS.2005.52 – volume: 34 start-page: 668 issue: 2 year: 2011 ident: 10.1016/j.osn.2011.11.001_br000130 article-title: Solving ring loading problems using bio-inspired algorithms publication-title: Journal of Network and Computer Applications doi: 10.1016/j.jnca.2010.11.003 – volume: 31 start-page: 68 issue: 1 year: 2009 ident: 10.1016/j.osn.2011.11.001_br000045 article-title: A survey: algorithms simulating bee swarm intelligence publication-title: Artificial Intelligence Review doi: 10.1007/s10462-009-9127-4 – volume: 35 start-page: 223 issue: 3 year: 2000 ident: 10.1016/j.osn.2011.11.001_br000025 article-title: A branch-and-cut algorithm for solving an intraring synchronous optical network design problem publication-title: Networks doi: 10.1002/(SICI)1097-0037(200005)35:3<223::AID-NET6>3.0.CO;2-J – year: 2003 ident: 10.1016/j.osn.2011.11.001_br000035 – ident: 10.1016/j.osn.2011.11.001_br000100 |
| SSID | ssj0044486 |
| Score | 1.8861294 |
| Snippet | In the past years, the number of users of Internet-based applications has exponentially increased and consequently the request for transmission capacity or... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 97 |
| SubjectTerms | Bee-inspired algorithms Intraring SONET design problem Optical telecommunication networks SONET assignment problem |
| Title | Solving large-scale SONET network design problems using bee-inspired algorithms |
| URI | https://dx.doi.org/10.1016/j.osn.2011.11.001 |
| Volume | 9 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Baden-Württemberg Complete Freedom Collection (Elsevier) customDbUrl: eissn: 1872-9770 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0044486 issn: 1573-4277 databaseCode: GBLVA dateStart: 20110101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier ScienceDirect customDbUrl: eissn: 1872-9770 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0044486 issn: 1573-4277 databaseCode: ACRLP dateStart: 20050101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: ScienceDirect (Elsevier) customDbUrl: eissn: 1872-9770 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0044486 issn: 1573-4277 databaseCode: .~1 dateStart: 20050101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: ScienceDirect (Elsevier) customDbUrl: eissn: 1872-9770 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0044486 issn: 1573-4277 databaseCode: AIKHN dateStart: 20050101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVLSH databaseName: Elsevier Journals customDbUrl: mediaType: online eissn: 1872-9770 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0044486 issn: 1573-4277 databaseCode: AKRWK dateStart: 20050101 isFulltext: true providerName: Library Specific Holdings |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV09T8MwELWqssCA-BTlSx6YkEwT14njsapaFRDt0FbqFsWJXYJCUjVh5bdzzkdVhGBgTGQr0Yt1fhe_e4fQnRtS4OGRSyikV4RxyohUSpLIkdqzdSSdsirtZeKOF-xp6SxbaNDUwhhZZR37q5heRuv6TrdGs7uO4-7MdniPUc6N6ZkxYjMV7PAwWNMPn1uZB4P0o6wwgsHEjG5ONkuNV5anlYunMfKs-8L82Jt29pvRETqsiSLuV-9yjFoqPUEHO_aBp2g6yxLzPwAnRs5NcoBb4dl0MpzjtFJ346gUaOC6bUyOjcx9hQEnEqfmjF1FOEhW2SYuXt_zM7QYDeeDMakbJJCQCl6QniNcpS3lycCOmOCKamlpSGCk0ECMtGdJIV1HGR7heSwSjgb6IQWQNh2Eru6do3aapeoCYSWU4oETUuAPAKLwhC2twPK0kFyJkHWQ1UDjh7V7uGlikfiNTOzNBzR9gyZkFUYq10H32ynryjrjr8Gswdv_9v19CO2_T7v837QrtA9XtFLgXKN2sflQN0AuCnlbrp5btNd_fB5PvgBDQM3t |
| linkProvider | Elsevier |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV27TsMwFLVKGYAB8RTl6YEJyTRJ7SQeUdWqQB9DW6lbFCc2BIWkasLKt3OdR1WEYGBMci1FJ9b1ufHxuQjd2oEFPDy0iQXlFaGORYmQUpCQCeWaKhSsOJU2GtuDOX1asEUDdeuzMFpWWeX-MqcX2bq6067QbC-jqD01mdOhluNo0zNtxLaFtimDa5jU959rnQeF-qM4YgTRRIfXW5uFyCvNktLGUzt5Vo1hfixOGwtO_wDtV0wRP5Qvc4gaMjlCexv-gcdoMk1j_UMAx1rPTTLAW-LpZNyb4aSUd-OwUGjgqm9MhrXO_QUDUCRK9Ca7DLEfv6SrKH99z07QvN-bdQek6pBAAos7OekwbktlSFf4Zki5Iy0lDAUVjOAKmJFyDcGFzaQmEq5LQ84U8A_BgbUpP7BV5xQ1kzSRZwhLLqXjs8ACAgGfjLvcFIZvuIoLR_KAtpBRQ-MFlX247mIRe7VO7M0DND2NJpQVWivXQnfrIcvSO-OvYFrj7X2bAB7k9t-Hnf9v2A3aGcxGQ2_4OH6-QLvwxCrlOJeoma8-5BUwjVxcFzPpCzjuz4I |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Solving+large-scale+SONET+network+design+problems+using+bee-inspired+algorithms&rft.jtitle=Optical+switching+and+networking&rft.au=Bernardino%2C+Eug%C3%A9nia+Moreira&rft.au=Bernardino%2C+Anabela+Moreira&rft.au=S%C3%A1nchez-P%C3%A9rez%2C+Juan+Manuel&rft.au=G%C3%B3mez-Pulido%2C+Juan+Antonio&rft.date=2012-04-01&rft.issn=1573-4277&rft.volume=9&rft.issue=2&rft.spage=97&rft.epage=117&rft_id=info:doi/10.1016%2Fj.osn.2011.11.001&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_osn_2011_11_001 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1573-4277&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1573-4277&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1573-4277&client=summon |