{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T00:21:01Z","timestamp":1759882861260,"version":"build-2065373602"},"reference-count":35,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,12,1]],"date-time":"2003-12-01T00:00:00Z","timestamp":1070236800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,12,1]],"date-time":"2003-12-01T00:00:00Z","timestamp":1070236800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100003147","name":"Fonds pour la Formation de Chercheurs et l'Aide \u00c3\u00a0 la Recherche","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003147","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100005652","name":"Foundation for Community Association Research","doi-asserted-by":"publisher","award":["OGP0184121","97-NC-1654","01-ER-3254"],"award-info":[{"award-number":["OGP0184121","97-NC-1654","01-ER-3254"]}],"id":[{"id":"10.13039\/100005652","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2003,12]]},"DOI":"10.1016\/s0377-2217(02)00826-3","type":"journal-article","created":{"date-parts":[[2003,2,11]],"date-time":"2003-02-11T20:10:51Z","timestamp":1044994251000},"page":"280-295","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":18,"title":["A tabu search algorithm for self-healing ring network design"],"prefix":"10.1016","volume":"151","author":[{"given":"Bernard","family":"Fortz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Soriano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christelle","family":"Wynants","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00826-3_BIB1","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1016\/0305-0548(94)90029-9","article-title":"Topological design of ring networks","volume":"21","author":"Altinkemer","year":"1994","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(02)00826-3_BIB2","unstructured":"K. Altinkemer, B. Kim, Heuristics for ring network design, Working paper, Krannert Graduate School of Management, Purdue University, 1994"},{"issue":"1","key":"10.1016\/S0377-2217(02)00826-3_BIB3","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1023\/A:1009665726946","article-title":"Design of stacked self-healing rings using a genetic algorithm","volume":"6","author":"Armony","year":"2000","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S0377-2217(02)00826-3_BIB4","unstructured":"J. Baudron, A. Khadr, F. Kocsis, Availability and survivability of SDH networks. Alcatel Electrical Communications, 1993, 4th Quarter, pp. 339\u2013348"},{"key":"10.1016\/S0377-2217(02)00826-3_BIB5","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF02110141","article-title":"An optimization problem related to balancing loads on SONET rings","volume":"3","author":"Cosares","year":"1994","journal-title":"Telecommunication Systems"},{"key":"10.1016\/S0377-2217(02)00826-3_BIB6","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1287\/inte.25.1.20","article-title":"SONET toolkit: A decision support system for designing robust and cost-effective fiber-optic networks","volume":"25","author":"Cosares","year":"1995","journal-title":"Interfaces"},{"key":"10.1016\/S0377-2217(02)00826-3_BIB7","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0167-6377(99)00031-0","article-title":"Exact solution for the sonet ring loading problem","volume":"25","author":"Dell\u2019Amico","year":"1999","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(02)00826-3_BIB8","unstructured":"M. Di Lascio, A. Gambaro, U. Mocci. Protection Strategies for SDH Networks. Proceedings of the 6th International Network Planning Symposium\u2013\u2013Networks\u201994, Budapest, Hungary, 1994, 4\u20139 September, pp. 387\u2013392"},{"key":"10.1016\/S0377-2217(02)00826-3_BIB9","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","article-title":"Future paths for integer programming and links to artificial intelligence","volume":"5","author":"Glover","year":"1986","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(02)00826-3_BIB10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02078647","article-title":"A user\u2019s guide to tabu search","volume":"41","author":"Glover","year":"1993","journal-title":"Annals of Operations Research"},{"year":"1997","series-title":"Tabu Search","author":"Glover","key":"10.1016\/S0377-2217(02)00826-3_BIB11"},{"key":"10.1016\/S0377-2217(02)00826-3_BIB12","unstructured":"O. Goldschmidt, A. Laugier, E.V. Olinick, SONET\/SDH ring assignment with capacity constraints. INFORMS Meeting, Montreal, Canada, 1998, 26\u201329 April (also working paper, Department of IE and OR, University of California, Berkeley)"},{"key":"10.1016\/S0377-2217(02)00826-3_BIB13","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1137\/0109047","article-title":"Multi-terminal network flows","volume":"9","author":"Gomory","year":"1961","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"10.1016\/S0377-2217(02)00826-3_BIB14","unstructured":"P. Hansen, The steepest ascent mildest descent heuristic for combinatorial programming. Congress on Numerical Methods in Combinatorial Optimization, Capri, Italy, 1986"},{"key":"10.1016\/S0377-2217(02)00826-3_BIB15","unstructured":"J.L. Kennington, V.S.S. Nair, M.H. Rahman, Optimization based algorithms for finding minimal cost ring covers in survivable networks. Report 97-CSE-12, Department of Computer Science and Engineering, Southern Methodist University, 1997"},{"issue":"12","key":"10.1016\/S0377-2217(02)00826-3_BIB16","doi-asserted-by":"crossref","first-page":"1145","DOI":"10.1016\/S0305-0548(98)00005-7","article-title":"Designing tributary networks with multiple ring families. Working paper AT&T Labs, Holmdel, NJ 07733","volume":"25","author":"Klincewicz","year":"1997","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(02)00826-3_BIB17","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1016\/S0305-0548(97)00082-8","article-title":"Covering a graph with cycles","volume":"25","author":"Labb\u00e9","year":"1998","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(02)00826-3_BIB18","doi-asserted-by":"crossref","first-page":"1533","DOI":"10.1287\/mnsc.40.11.1533","article-title":"Clustering for the design of SONET rings in interoffice telecommunications","volume":"40","author":"Laguna","year":"1994","journal-title":"Management Science"},{"issue":"06","key":"10.1016\/S0377-2217(02)00826-3_BIB19","doi-asserted-by":"crossref","first-page":"780","DOI":"10.1109\/3468.725349","article-title":"Topology network design for SONET ring architecture","volume":"28","author":"Luss","year":"1998","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"10.1016\/S0377-2217(02)00826-3_BIB20","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1287\/opre.45.1.148","article-title":"Optimal load balancing on SONET bidirectional rings","volume":"45","author":"Myung","year":"1997","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00826-3_BIB21","unstructured":"G. Pesant, P. Soriano, An optimal strategy for the constrained cycle cover problem. Research report CRT 98-51, Centre de recherche sur les transports, Universit\u00e9 de Montr\u00e9al, Annals of Mathematics and Artificial Intelligence, in press"},{"key":"10.1016\/S0377-2217(02)00826-3_BIB22","unstructured":"P. Semal, K. Wirl, Optimal clustering and ring creation in the network planning system PHANET. Proceedings of the 6th International Network Planning Symposium-Networks\u201994. Budapest, Hungary, 4\u20139 September 1994, pp. 303\u2013308"},{"issue":"1","key":"10.1016\/S0377-2217(02)00826-3_BIB23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S0895480195294994","article-title":"The ring loading problem","volume":"11","author":"Schrijver","year":"1998","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"10.1016\/S0377-2217(02)00826-3_BIB24","doi-asserted-by":"crossref","unstructured":"J.B. Slewinsky, W.D. Grover, M.H. MacGregor, An algorithm for survivable network design employing multiple self-healing rings, Proceedings of IEEE GLOBECOM\u201993, 1993, pp. 1568\u20131573","DOI":"10.1109\/GLOCOM.1993.318334"},{"key":"10.1016\/S0377-2217(02)00826-3_BIB25","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF02125454","article-title":"Diversification strategies in tabu search algorithms for the maximum clique problem","volume":"63","author":"Soriano","year":"1996","journal-title":"Annals of Operations Research"},{"issue":"2","key":"10.1016\/S0377-2217(02)00826-3_BIB26","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1051\/ro\/1997310201331","article-title":"Fondements et applications des m\u00e9thodes de recherche avec tabous","volume":"31","author":"Soriano","year":"1997","journal-title":"RAIRO"},{"key":"10.1016\/S0377-2217(02)00826-3_BIB27","series-title":"Telecommunications Network Planning","first-page":"149","article-title":"Design and dimensioning of survivable SDK networks","author":"Soriano","year":"1998"},{"issue":"June","key":"10.1016\/S0377-2217(02)00826-3_BIB28","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1109\/35.79402","article-title":"SONET ring applications for survivable fiber loop networks","author":"Sosnosky","year":"1991","journal-title":"IEEE Communications Magazine"},{"key":"10.1016\/S0377-2217(02)00826-3_BIB29","unstructured":"A. Sutter, J.L. Fullsack. SDH network planning in a changing environment, Proceedings of the 6th International Network Planning Symposium-Networks\u201994. Budapest, Hungary, 4\u20139 September 1994, pp. 149\u2013154"},{"issue":"5","key":"10.1016\/S0377-2217(02)00826-3_BIB30","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1287\/opre.46.5.719","article-title":"Optimal placement of add\/drop multiplexers: Heuristic and exact algorithms","volume":"46","author":"Sutter","year":"1998","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00826-3_BIB31","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1109\/24.93762","article-title":"An algorithm for designing rings for survivable fiber networks","volume":"40","author":"Wasem","year":"1991","journal-title":"IEEE Transactions on Reliability"},{"key":"10.1016\/S0377-2217(02)00826-3_BIB32","doi-asserted-by":"crossref","unstructured":"O.J. Wasem, R.H. Cardwell, T.H. Wu. Software for designing survivable sonet networks using self-healing rings. Proceedings of IEEE International Conference on Communication (ICC\u201992), 1992, pp. 425\u2013431","DOI":"10.1109\/ICC.1992.268094"},{"key":"10.1016\/S0377-2217(02)00826-3_BIB33","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1109\/49.265719","article-title":"Survivable SONET networks\u2013\u2013design methodologies","volume":"12","author":"Wasem","year":"1994","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"10.1016\/S0377-2217(02)00826-3_BIB34","doi-asserted-by":"crossref","first-page":"1698","DOI":"10.1109\/50.9987","article-title":"Survivable network architectures for broad-band fiber optic networks: Models and performance comparison","volume":"6","author":"Wu","year":"1988","journal-title":"IEEE Journal of Lightwave Technology"},{"year":"1992","series-title":"Fiber Network Service Survivability","author":"Wu","key":"10.1016\/S0377-2217(02)00826-3_BIB35"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702008263?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702008263?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T11:53:42Z","timestamp":1759838022000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702008263"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["S0377221702008263"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00826-3","relation":{},"ISSN":["0377-2217"],"issn-type":[{"type":"print","value":"0377-2217"}],"subject":[],"published":{"date-parts":[[2003,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A tabu search algorithm for self-healing ring network design","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0377-2217(02)00826-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2003 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}