{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,5]],"date-time":"2025-08-05T12:32:16Z","timestamp":1754397136511},"reference-count":18,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Networks"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1016\/s1389-1286(02)00385-7","type":"journal-article","created":{"date-parts":[[2003,2,4]],"date-time":"2003-02-04T15:48:55Z","timestamp":1044373735000},"page":"227-245","source":"Crossref","is-referenced-by-count":15,"title":["Strictly nonblocking grooming of dynamic traffic in unidirectional SONET\/WDM rings using genetic algorithms"],"prefix":"10.1016","volume":"41","author":[{"given":"Yong","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shen-Chu","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo-Xi","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1389-1286(02)00385-7_BIB1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/50.818901","article-title":"Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks","volume":"18","author":"Chiu","year":"2000","journal-title":"J. Lightwave Technol."},{"key":"10.1016\/S1389-1286(02)00385-7_BIB2","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1109\/50.737421","article-title":"Quantifying the benefit of wavelength add-drop in WDM rings with distance-independent and dependent traffic","volume":"17","author":"Simmons","year":"1999","journal-title":"J. Lightwave Technol."},{"key":"10.1016\/S1389-1286(02)00385-7_BIB3","doi-asserted-by":"crossref","first-page":"1995","DOI":"10.1109\/49.887919","article-title":"Grooming of arbitrary traffic in SONET\/WDM BLSRs","volume":"18","author":"Wan","year":"2000","journal-title":"IEEE J. Select. Areas Commun."},{"key":"10.1016\/S1389-1286(02)00385-7_BIB4","doi-asserted-by":"crossref","first-page":"1645","DOI":"10.1109\/50.964064","article-title":"Improved approaches for cost-effective traffic grooming in WDM ring networks: ILP formulations and single-hop and multihop connections","volume":"19","author":"Wang","year":"2001","journal-title":"J. Lightwave Technol."},{"key":"10.1016\/S1389-1286(02)00385-7_BIB5","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1109\/90.879347","article-title":"An effective and comprehensive approach for traffic grooming and wavelength assignment in SONET\/WDM rings","volume":"8","author":"Zhang","year":"2001","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"10.1016\/S1389-1286(02)00385-7_BIB6","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1109\/49.974666","article-title":"On optimal traffic grooming in WDM rings","volume":"20","author":"Dutta","year":"2002","journal-title":"IEEE J. Select. Areas Commun."},{"key":"10.1016\/S1389-1286(02)00385-7_BIB7","doi-asserted-by":"crossref","first-page":"1961","DOI":"10.1109\/49.887916","article-title":"Reducing electronic multiplexing costs in SONET\/WDM rings with dynamically changing traffic","volume":"18","author":"Berry","year":"2000","journal-title":"IEEE J. Select. Areas Commun."},{"key":"10.1016\/S1389-1286(02)00385-7_BIB8","doi-asserted-by":"crossref","unstructured":"Y. Xu, S.-C. Xu, B.-X. Wu, Traffic grooming in unidirectional WDM ring networks using genetic algorithms, Comput. Commun. 25 (2002) 1185\u20131194","DOI":"10.1016\/S0140-3664(02)00007-5"},{"key":"10.1016\/S1389-1286(02)00385-7_BIB9","series-title":"Genetic Algorithms+Data Structures=Evolution Programs","author":"Michalewicz","year":"1996"},{"key":"10.1016\/S1389-1286(02)00385-7_BIB10","doi-asserted-by":"crossref","first-page":"1340","DOI":"10.1109\/21.260665","article-title":"An evaluation of local improvement operators for genetic algorithms","volume":"23","author":"Miller","year":"1993","journal-title":"IEEE Trans. Systems, Man, Cybernetics"},{"key":"10.1016\/S1389-1286(02)00385-7_BIB11","series-title":"Genetic Algorithms and Engineering Design","author":"Gen","year":"1996"},{"key":"10.1016\/S1389-1286(02)00385-7_BIB12","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/S0140-3664(98)00238-2","article-title":"An approach to wide area WDM optical network design using genetic algorithm","volume":"22","author":"Saha","year":"1999","journal-title":"Comput. Commun."},{"key":"10.1016\/S1389-1286(02)00385-7_BIB13","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0954-1810(98)00019-3","article-title":"Genetic algorithms for designing multihop lightwave network topologies","volume":"13","author":"Gazen","year":"1999","journal-title":"Artificial Intelligence Eng."},{"key":"10.1016\/S1389-1286(02)00385-7_BIB14","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1016\/S1389-1286(00)00015-3","article-title":"Routing and wavelength assignment with power considerations in optical networks","volume":"32","author":"Ali","year":"2000","journal-title":"Comput. Networks"},{"key":"10.1016\/S1389-1286(02)00385-7_BIB15","doi-asserted-by":"crossref","first-page":"1223","DOI":"10.1016\/S0140-3664(00)00196-1","article-title":"Converter placement in all-optical networks using genetic algorithms","volume":"23","author":"Vijayanand","year":"2000","journal-title":"Comput. Commun."},{"key":"10.1016\/S1389-1286(02)00385-7_BIB16","series-title":"Numerical Optimization for Computer Models","author":"Schwefel","year":"1981"},{"key":"10.1016\/S1389-1286(02)00385-7_BIB17","unstructured":"Y. Xu, S.-C. Xu, Heuristic operators, redundant mapping and other issues in genetic algorithms, in: Proceedings of the CEC2001, 2001, pp. 1398\u20131405"},{"key":"10.1016\/S1389-1286(02)00385-7_BIB18","first-page":"109","article-title":"Genetic local search algorithm for the traveling salesman problem","volume":"vol. 496","author":"Ulder","year":"1991"}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128602003857?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128602003857?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T22:57:19Z","timestamp":1553900239000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1389128602003857"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S1389128602003857"],"URL":"https:\/\/doi.org\/10.1016\/s1389-1286(02)00385-7","relation":{},"ISSN":["1389-1286"],"issn-type":[{"value":"1389-1286","type":"print"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}