{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:18:05Z","timestamp":1760645885980,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642275333"},{"type":"electronic","value":"9783642275340"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-27534-0_6","type":"book-chapter","created":{"date-parts":[[2012,2,15]],"date-time":"2012-02-15T14:44:57Z","timestamp":1329317097000},"page":"81-97","source":"Crossref","is-referenced-by-count":4,"title":["Solving SONET Problems Using a Hybrid Scatter Search Algorithm"],"prefix":"10.1007","author":[{"given":"Anabela Moreira","family":"Bernardino","sequence":"first","affiliation":[]},{"given":"Eug\u00e9nia Moreira","family":"Bernardino","sequence":"additional","affiliation":[]},{"given":"Juan Manuel","family":"S\u00e1nchez-P\u00e9rez","sequence":"additional","affiliation":[]},{"given":"Juan Antonio","family":"G\u00f3mez-Pulido","sequence":"additional","affiliation":[]},{"given":"Miguel Angel","family":"Vega-Rodr\u00edguez","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"Goralski, W.J.: SONET. McGraw-Hill Professional (2002)"},{"issue":"2","key":"6_CR2","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF02110141","volume":"3","author":"S. Cosares","year":"1994","unstructured":"Cosares, S., Saniee, I.: An optimistion problem related to balancing loads on SONET rings. Telecommunication Systems\u00a03(2), 165\u2013181 (1994)","journal-title":"Telecommunication Systems"},{"issue":"3","key":"6_CR3","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0167-6377(99)00031-0","volume":"25","author":"M. Dell\u2019Amico","year":"1999","unstructured":"Dell\u2019Amico, M., Labb\u00e9, M., Maffioli, F.: Exact solution of the SONET Ring Loading Problem. Oper. Res. Lett.\u00a025(3), 119\u2013129 (1999)","journal-title":"Oper. Res. Lett."},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0895480195294994","volume":"11","author":"A. Schrijver","year":"1998","unstructured":"Schrijver, A., Seymour, P., Winkler, P.: The ring loading problem. SIAM Journal of Discrete Mathematics\u00a011, 1\u201314 (1998)","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"6_CR5","first-page":"99","volume":"129","author":"O. Goldschmidt","year":"2003","unstructured":"Goldschmidt, O., Laugier, A., Olinick, E.V.: SONET\/SDH Ring Assignment with Capacity Constraints Discrete. Appl. Math.\u00a0129, 99\u2013128 (2003)","journal-title":"Appl. Math."},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10732-005-6998-7","volume":"11","author":"R. Aringhieri","year":"2005","unstructured":"Aringhieri, R., Dell\u2019Amico, M.: Comparing Metaheuristic Algorithms for Sonet Network Design Problems. Journal of Heuristics\u00a011, 35\u201357 (2005)","journal-title":"Journal of Heuristics"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Pelleau, M., Van Hentenryck, P., Truchet, C.: Sonet Network Design Problems. In: EPTCS 5, LSCS 2009, pp. 81\u201395 (2009)","DOI":"10.4204\/EPTCS.5.7"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1002\/(SICI)1097-0037(200005)35:3<223::AID-NET6>3.0.CO;2-J","volume":"35","author":"Y. Lee","year":"2000","unstructured":"Lee, Y., Sherali, H.D., Han, J., Kim, S.: A Branch-and-Cut Algorithm for Solving an Intraring Synchronous Optical Network Design Problem. Networks\u00a035, 223\u2013232 (2000)","journal-title":"Networks"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1002\/net.10054","volume":"41","author":"O. Goldschmidt","year":"2003","unstructured":"Goldschmidt, O., Hochbaum, D.S., Levin, A., Olinick, E.V.: The Sonet Edge-Partition Problem. Networks\u00a041, 3\u201323 (2003)","journal-title":"Networks"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F. Glover","year":"1977","unstructured":"Glover, F.: Heuristics for integer programming using surrogate constraints. Decision Sciences\u00a08, 156\u2013166 (1977)","journal-title":"Decision Sciences"},{"key":"6_CR11","unstructured":"Laguna, M.: Scatter search. In: Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Applied Optimistion, pp. 183\u2013193. Oxford University Press (2002)"},{"issue":"2","key":"6_CR12","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.orl.2003.08.001","volume":"32","author":"Y.S. Myung","year":"2004","unstructured":"Myung, Y.S., Kim, H.G.: On the ring loading problem with demand splitting. Operations Research Letters\u00a032(2), 167\u2013173 (2004)","journal-title":"Operations Research Letters"},{"issue":"1","key":"6_CR13","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.jalgor.2004.03.003","volume":"54","author":"B.F. Wang","year":"2005","unstructured":"Wang, B.F.: Linear time algorithms for the ring loading problem with demand splitting. Journal of Algorithms\u00a054(1), 45\u201357 (2005)","journal-title":"Journal of Algorithms"},{"issue":"7","key":"6_CR14","first-page":"1617","volume":"4","author":"S.-S. Kim","year":"2008","unstructured":"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\u00a04(7), 1617\u20131626 (2008)","journal-title":"International Journal of Innovative Computing, Information and Control"},{"issue":"2","key":"6_CR15","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1016\/j.jnca.2010.11.003","volume":"34","author":"A.M. Bernardino","year":"2011","unstructured":"Bernardino, A.M., Bernardino, E.M., S\u00e1nchez-P\u00e9rez, J.M., Vega-Rodr\u00edguez, M.A., G\u00f3mez-Pulido, J.A.: Solving ring loading problems using Bio-inspired algorithms. Journal of Network and Computer Applications\u00a034(2), 668\u2013685 (2011)","journal-title":"Journal of Network and Computer Applications"},{"key":"6_CR16","unstructured":"Bernardino, A.M., Bernardino, E.M., S\u00e1nchez-P\u00e9rez, J.M., Vega-Rodr\u00edguez, M.A., G\u00f3mez-Pulido, J.A.: Solving the ring arc-loading problem using a Hybrid Scatter Search Algorithm. In: International Conference on Evolutionary Computation (2010)"},{"key":"6_CR17","unstructured":"Aringhieri, R., Dell\u2019Amico, M., Grasselli, L.: Solution of the sonet ring assignment problem with capacity constraints. Technical Report 12, DISMI. University of Modena and Reggio Emilia (2001)"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1109\/ICHIS.2005.52"},{"issue":"3","key":"6_CR19","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1002\/net.20102","volume":"47","author":"E.M. Macambira","year":"2006","unstructured":"Macambira, E.M., Maculan, N., Souza, C.C.: A column generation approach for SONET ring assignment. Networks\u00a047(3), 157\u2013171 (2006)","journal-title":"Networks"},{"key":"6_CR20","unstructured":"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\u2013838 (2005)"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"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\u2013244 (2005)","DOI":"10.1109\/ICHIS.2005.52"},{"key":"6_CR22","unstructured":"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)"},{"issue":"11","key":"6_CR23","first-page":"1533","volume":"40","author":"M. Laguna","year":"1994","unstructured":"Laguna, M.: Clustering for the design of sonet rings in interoffice telecomunications. Management Sciennce\u00a040(11), 1533\u20131541 (1994)","journal-title":"Management Sciennce"},{"key":"6_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/0-306-48056-5_1","volume-title":"Handbook of Metaheuristics","author":"F. Glover","year":"2003","unstructured":"Glover, F., Laguna, M., Marti, R.: Scatter Search and Path Relinking: Advances and Applications. In: Handbook of Metaheuristics, vol.\u00a057, pp. 1\u201335. Springer, Heidelberg (2003)"},{"key":"6_CR25","first-page":"329","volume-title":"IEEE Congress on Evolutionary Computation (CEC 2010)","author":"A.M. Bernardino","year":"2010","unstructured":"Bernardino, A.M., Bernardino, E.M., S\u00e1nchez-P\u00e9rez, J.M., Vega-Rodr\u00edguez, M.A., G\u00f3mez-Pulido, J.A.: A Hybrid Scatter Search Algorithm to Assign Terminals to Concentrators. In: IEEE Congress on Evolutionary Computation (CEC 2010), pp. 329\u2013336. IEEE Computer Society, IEEE press, Los Alamitos (2010)"},{"key":"6_CR26","doi-asserted-by":"crossref","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers (1997)","DOI":"10.1007\/978-1-4615-6089-0"}],"container-title":["Studies in Computational Intelligence","Computational Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-27534-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,20]],"date-time":"2025-03-20T21:31:26Z","timestamp":1742506286000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-27534-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642275333","9783642275340"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-27534-0_6","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2012]]}}}