{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:14:37Z","timestamp":1740168877014,"version":"3.37.3"},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,6,10]],"date-time":"2010-06-10T00:00:00Z","timestamp":1276128000000},"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":[[2011,3]]},"DOI":"10.1007\/s12293-010-0044-5","type":"journal-article","created":{"date-parts":[[2010,6,9]],"date-time":"2010-06-09T04:44:29Z","timestamp":1276058669000},"page":"33-49","source":"Crossref","is-referenced-by-count":16,"title":["Parallel hyperheuristics for the frequency assignment problem"],"prefix":"10.1007","volume":"3","author":[{"given":"Carlos","family":"Segura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gara","family":"Miranda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Coromoto","family":"Le\u00f3n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,6,10]]},"reference":[{"issue":"1","key":"44_CR1","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s10479-007-0178-0","volume":"153","author":"KI Aardal","year":"2007","unstructured":"Aardal KI, van Hoesel SPM, Koster AMCA, Mannino C, Sassano A (2007) Models and solution techniques for frequency assignment problems. Ann Oper Res 153(1): 79\u2013129","journal-title":"Ann Oper Res"},{"key":"44_CR2","doi-asserted-by":"crossref","DOI":"10.1002\/0471739383","volume-title":"Parallel metaheuristics: a new class of algorithms","author":"E Alba","year":"2005","unstructured":"Alba E (2005) Parallel metaheuristics: a new class of algorithms. Wiley-Interscience, London"},{"key":"44_CR3","unstructured":"Amaldi E, Capone A, Malucelli F, Mannino C (2006) Handbook of optimization in telecommunications, chap optimization problems and models for planning cellular networks. Springer, Berlin, pp 917\u2013939"},{"key":"44_CR4","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/978-3-540-79438-7_3","volume-title":"Adaptive and multilevel metaheuristics,studies in computational intelligence vol 136","author":"I Araya","year":"2008","unstructured":"Araya I, Neveu B, Riff MC (2008) An efficient hyperheuristic for strip-packing problems. In: Cotta C, S\u00f6rensen K (eds) Adaptive and multilevel metaheuristics,studies in computational intelligence vol 136. Springer, Berlin, pp 61\u201376"},{"key":"44_CR5","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/s101070100247","volume":"91","author":"A Avenali","year":"2002","unstructured":"Avenali A, Mannino C, Sassano A (2002) Minimizing the span of d-walks to compute optimum frequency assignments. Math Program A 91: 357\u2013374","journal-title":"Math Program A"},{"issue":"3","key":"44_CR6","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/s12293-009-0022-y","volume":"1","author":"MB Bader-El-Den","year":"2009","unstructured":"Bader-El-Den MB, Poli R, Fatima S (2009) Evolving timetabling heuristics using a grammar-based genetic programming hyper- heuristic framework. Memetic Comput 1(3): 205\u2013219","journal-title":"Memetic Comput"},{"issue":"1","key":"44_CR7","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/S0305-0548(03)00210-7","volume":"32","author":"P Bjorklund","year":"2005","unstructured":"Bjorklund P, Varbrand P, Yuan D (2005) Optimized planning of frequency hopping in cellular networks. Comput Oper Res 32(1): 169\u2013186","journal-title":"Comput Oper Res"},{"key":"44_CR8","doi-asserted-by":"crossref","unstructured":"Burke E, Kendall G, Silva JL, O\u2019Brien R, Soubeiga E (2005) An Ant algorithm hyperheuristic for the project presentation scheduling problem. In: Proceedings of the 2005 IEEE congress on evolutionary computation (CEC 2005), vol 3. Edinburgh, Scotland, pp 2263\u20132270","DOI":"10.1109\/CEC.2005.1554976"},{"key":"44_CR9","volume-title":"Handbook of Meta-heuristics. Hyper-heuristics: an emerging direction in modern search technology","author":"EK Burke","year":"2003","unstructured":"Burke EK, Kendall G, Newall J, Hart E, Ross P, Schulenburg S (2003) Handbook of Meta-heuristics. Hyper-heuristics: an emerging direction in modern search technology. Kluwer, Dordrecht"},{"issue":"6","key":"44_CR10","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1023\/B:HEUR.0000012446.94732.b6","volume":"9","author":"EK Burke","year":"2003","unstructured":"Burke EK, Kendall G, Soubeiga E (2003) A Tabu-search hyperheuristic for timetabling and rostering. J. Heuristics 9(6): 451\u2013470","journal-title":"J. Heuristics"},{"issue":"1","key":"44_CR11","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.ejor.2005.08.012","volume":"176","author":"EK Burke","year":"2007","unstructured":"Burke EK, McCollum B, Meisels A, Petrovic S, Qu R (2007) A graph-based hyper-heuristic for educational timetabling problems. Eur J Oper Res 176(1): 177\u2013192","journal-title":"Eur J Oper Res"},{"key":"44_CR12","unstructured":"Cant\u00fa-Paz E (1998) A survey of parallel genetic algorithms. Calc Paralleles 10"},{"key":"44_CR13","doi-asserted-by":"crossref","unstructured":"Chen PC, Kendall G, Vanden Berghe G (2007) An ant based hyper-heuristic for the travelling tournament problem. In: Proceedings of IEEE symposium of computational intelligence in scheduling (CISched 2007). Honolulu, Hawaii, pp 19\u201326","DOI":"10.1109\/SCIS.2007.367665"},{"key":"44_CR14","doi-asserted-by":"crossref","unstructured":"Cowling P, Kendall G, Han L (2002) An investigation of a hyperheuristic genetic algorithm applied to a trainer scheduling problem. In: Proceedings of the 2002 IEEE congress on evolutionary computation (CEC 2002). IEEE Computer Society, Honolulu Hawaii, pp 1185\u20131190","DOI":"10.1109\/CEC.2002.1004411"},{"key":"44_CR15","unstructured":"Cowling P, Kendall G, Soubeiga E (2001) A parameter-free hyperheuristic for scheduling a sales summit. In: Proceedings of 4th metahuristics international conference (MIC 2001). Porto Portugal, pp 127\u2013131"},{"key":"44_CR16","first-page":"851","volume-title":"PPSN lecture notes in computer science, vol 2439","author":"PI Cowling","year":"2002","unstructured":"Cowling PI, Kendall G, Soubeiga E (2002) Hyperheuristics: a robust optimisation method applied to nurse scheduling. In: Guerv\u00f3s JJM, Adamidis P, Beyer HG, Mart\u00edn JLFV, Schwefel HP (eds) PPSN lecture notes in computer science, vol 2439. Springer, Berlin, pp 851\u2013860"},{"key":"44_CR17","first-page":"1","volume":"7","author":"J Dems\u0306ar","year":"2006","unstructured":"Dems\u0306ar J (2006) Statistical comparison of classifiers over multiple data sets. J Machine Learn Res 7: 1\u201330","journal-title":"J Machine Learn Res"},{"issue":"1","key":"44_CR18","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo M, Maniezzo V, Colorni A (1996) The ant system: Optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern Part B 26(1): 29\u201341","journal-title":"IEEE Trans Syst Man Cybern Part B"},{"issue":"3","key":"44_CR19","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1016\/j.ejor.2005.03.058","volume":"179","author":"K Dowsland","year":"2007","unstructured":"Dowsland K, Soubeiga E, Burke E (2007) A simulated annealing hyper-heuristic for determining shipper sizes. Eur J Oper Res 179(3): 759\u2013774","journal-title":"Eur J Oper Res"},{"key":"44_CR20","unstructured":"Eisenbl\u00e4tter A (2001) Frequency assignment in GSM networks: Models, heuristics, and lower bounds. Ph.D. thesis, Technische Universit\u00e4t Berlin"},{"issue":"1","key":"44_CR21","doi-asserted-by":"crossref","first-page":"51","DOI":"10.7151\/dmgt.1158","volume":"22","author":"A Eisenbl\u00e4tter","year":"2002","unstructured":"Eisenbl\u00e4tter A, Gr\u00f6tschel M, Koster AMCA (2002) Frequency planning and ramifications of coloring. Discuss Math Graph Theory 22(1): 51\u201388","journal-title":"Discuss Math Graph Theory"},{"issue":"2","key":"44_CR22","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0377-2217(99)00254-4","volume":"123","author":"M Fischetti","year":"2000","unstructured":"Fischetti M, Lepsch C, Minerva G, Romanin-Jacur G, Toto E (2000) Frequency assignment in mobile radio systems using branch-and-cut techniques. Eur J Oper Res 123(2): 241\u2013255","journal-title":"Eur J Oper Res"},{"key":"44_CR23","doi-asserted-by":"crossref","unstructured":"Furuskar A, Naslund J, Olofsson H (1999) EDGE\u2014enhanced data rates for GSM and TDMA\/136 evolution. Ericsson Rev (1)","DOI":"10.1109\/98.772978"},{"issue":"1","key":"44_CR24","first-page":"34","volume":"1","author":"P Garg","year":"2009","unstructured":"Garg P (2009) A comparison between memetic algorithm and genetic algorithm for the cryptanalysis of simplified data encryption standard algorithm. Int J Netw Secur Appl 1(1): 34\u201342","journal-title":"Int J Netw Secur Appl"},{"key":"44_CR25","first-page":"3","volume-title":"In: AE \u201997: Selected papers from the third european conference on artificial evolution","author":"F Glover","year":"1998","unstructured":"Glover F (1998) A template for scatter search and path relinking. In: (eds) In: AE \u201997: Selected papers from the third european conference on artificial evolution. Springer, London, pp 3\u201354"},{"key":"44_CR26","unstructured":"Granbohm H, Wiklund J (1999) GPRS\u2014general packet radio service. Ericsson Rev (1)"},{"key":"44_CR27","doi-asserted-by":"crossref","unstructured":"Gratch J, Chien S (1993) Learning search control knowledge for the deep space network scheduling problem. Tech. rep., Champaign, IL, USA","DOI":"10.1016\/B978-1-55860-307-3.50024-1"},{"issue":"8","key":"44_CR28","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1080\/08839510490497058","volume":"18","author":"JY Greff","year":"2004","unstructured":"Greff JY, Idoumghar L, Schott R (2004) Application of markov decision processes to the frequency assignment problem. Appl Artif Intell 18(8): 761\u2013773","journal-title":"Appl Artif Intell"},{"issue":"12","key":"44_CR29","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"68","author":"WK Hale","year":"1980","unstructured":"Hale WK (1980) Frequency assignment: theory and applications. Proc IEEE 68(12): 1497\u20131514","journal-title":"Proc IEEE"},{"key":"44_CR30","unstructured":"Hoos HH (1999) On the run-time behavior of stochastic local search algorithms for SAT. In: Proceedings of AAAI\u201999. MIT Press, pp 661\u2013666"},{"key":"44_CR31","doi-asserted-by":"crossref","unstructured":"Idoumghar L, Schott R (2006) A new hybrid GA-MDP algorithm for the frequency assignment problem. In: Proceedings of the 18th IEEE international conference on tools with artificial intelligence (ICTAI\u201906), pp 18\u201325","DOI":"10.1109\/ICTAI.2006.18"},{"key":"44_CR32","unstructured":"Jaumard B, Marcotte O, Meyer C (1999) Telecommunications network planning, chap, mathematical models and exact methods for channel assignment in cellular networks. Kluwer, UK, pp 239\u2013256"},{"key":"44_CR33","unstructured":"Kendall G, Cowling P, Soubeiga E (2002) Choice function and random hyperheuristics. In: Proceedings of the 4th Asia-Pacific conference on simulated evolution and learning (SEAL 2002). Singapore, pp 667\u2013671"},{"key":"44_CR34","doi-asserted-by":"crossref","unstructured":"Kendall G, Mohamad M (2004) Channel assignment in cellular communication using a great deluge hyper-heuristic. In: Proceedings of the 2004 IEEE international conference on networks (ICON). Singapore, pp 769\u2013773","DOI":"10.1109\/ICON.2004.1409283"},{"key":"44_CR35","unstructured":"Kendall G, Mohamad M (2004) Channel assignment optimisation using a hyper-heuristic. In: Proceedings of the 2004 IEEE conference on cybernetics and intelligent systems (CIS 2004). Singapore, pp 790\u2013795 (2004)"},{"key":"44_CR36","doi-asserted-by":"crossref","first-page":"1842","DOI":"10.1016\/j.cor.2005.05.038","volume":"34","author":"SS Kim","year":"2007","unstructured":"Kim SS, Smith AE, Lee JH (2007) A memetic algorithm for channel assignment in wireless FDMA systems. Comput Oper Res 34: 1842\u20131856","journal-title":"Comput Oper Res"},{"key":"44_CR37","unstructured":"Kuurne AMJ (2002) On GSM mobile measurement based interference matrix generation. In: IEEE 55th vehicular technology conference. VTC Spring 2002, pp 1965\u20131969"},{"issue":"3","key":"44_CR38","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s12293-009-0016-9","volume":"1","author":"MN Le","year":"2009","unstructured":"Le MN, Ong YS, Jin Y, Sendhoff B (2009) Lamarckian memetic algorithms: local optimum and connectivity structure analysis. Memetic Comput 1(3): 175\u2013190","journal-title":"Memetic Comput"},{"key":"44_CR39","volume-title":"Methods and algorithms for radio channel assignment. Oxford lecture series in mathematics and its applications","author":"R Leese","year":"2002","unstructured":"Leese R, Hurley S (2002) Methods and algorithms for radio channel assignment. Oxford lecture series in mathematics and its applications. Oxford University Press, New York"},{"key":"44_CR40","doi-asserted-by":"crossref","unstructured":"Le\u00f3n C, Miranda G, Segredo E, Segura C (2008) Parallel hypervolume-guided hyperheuristic for adapting the multi-objective evolutionary island model. In: International workshop on nature inspired cooperative strategies for optimization, studies in computational intelligence. Springer, Berlin","DOI":"10.1007\/978-3-642-03211-0_22"},{"key":"44_CR41","doi-asserted-by":"crossref","unstructured":"Le\u00f3n C, Miranda G, Segura C (2007) Parallel skeleton for multi-objective optimization. In: Genetic and evolutionary computation conference. ACM, London, p 906","DOI":"10.1145\/1276958.1277136"},{"key":"44_CR42","doi-asserted-by":"crossref","unstructured":"Leon C, Miranda G, Segura C (2009) A memetic algorithm and a parallel hyperheuristic island-based model for a 2d packing problem. In: GECCO\u201909: Proceedings of the 11th annual conference on genetic and evolutionary computation. ACM, New York, pp 1371\u20131378","DOI":"10.1145\/1569901.1570085"},{"key":"44_CR43","doi-asserted-by":"crossref","unstructured":"Le\u00f3n C, Miranda G, Segura C (2009) METCO: a parallel plugin-based framework for multi-objective optimization. Int J Artif Intell Tools 18(4)","DOI":"10.1142\/S0218213009000275"},{"key":"44_CR44","doi-asserted-by":"crossref","unstructured":"Luna F, Blum C, Alba E, Nebro AJ (2007) ACO vs EAs for solving a real-world frequency assignment problem in GSM networks. In: Genetic and evolutionary computation conference (GECCO 2007), pp 94\u2013101","DOI":"10.1145\/1276958.1276972"},{"key":"44_CR45","doi-asserted-by":"crossref","unstructured":"Luna F, Est\u00e9banez C, Le\u00f3n C, Chaves-Gonz\u00e1lez JM, Alba E, Aler R, Segura C, Vega-Rodr\u00edguez MA, Nebro AJ, Valls JM, Miranda G, G\u00f3mez-Pulido JA (2008) Metaheuristics for solving a real-world frequency assignment problem in gsm networks. In: Conference on genetic and evolutionary computation (GECCO 2008), pp 1579\u20131586","DOI":"10.1145\/1389095.1389396"},{"issue":"11","key":"44_CR46","doi-asserted-by":"crossref","first-page":"1067","DOI":"10.1080\/03052150802294581","volume":"40","author":"F Luna","year":"2008","unstructured":"Luna F, Nebro AJ, Alba E, Durillo JJ (2008) Solving large-scale real-world telecommunication problems using a grid-based genetic algorithm. Eng Optim 40(11): 1067\u20131084","journal-title":"Eng Optim"},{"issue":"1","key":"44_CR47","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.orl.2006.01.009","volume":"35","author":"C Mannino","year":"2007","unstructured":"Mannino C, Oriolo G, Ricci F, Chandran S (2007) The stable set problem and the thinness of a graph. Oper Res Lett 35(1): 1\u20139","journal-title":"Oper Res Lett"},{"key":"44_CR48","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0166-218X(02)00239-1","volume":"129","author":"C Mannino","year":"2003","unstructured":"Mannino C, Sassano A (2003) An enumerative algorithm for the frequency assignment problem. Discrete Appl Math 129: 155\u2013169","journal-title":"Discrete Appl Math"},{"issue":"4","key":"44_CR49","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1002\/scj.10328","volume":"36","author":"S Matsui","year":"2005","unstructured":"Matsui S, Watanabe I, Tokoro KI (2005) Application of the parameter-free genetic algorithm to the fixed channel assignment problem. Syst Comput Jpn 36(4): 71\u201381","journal-title":"Syst Comput Jpn"},{"key":"44_CR50","unstructured":"Metzger BH (1970) Spectrum management technique. In: 38th national ORSA meeting"},{"key":"44_CR51","volume-title":"The GSM system for mobile communications","author":"M Mouly","year":"1992","unstructured":"Mouly M, Paulet MB (1992) The GSM system for mobile communications. Mouly et Paulet, Palaiseau"},{"issue":"1","key":"44_CR52","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1109\/TSMCB.2005.856143","volume":"36","author":"YS Ong","year":"2006","unstructured":"Ong YS, Lim MH, Zhu N, Wong KW (2006) Classification of adaptive memetic algorithms: a comparative study. IEEE Trans Syst Man Cybern Part B 36(1): 141\u2013152","journal-title":"IEEE Trans Syst Man Cybern Part B"},{"key":"44_CR53","volume-title":"Numerical recipes in C: the art of scientific computing","author":"WH Press","year":"1992","unstructured":"Press WH, Flannery BP, Teukolsky SA, Vetterling WT (1992) Numerical recipes in C: the art of scientific computing. Cambridge University Press, Cambridge"},{"issue":"1","key":"44_CR54","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1109\/98.350861","volume":"2","author":"J Rapeli","year":"1995","unstructured":"Rapeli J (1995) UMTS: targets, system concept, and standardization in a global framework. IEEE Pers Commun 2(1): 30\u201337","journal-title":"IEEE Pers Commun"},{"key":"44_CR55","doi-asserted-by":"crossref","first-page":"2671","DOI":"10.1016\/j.cor.2004.03.020","volume":"32","author":"S Salcedo-Sanz","year":"2005","unstructured":"Salcedo-Sanz S, Bouso\u00f1o-Calz\u00f3n C (2005) A portable and scalable algorithm for a class of constrained combinatorial optimization problems. Comput Oper Res 32: 2671\u20132687","journal-title":"Comput Oper Res"},{"key":"44_CR56","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/978-3-642-01020-0_26","volume-title":"5th international conference devoted to evolutionary multi-criterion optimization, vol 5467","author":"C Segura","year":"2009","unstructured":"Segura C, Cervantes A, Nebro AJ, Jaraz-Simn MD, Segredo E, Garca S, Luna F, Gmez-Pulido JA, Miranda G, Luque C, Alba E, Vega-Rodrguez MA, Len C, Galvfn I (2009) Optimizing the DFCN broadcast protocol with a parallel cooperative strategy of multi-objective evolutionary algorithms. In: Springer (eds) 5th international conference devoted to evolutionary multi-criterion optimization, vol 5467. Nantes, France, pp 305\u2013319"},{"key":"44_CR57","doi-asserted-by":"crossref","DOI":"10.1201\/9781420036268","volume-title":"Handbook of parametric and nonparametric statistical procedures","author":"DJ Sheskin","year":"2003","unstructured":"Sheskin DJ (2003) Handbook of parametric and nonparametric statistical procedures. CRC Press, Boca Raton"},{"key":"44_CR58","volume-title":"Digital communication over fading channels: a unified approach to performance analysis","author":"MK Simon","year":"2005","unstructured":"Simon MK, Alouini MS (2005) Digital communication over fading channels: a unified approach to performance analysis. Wiley, London"},{"key":"44_CR59","doi-asserted-by":"crossref","DOI":"10.1002\/0470053925","volume-title":"Parallel Combinatorial Optimization (Wiley Series on Parallel and Distributed Computing)","author":"EG Talbi","year":"2006","unstructured":"Talbi EG (2006) Parallel Combinatorial Optimization (Wiley Series on Parallel and Distributed Computing). Wiley-Interscience, London"},{"key":"44_CR60","unstructured":"Terashima-Marn H, Ross P (1999) Evolution of constraint satisfaction strategies in examination timetabling. In: Proceedings of the genetic and evolutionary computation conference (GECCO99). Morgan Kaufmann, pp 635\u2013642"},{"issue":"2","key":"44_CR61","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1109\/TEVC.2003.810751","volume":"7","author":"DAV Veldhuizen","year":"2003","unstructured":"Veldhuizen DAV, Zydallis JB, Lamont GB (2003) Considerations in engineering parallel multiobjective evolutionary algorithms. IEEE Trans Evol Comput 7(2): 144\u2013173","journal-title":"IEEE Trans Evol Comput"},{"key":"44_CR62","unstructured":"Vink T, Izzo D (2007) Learning the best combination of solvers in a distributed global optimization environment. In: Proceedings of advances in global optimization: methods and applications (AGO). Mykonos, Greece, pp 13\u201317"},{"issue":"2","key":"44_CR63","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(98)00099-X","volume":"113","author":"C Voudouris","year":"1999","unstructured":"Voudouris C, Tsang E (1999) Guided local search. Eur J Oper Res 113(2): 449\u2013499","journal-title":"Eur J Oper Res"},{"key":"44_CR64","volume-title":"Mobile radio networks: networking, protocols and traffic performance","author":"BH Walke","year":"2002","unstructured":"Walke BH (2002) Mobile radio networks: networking, protocols and traffic performance. Wiley, London"},{"issue":"1","key":"44_CR65","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D Wolpert","year":"1997","unstructured":"Wolpert D, Macready W (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1(1): 67\u201382","journal-title":"IEEE Trans Evol Comput"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-010-0044-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12293-010-0044-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-010-0044-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T19:52:20Z","timestamp":1740167540000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12293-010-0044-5"}},"subtitle":["Special issue on nature inspired cooperative strategies for optimization"],"short-title":[],"issued":{"date-parts":[[2010,6,10]]},"references-count":65,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["44"],"URL":"https:\/\/doi.org\/10.1007\/s12293-010-0044-5","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"type":"print","value":"1865-9284"},{"type":"electronic","value":"1865-9292"}],"subject":[],"published":{"date-parts":[[2010,6,10]]}}}