{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,25]],"date-time":"2024-01-25T17:46:39Z","timestamp":1706204799576},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,2,17]],"date-time":"2009-02-17T00:00:00Z","timestamp":1234828800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1007\/s12293-008-0006-3","type":"journal-article","created":{"date-parts":[[2009,2,16]],"date-time":"2009-02-16T13:12:30Z","timestamp":1234789950000},"page":"101-123","source":"Crossref","is-referenced-by-count":8,"title":["Solving the routing and wavelength assignment problem with a multilevel distributed memetic algorithm"],"prefix":"10.1007","volume":"1","author":[{"given":"Thomas","family":"Fischer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kerstin","family":"Bauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Merz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kerstin","family":"Bauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,2,17]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","DOI":"10.1002\/0471221147","volume-title":"Fiber-optic communication systems","author":"GP Agrawal","year":"2002","unstructured":"Agrawal GP (2002) Fiber-optic communication systems, 3rd edn. Wiley, New York","edition":"3"},{"key":"6_CR2","unstructured":"Alkan A, \u00d6zcan E (2003) Memetic algorithms for timetabling. Congress on Evolutionary Computation (CEC\u201903)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Atamt\u00fcrk A, Rajan D (2008) Partition inequalities for capacitated survivable network design based on directed p-cycles. Discrete Optimization 5(2):415\u2013433. Available at http:\/\/ieor.berkeley.edu\/~atamturk\/data\/","DOI":"10.1016\/j.disopt.2007.08.002"},{"issue":"5","key":"6_CR4","doi-asserted-by":"crossref","first-page":"903","DOI":"10.1109\/49.510913","volume":"14","author":"D Banerjee","year":"1996","unstructured":"Banerjee D, Mukherjee B (1996) A practical approach for routing and wavelength assignment in large wavelength-routed optical networks. IEEE J Select Areas Commun 14(5): 903\u2013908","journal-title":"IEEE J Select Areas Commun"},{"key":"6_CR5","unstructured":"Banerjee N, Mehta V, Pandey S (2004) A genetic algorithm approach for solving the routing and wavelength assignment problem in WDM networks. In: Proceedings of the international conference on networks (ICN\u201904)"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Banerjee N, Sharan S (2004) A evolutionary algorithm for solving the single objective static routing and wavelength assignment problem in WDM networks. In: Proceedings of international conference on intelligent sensing and information processing (ICISIP 2004), pp 13\u201318","DOI":"10.1109\/ICISIP.2004.1287616"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Banerjee S, Chen C (1996) Design of wavelength-routed optical networks for circuit switched traffic. In: Global telecommunications conference, GLOBECOM, vol 1, pp 306\u2013310","DOI":"10.1109\/GLOCOM.1996.594379"},{"issue":"2","key":"6_CR8","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1109\/50.554330","volume":"15","author":"S Baroni","year":"1997","unstructured":"Baroni S, Bayvel P (1997) Wavelength requirements in arbitrarily connected wavelength-routed optical networks. J Lightwave Technol 15(2): 242\u2013251","journal-title":"J Lightwave Technol"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Bauer K, Fischer T, Krumke SO, Gerhardt K, Westphal S, Merz P (2008) Improved construction heuristics and iterated local search for the routing and wavelength assignment problem. In: van Hemert J, Cotta C (eds) EvoCOP 2008\u2014eighth european conference on evolutionary computation in combinatorial optimization. Lecture notes in computer science, vol 4972. Springer, Heidelberg, March, pp 158\u2013169","DOI":"10.1007\/978-3-540-78604-7_14"},{"key":"6_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814068","volume-title":"Random graphs. Cambridge Studies in advanced mathematics","author":"B Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s B (2001) Random graphs. Cambridge Studies in advanced mathematics. Cambridge University Press, Cambridge"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Chlamtac I, Farag\u00f3 A, Zhang T (1996) Lightpath (wavelength) routing in large wdm networks. IEEE J Select Areas Commun 14(5)","DOI":"10.1109\/49.510914"},{"issue":"7","key":"6_CR12","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1109\/26.153361","volume":"40","author":"I Chlamtac","year":"1992","unstructured":"Chlamtac I, Ganz A, Karmi G (1992) Lightpath communications: an approach to high bandwidth optical WANs. IEEE Trans Commun 40(7): 1171\u20131182","journal-title":"IEEE Trans Commun"},{"key":"6_CR13","unstructured":"de Noronha TF, Resende MGC, Ribeiro CC (2007) A random-keys genetic algorithm for routing and wavelength assignment. In: Proceedings of the seventh metaheuristics international conference MIC (2007)"},{"issue":"3","key":"6_CR14","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1016\/j.ejor.2004.09.007","volume":"171","author":"TF Noronha","year":"2006","unstructured":"Noronha TF, Ribeiro CC (2006) Routing and wavelength assignment by partition colouring. Eur J Oper Res 171(3): 797\u2013810","journal-title":"Eur J Oper Res"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Demers A, Greene D, Hauser C, Irish W, Larson J, Shenker S, Sturgis H, Swinehart D, Terry D (1987) Epidemic algorithms for replicated database maintenance. In: Schneider FB (ed) Proceedings of the 6th annual ACM symposium on principles of distributed computing. ACM Press, pp 1\u201312","DOI":"10.1145\/41840.41841"},{"key":"6_CR16","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s P, R\u00e9nyi A (1959) On random graphs I. Publ Math Debrecen 6: 290\u2013297","journal-title":"Publ Math Debrecen"},{"key":"6_CR17","unstructured":"Eugster PT, Guerraoui R, Kermarrec A-M, Massouli\u00e9 L (2004) From epidemics to distributed computing. IEEE Comput"},{"key":"6_CR18","first-page":"879","volume-title":"Parallel problem solving from nature\u2014PPSN X\u201410th international conference. Lecture notes in computer science, vol 5199","author":"T Fischer","year":"2008","unstructured":"Fischer T, Bauer K, Merz P (2008) A distributed memetic algorithm for the routing and wavelength assignment problem. In: Rudolph G, Jansen T, Lucas S, Poloni C, Beume N (eds) Parallel problem solving from nature\u2014PPSN X\u201410th international conference. Lecture notes in computer science, vol 5199. Springer, Heidelberg, pp 879\u2013888"},{"key":"6_CR19","first-page":"225","volume-title":"Workshop on heuristic methods for the design, deployment, and reliability of networks and network applications (HEUNET 2008) at the international symposium on applications and the internet (SAINT 2008)","author":"T Fischer","year":"2008","unstructured":"Fischer T, Bauer K, Merz P (2008) A multilevel approach for the routing and wavelength assignment problem. In: K\u00f6ppen M, Raidl G (eds) Workshop on heuristic methods for the design, deployment, and reliability of networks and network applications (HEUNET 2008) at the international symposium on applications and the internet (SAINT 2008). IEEE Computer Society, Turku, pp 225\u2013228"},{"key":"6_CR20","first-page":"170","volume-title":"Hybrid metaheuristics, 4th international workshop, HM. Proceedings, Lecture notes in computer science, vol 4771","author":"T Fischer","year":"2007","unstructured":"Fischer T, Merz P (2007) A memetic algorithm for the optimal communication spanning tree problem. In: Bartz-Beielstein T, Blesa Aguilera MJ, Blum C, Naujoks B, Roli A, Rudolph G, Sampels M (eds) Hybrid metaheuristics, 4th international workshop, HM. Proceedings, Lecture notes in computer science, vol 4771. Springer, Dortmund, pp 170\u2013184 October 8\u20139"},{"key":"6_CR21","first-page":"277","volume-title":"Metaheuristics\u2014progress in complex systems optimization, vol 39. Operations Research\/Computer Science Interfaces","author":"T Fischer","year":"2007","unstructured":"Fischer T, Merz P (2007) Embedding a chained Lin\u2013Kernighan algorithm into a distributed algorithm. In: Doerner KF, Gendreau M, Greistorfer P, Gutjahr WJ, Hartl RF, Reimann M (eds) Metaheuristics\u2014progress in complex systems optimization, vol 39. Operations Research\/Computer Science Interfaces. Springer, Heidelberg, pp 277\u2013295"},{"key":"6_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56466-6","volume-title":"Fibre optic communication devices","author":"N Grote","year":"2001","unstructured":"Grote N, Venghaus H (2001) Fibre optic communication devices. Springer, Berlin"},{"key":"6_CR23","unstructured":"Hyyti\u00e4 E (2004) Heuristic algorithms for the generalized routing and wavelength assignment problem. In: Seventeenth Nordic Teletraffic Seminar, NTS-17, Fornebu, Norway, pp. 373\u2013386"},{"key":"6_CR24","unstructured":"Hyyti\u00e4 E, Virtamo J (1998) Wavelength assignment and routing in WDM networks. In: Fourteenth nordic teletraffic seminar, NTS-14, Lyngby, pp 31\u201340"},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"Jelasity M, Voulgaris S, Guerraoui R, Kermarrec A-M, van Steen M (2007) Gossip-based peer sampling. ACM Trans Comput Syst 25(3)","DOI":"10.1145\/1275517.1275520"},{"key":"6_CR26","unstructured":"Kleinberg J (1996) Approximation algorithms for disjoint paths problems. PhD thesis, Dept. of EECS, MIT, Cambridge"},{"key":"6_CR27","unstructured":"Li G, Simha R (2000) The partition coloring problem and its application to wavelength routing and assignment. In: Prof. of Optical Networks Workshop"},{"issue":"5","key":"6_CR28","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1109\/4234.1001667","volume":"6","author":"P Manohar","year":"2002","unstructured":"Manohar P, Manjunath D, Shevgaonkar RK (2002) Routing and wavelength assignment in optical networks from edge disjoint path algorithms. IEEE Commun Lett 6(5): 211\u2013213","journal-title":"IEEE Commun Lett"},{"key":"6_CR29","doi-asserted-by":"crossref","unstructured":"Margara L, Simon J (2000) Wavelength assignment problem on all-optical networks with k fibres per link. In: Automata, Languages and Programming, pp 768\u2013779","DOI":"10.1007\/3-540-45022-X_64"},{"issue":"3","key":"6_CR30","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01782776","volume":"2","author":"F Mattern","year":"1987","unstructured":"Mattern F (1987) Algorithms for distributed termination detection. Distribut Comput 2(3): 161\u2013175","journal-title":"Distribut Comput"},{"key":"6_CR31","unstructured":"Merz P (2000) Memetic algorithms for combinatorial optimization problems: fitness landscapes and effective search strategies. PhD thesis, Department of Electrical Engineering and Computer Science, University of Siegen, Germany"},{"issue":"4","key":"6_CR32","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/4235.887234","volume":"4","author":"P Merz","year":"2000","unstructured":"Merz P, Freisleben B (2000) Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Trans Evol Comput 4(4): 337\u2013352","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"6_CR33","first-page":"297","volume":"13","author":"P Merz","year":"2001","unstructured":"Merz P, Freisleben B (2001) Memetic algorithms for the traveling salesman problem. Complex Syst 13(4): 297\u2013345","journal-title":"Complex Syst"},{"key":"6_CR34","unstructured":"Moscato P (1989) On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms. Technical Report Caltech Concurrent Computation Program, Report. 826, California Institute of Technology, Pasadena"},{"key":"6_CR35","first-page":"219","volume-title":"New ideas in optimization","author":"P Moscato","year":"1999","unstructured":"Moscato P (1999) Memetic algorithms: a short introduction. In: Corne D, Dorigo M, Glover F (eds) New ideas in optimization. McGraw-Hill, New York, pp 219\u2013234"},{"key":"6_CR36","volume-title":"Optical WDM networks. Optical Networks","author":"B Mukherjee","year":"2006","unstructured":"Mukherjee B (2006) Optical WDM networks. Optical Networks. Springer, Heidelberg"},{"issue":"9","key":"6_CR37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/ecja.4410780901","volume":"78","author":"N Nagatsu","year":"1995","unstructured":"Nagatsu N, Hamazumi Y, Sato K-I (1995) Number of wavelengths required for constructing large-scale optical path networks. Electron Commun Jpn (Part I Commun) 78(9): 1\u201311","journal-title":"Electron Commun Jpn (Part I Commun)"},{"key":"6_CR38","unstructured":"Orlowski S, Pi\u00f3ro M, Tomaszewski A, Wess\u00e4ly R (2007) SNDlib 1.0\u2013Survivable Network Design Library. In: Proceedings of the 3rd international network optimization conference (INOC 2007), Spa, Belgium, April 2007. http:\/\/sndlib.zib.de"},{"key":"6_CR39","first-page":"51","volume-title":"Proceedings of the third workshop on foundations of genetic algorithms","author":"NJ Radcliffe","year":"1994","unstructured":"Radcliffe NJ, Surry PD (1994) Fitness variance of formae and performance prediction. In: Whitley LD, Vose MD (eds) Proceedings of the third workshop on foundations of genetic algorithms. Morgan Kaufmann, San Francisco, pp 51\u201372"},{"issue":"5","key":"6_CR40","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1109\/49.510907","volume":"14","author":"R Ramaswami","year":"1996","unstructured":"Ramaswami R, Sivarajan KN (1996) Design of logical topologies for wavelength-routed optical networks. IEEE J Select Areas Commun 14(5): 840\u2013851","journal-title":"IEEE J Select Areas Commun"},{"issue":"7","key":"6_CR41","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1109\/LCOMM.2004.832765","volume":"8","author":"AR Sharafat","year":"2004","unstructured":"Sharafat AR, Ma\u2019rouzi OR (2004) The most congested cutset: deriving a tight lower bound for the chromatic number in the RWA problem. IEEE Commun Lett 8(7): 473\u2013475","journal-title":"IEEE Commun Lett"},{"key":"6_CR42","doi-asserted-by":"crossref","unstructured":"Sinclair MC (1998) Minimum cost routing and wavelength allocation using a genetic-algorithm\/heuristic hybrid approach. In: Proc. 6th IEE conf. telecommunications, March","DOI":"10.1049\/cp:19980014"},{"issue":"2","key":"6_CR43","doi-asserted-by":"crossref","first-page":"1167","DOI":"10.1016\/j.ejor.2006.01.003","volume":"177","author":"N Skorin-Kapov","year":"2007","unstructured":"Skorin-Kapov N (2007) Routing and wavelength assignment in optical networks using bin packing based algorithms. Eur J Oper Res 177(2): 1167\u20131179","journal-title":"Eur J Oper Res"},{"key":"6_CR44","volume-title":"Design of survivable networks Lecture notes in mathematics, vol 1531","author":"M Stoer","year":"1992","unstructured":"Stoer M (1992) Design of survivable networks Lecture notes in mathematics, vol 1531. Springer, Berlin"},{"key":"6_CR45","unstructured":"Tan LG, Sinclair MC (1995) Wavelength assignment between the central nodes of the COST 239 European optical network. In: 11th UK performance engineering workshop, pp 235\u2013 247"},{"issue":"1","key":"6_CR46","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/TSMCB.2006.883268","volume":"37","author":"M Tang","year":"2007","unstructured":"Tang M, Yao X (2007) A memetic algorithm for VLSI floorplanning. IEEE Trans Syst Man Cybernet (Part B Cybernet) 37(1): 62\u201369","journal-title":"IEEE Trans Syst Man Cybernet (Part B Cybernet)"},{"key":"6_CR47","unstructured":"Varela GN, Sinclair MC (1999) Ant colony optimisation for virtual-wavelength-path routing and wavelength allocation. In: Proceedings of the congress on evolutionary computation, pp 1809\u20131816"},{"key":"6_CR48","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1023\/B:ANOR.0000039525.80601.15","volume":"131","author":"C Walshaw","year":"2004","unstructured":"Walshaw C (2004) Multilevel refinement for combinatorial optimisation problems. Ann Oper Res 131: 325\u2013372","journal-title":"Ann Oper Res"},{"issue":"9","key":"6_CR49","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1109\/LCOMM.2005.1506721","volume":"9","author":"Y Wang","year":"2005","unstructured":"Wang Y, Cheng TH, Lim MH (2005) A Tabu search algorithm for static routing and wavelength assignment problem. IEEE Commun Lett 9(9): 841\u2013843","journal-title":"IEEE Commun Lett"},{"issue":"5","key":"6_CR50","doi-asserted-by":"crossref","first-page":"881","DOI":"10.1109\/49.510911","volume":"14","author":"N Wauters","year":"1996","unstructured":"Wauters N, Demeester P (1996) Design of the optical path layer in multiwavelength cross-connected networks. IEEE J Select Areas Commun 14(5): 881\u2013892","journal-title":"IEEE J Select Areas Commun"},{"issue":"10","key":"6_CR51","doi-asserted-by":"crossref","first-page":"2130","DOI":"10.1109\/49.887932","volume":"18","author":"S Xu","year":"2000","unstructured":"Xu S, Li L, Wang S (2000) Dynamic routing and assignment of wavelength algorithms in multifiber wavelength division multiplexing networks. IEEE J Select Areas Commun 18(10): 2130\u20132137","journal-title":"IEEE J Select Areas Commun"},{"key":"6_CR52","first-page":"856","volume-title":"ICCSA (2). Lecture notes in computer science, vol 3981","author":"WJ Yoon","year":"2006","unstructured":"Yoon WJ, Kim DH, Chung MY, Lee T-J, Choo H (2006) Routing with maximum EDPs and wavelength assignment with path conflict graphs. In: Gavrilova ML, Gervasi O, Kumar V, Tan CJK, Taniar D, Lagan\u00e0 A, Mun Y, Choo H (eds) ICCSA (2). Lecture notes in computer science, vol 3981. Springer, Heidelberg, pp 856\u2013865"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-008-0006-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12293-008-0006-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-008-0006-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T01:24:05Z","timestamp":1684891445000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12293-008-0006-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2,17]]},"references-count":52,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["6"],"URL":"https:\/\/doi.org\/10.1007\/s12293-008-0006-3","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,2,17]]}}}