{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:39:07Z","timestamp":1759847947289},"reference-count":69,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,6,8]],"date-time":"2011-06-08T00:00:00Z","timestamp":1307491200000},"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,10]]},"DOI":"10.1007\/s12293-011-0059-6","type":"journal-article","created":{"date-parts":[[2011,6,7]],"date-time":"2011-06-07T02:42:30Z","timestamp":1307414550000},"page":"199-216","source":"Crossref","is-referenced-by-count":12,"title":["Memetic cooperative models for the tool switching problem"],"prefix":"10.1007","volume":"3","author":[{"given":"Jhon Edgar","family":"Amaya","sequence":"first","affiliation":[]},{"given":"Carlos","family":"Cotta","sequence":"additional","affiliation":[]},{"given":"Antonio J.","family":"Fern\u00e1ndez-Leiva","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,6,8]]},"reference":[{"key":"59_CR1","first-page":"190","volume-title":"4th international conference on genetic algorithms","author":"WE Hart","year":"1991","unstructured":"Hart WE, Belew RK (1991) Optimizing an arbitrary function is hard for the genetic algorithm. In: Belew RK, Booker LB (eds) 4th international conference on genetic algorithms. Morgan Kaufmann, San Mateo, CA, pp 190\u2013195"},{"issue":"1","key":"59_CR2","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1(1): 67\u201382","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"59_CR3","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1109\/TEVC.2005.857695","volume":"10","author":"P Bonissone","year":"2006","unstructured":"Bonissone P, Subbu R, Eklund N, Kiehl T (2006) Evolutionary algorithms + domain knowledge = real-world evolutionary computation. IEEE Trans Evol Comput 10(3): 256\u2013280","journal-title":"IEEE Trans Evol Comput"},{"key":"59_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-32363-5","volume-title":"Recent advances in memetic algorithms. Studies in fuzziness and soft computing, vol 166","author":"W Hart","year":"2005","unstructured":"Hart W, Krasnogor N, Smith J (2005) Recent advances in memetic algorithms. Studies in fuzziness and soft computing, vol 166. Springer, Berlin"},{"issue":"5","key":"59_CR5","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1109\/TEVC.2005.850260","volume":"9","author":"N Krasnogor","year":"2005","unstructured":"Krasnogor N, Smith J (2005) A tutorial for competent memetic algorithms: model, taxonomy, and design issues. IEEE Trans Evol Comput 9(5): 474\u2013488","journal-title":"IEEE Trans Evol Comput"},{"key":"59_CR6","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, CA"},{"key":"59_CR7","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/0-306-48056-5_5","volume-title":"Handbook of metaheuristics","author":"P Moscato","year":"2003","unstructured":"Moscato P, Cotta C (2003) A gentle introduction to memetic algorithms. In: Glover F, Kochenberger G (eds) Handbook of metaheuristics. Kluwer, Boston, MA, pp 105\u2013144"},{"key":"59_CR8","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"},{"issue":"2","key":"59_CR9","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/MCI.2010.936309","volume":"5","author":"YS Ong","year":"2010","unstructured":"Ong YS, Lim MH, Che X (2010) Memetic computation\u2014past, present and future. IEEE Comput Intell Mag 5(2): 24\u201336","journal-title":"IEEE Comput Intell Mag"},{"key":"59_CR10","first-page":"769","volume-title":"Parallel problem solving from nature VII. Lecture notes in computer science, vol 2439","author":"N Krasnogor","year":"2002","unstructured":"Krasnogor N, Blackburne B, Burke E, Hirst J et\u00a0al (2002) Multimeme algorithms for protein structure prediction. In: Merelo J (eds) Parallel problem solving from nature VII. Lecture notes in computer science, vol 2439. Springer, Berlin, pp 769\u2013778"},{"key":"59_CR11","first-page":"537","volume-title":"Parallel problem solving from nature VII. Lecture notes in computer science, vol 2439","author":"J Smith","year":"2002","unstructured":"Smith J et\u00a0al (2002) Co-evolution of memetic algorithms: initial investigations. In: Merelo J (eds) Parallel problem solving from nature VII. Lecture notes in computer science, vol 2439. Springer, Berlin, pp 537\u2013548"},{"issue":"2","key":"59_CR12","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1023\/B:GENP.0000023687.41210.d7","volume":"5","author":"N Krasnogor","year":"2004","unstructured":"Krasnogor N (2004) Self generating metaheuristics in bioinformatics: the proteins structure comparison case. Genet Program Evolv Mach 5(2): 181\u2013201","journal-title":"Genet Program Evolv Mach"},{"issue":"1","key":"59_CR13","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/B:NACO.0000023419.83147.67","volume":"3","author":"N Krasnogor","year":"2004","unstructured":"Krasnogor N, Gustafson S (2004) A study on the use of \u201cself-generation\u201d in memetic algorithms. Nat Comput 3(1): 53\u201376","journal-title":"Nat Comput"},{"issue":"1","key":"59_CR14","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1109\/TSMCB.2006.883273","volume":"37","author":"J Smith","year":"2007","unstructured":"Smith J (2007) Coevolving memetic algorithms: a review and progress report. IEEE Trans Syst Man Cybern B 37(1): 6\u201317","journal-title":"IEEE Trans Syst Man Cybern B"},{"key":"59_CR15","doi-asserted-by":"crossref","unstructured":"Smith JE (2007) Credit assignment in adaptive memetic algorithms. In: Lipson H (ed) GECCO \u201907: proceedings of the 9th annual conference on genetic and evolutionary computation conference. ACM Press, pp 1412\u20131419","DOI":"10.1145\/1276958.1277219"},{"key":"59_CR16","volume-title":"The selfish gene","author":"R Dawkins","year":"1976","unstructured":"Dawkins R (1976) The selfish gene. Clarendon Press, Oxford"},{"key":"59_CR17","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF01531276","volume":"10","author":"N Radcliffe","year":"1994","unstructured":"Radcliffe N (1994) The algebra of genetic algorithms. Ann Math Artif Intell 10: 339\u2013384","journal-title":"Ann Math Artif Intell"},{"key":"59_CR18","first-page":"1","volume-title":"Evolutionary computing: AISB workshop. Lecture notes in computer science, vol 865","author":"N Radcliffe","year":"1994","unstructured":"Radcliffe N, Surry P (1994) Formal memetic algorithms. In: Fogarty T (eds) Evolutionary computing: AISB workshop. Lecture notes in computer science, vol 865. Springer, Berlin, pp 1\u201316"},{"key":"59_CR19","doi-asserted-by":"crossref","unstructured":"Toulouse M, Crainic TG, Sanso B, Thulasiraman K (1998) Self-organization in cooperative tabu search algorithms. In: Proceedings of the IEEE international conference on systems, man, and cybernetics, vol 3, pp 2379\u20132384","DOI":"10.1109\/ICSMC.1998.725012"},{"key":"59_CR20","first-page":"533","volume-title":"Euro-Par\u201999 parallel processing. Lecture notes in computer science, vol 1685","author":"M Toulouse","year":"1999","unstructured":"Toulouse M, Thulasiraman K, Glover F (1999) Multi-level cooperative search: a new paradigm for combinatorial optimization and an application to graph partitioning. In: Amestoy P, Berger P, Dayd\u00e9 M, Ruiz D, Duff I, Frayss\u00e9 V, Giraud L (eds) Euro-Par\u201999 parallel processing. Lecture notes in computer science, vol 1685. Springer, Berlin, pp 533\u2013542"},{"issue":"6","key":"59_CR21","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1023\/A:1020325926188","volume":"8","author":"TG Crainic","year":"2002","unstructured":"Crainic TG, Gendreau M (2002) Cooperative parallel tabu search for capacitated network design. J Heuristics 8(6): 601\u2013627","journal-title":"J Heuristics"},{"key":"59_CR22","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1023\/B:HEUR.0000026897.40171.1a","volume":"10","author":"TG Crainic","year":"2004","unstructured":"Crainic TG, Gendreau M, Hansen P, Mladenovi\u0107 N (2004) Cooperative parallel variable neighborhood search for the p-median. J Heuristics 10: 293\u2013314","journal-title":"J Heuristics"},{"issue":"7","key":"59_CR23","doi-asserted-by":"crossref","first-page":"1685","DOI":"10.1016\/j.cor.2003.11.023","volume":"32","author":"A LeBouthillier","year":"2005","unstructured":"LeBouthillier A, Crainic TG (2005) A cooperative parallel meta-heuristic for the vehicle routing problem with time windows. Comput Oper Res 32(7): 1685\u20131708","journal-title":"Comput Oper Res"},{"key":"59_CR24","doi-asserted-by":"crossref","first-page":"1849","DOI":"10.1016\/j.ins.2005.06.007","volume":"176","author":"D Pelta","year":"2006","unstructured":"Pelta D, Cruz C, Sancho-Royo A, Verdegay J (2006) Using memory and fuzzy rules in a co-operative multi-thread strategy for optimization. Inf Sci 176: 1849\u20131868","journal-title":"Inf Sci"},{"issue":"1","key":"59_CR25","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.asoc.2007.12.007","volume":"9","author":"C Cruz","year":"2009","unstructured":"Cruz C, Pelta D (2009) Soft computing and cooperative strategies for optimization. Appl Soft Comput 9(1): 30\u201338","journal-title":"Appl Soft Comput"},{"key":"59_CR26","doi-asserted-by":"crossref","unstructured":"Lu S, Sun C (2008) Coevolutionary quantum-behaved particle swarm optimization with hybrid cooperative search. In: Computational intelligence and industrial application, PACIIA \u201908, Pacific-Asia workshop, vol 1, pp 109\u2013113","DOI":"10.1109\/PACIIA.2008.137"},{"issue":"2","key":"59_CR27","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1109\/TSMCB.2003.818432","volume":"34","author":"M Milano","year":"2004","unstructured":"Milano M, Roli A (2004) Magma: a multiagent architecture for metaheuristics. IEEE Trans Syst Man Cybern B 34(2): 925\u2013941","journal-title":"IEEE Trans Syst Man Cybern B"},{"key":"59_CR28","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/978-3-642-03668-2_7","volume-title":"Holonic and multi-agent systems for manufacturing. Lecture notes in computer science, vol 5696","author":"R Malek","year":"2009","unstructured":"Malek R (2009) Collaboration of metaheuristic algorithms through a multi-agent system. In: Mark V, Strasser T, Zoitl A (eds) Holonic and multi-agent systems for manufacturing. Lecture notes in computer science, vol 5696. Springer, Berlin, pp 72\u201381"},{"issue":"2","key":"59_CR29","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/j.ejor.2009.05.033","volume":"202","author":"A Sbihi","year":"2010","unstructured":"Sbihi A (2010) A cooperative local search-based algorithm for the multiple-scenario max- min knapsack problem. Eur J Oper Res 202(2): 339\u2013346","journal-title":"Eur J Oper Res"},{"key":"59_CR30","first-page":"176","volume-title":"PATAT 2000. Lecture notes in computer science, vol 2079","author":"P Cowling","year":"2008","unstructured":"Cowling P, Kendall G, Soubeiga E (2008) A hyperheuristic approach to schedule a sales submit. In: Burke E, Erben W (eds) PATAT 2000. Lecture notes in computer science, vol 2079. Springer, Berlin, pp 176\u2013190"},{"key":"59_CR31","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-540-79438-7_1","volume-title":"Adaptive and multilevel metaheuristics. Studies in computational intelligence, vol 136","author":"K Chakhlevitch","year":"2008","unstructured":"Chakhlevitch K, Cowling P (2008) Hyperheuristics: recent developments. In: Cotta C, Sevaux M, S\u00f6rensen K (eds) Adaptive and multilevel metaheuristics. Studies in computational intelligence, vol 136. Springer, Berlin, pp 3\u201329"},{"key":"59_CR32","unstructured":"Bradwell R, Brown KN (1999) Parallel asynchronous memetic algorithms. In: Evolutionary computation and parallel processing workshop\u2014GECCO 1999, Orlando, FL"},{"issue":"3\u20134","key":"59_CR33","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/S0167-9236(98)00070-0","volume":"24","author":"SN Talukdar","year":"1999","unstructured":"Talukdar SN (1999) Collaboration rules for autonomous software agents. Decis Support Syst 24(3\u20134): 269\u2013278","journal-title":"Decis Support Syst"},{"key":"59_CR34","first-page":"316","volume-title":"Foundations of genetic algorithms","author":"H M\u00fchlenbein","year":"1991","unstructured":"M\u00fchlenbein H (1991) Evolution in time and space\u2014the parallel genetic algorithm. In: Rawlins GJ (eds) Foundations of genetic algorithms. Morgan Kaufmann Publishers, San Fransisco, pp 316\u2013337"},{"key":"59_CR35","first-page":"22","volume-title":"Applications of evolutionary computing. Lecture notes in computer science, vol 2611","author":"C Cotta","year":"2003","unstructured":"Cotta C, Mendes A, Garcia V, Fran\u00e7a P, Moscato P et\u00a0al (2003) Applying memetic algorithms to the analysis of microarray data. In: Raidl G (eds) Applications of evolutionary computing. Lecture notes in computer science, vol 2611. Springer, Berlin, pp 22\u201332"},{"key":"59_CR36","doi-asserted-by":"crossref","unstructured":"Tang J, Lim M, Ong Y, Er M (2004) Study of migration topology in island model parallel hybrid-ga for large scale quadratic assignment problems. In: Control, automation, robotics and vision conference, vol 3, pp 2286\u20132291","DOI":"10.1109\/ICARCV.2004.1469788"},{"key":"59_CR37","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1147\/sj.52.0078","volume":"5","author":"L Belady","year":"1966","unstructured":"Belady L (1966) A study of replacement algorithms for virtual storage computers. IBM Syst J 5: 78\u2013101","journal-title":"IBM Syst J"},{"issue":"4","key":"59_CR38","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1080\/07408178808966195","volume":"20","author":"JF Bard","year":"1988","unstructured":"Bard JF (1988) A heuristic for minimizing the number of tool switches on a flexible machine. IIE Trans 20(4): 382\u2013391","journal-title":"IIE Trans"},{"issue":"5","key":"59_CR39","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1287\/opre.36.5.767","volume":"36","author":"C Tang","year":"1988","unstructured":"Tang C, Denardo E (1988) Models arising from a flexible manufacturing machine, part I: minimization of the number of tool switches. Oper Res 36(5): 767\u2013777","journal-title":"Oper Res"},{"issue":"15","key":"59_CR40","doi-asserted-by":"crossref","first-page":"3547","DOI":"10.1080\/00207540110060888","volume":"39","author":"R Shirazi","year":"2001","unstructured":"Shirazi R, Frizelle G (2001) Minimizing the number of tool switches on a flexible machine: an empirical study. Int J Prod Res 39(15): 3547\u20133560","journal-title":"Int J Prod Res"},{"issue":"1","key":"59_CR41","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1080\/07408170490257871","volume":"36","author":"G Laporte","year":"2004","unstructured":"Laporte G, Salazar-Gonz\u00e1lez J, Semet F (2004) Exact algorithms for the job sequencing and tool switching problem. IIE Trans 36(1): 37\u201345","journal-title":"IIE Trans"},{"key":"59_CR42","unstructured":"Oerlemans A (1992) Production planning for flexible manufacturing systems. PhD dissertation, University of Limburg, Maastricht"},{"key":"59_CR43","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF01324874","volume":"6","author":"Y Crama","year":"1994","unstructured":"Crama Y, Kolen A, Oerlemans A, Spieksma F (1994) Minimizing the number of tool switches on a flexible machine. Int J Flex Manuf Syst 6: 33\u201354","journal-title":"Int J Flex Manuf Syst"},{"key":"59_CR44","first-page":"689","volume":"30","author":"A Hertz","year":"1998","unstructured":"Hertz A, Laporte G, Mittaz M, Stecke K (1998) Heuristics for minimizing tool switches when scheduling part types on a flexible machine. IIE Trans 30: 689\u2013694","journal-title":"IIE Trans"},{"issue":"1\u20133","key":"59_CR45","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0925-5273(99)00055-9","volume":"64","author":"H Djellab","year":"2000","unstructured":"Djellab H, Djellab K, Gourgand M (2000) A new heuristic based on a hypergraph representation for the tool switching problem. Int J Prod Econ 64(1\u20133): 165\u2013176","journal-title":"Int J Prod Econ"},{"key":"59_CR46","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0166-218X(95)00040-X","volume":"65","author":"A Hertz","year":"1993","unstructured":"Hertz A, Widmer M (1993) An improved tabu search approach for solving the job shop scheduling problem with tooling constraints. Discrete Appl Math 65: 319\u2013345","journal-title":"Discrete Appl Math"},{"issue":"1","key":"59_CR47","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0360-8352(02)00183-3","volume":"44","author":"M Al-Fawzan","year":"2003","unstructured":"Al-Fawzan M, Al-Sultan K (2003) A tabu search based algorithm for minimizing the number of tool switches on a flexible machine. Comput Ind Eng 44(1): 35\u201347","journal-title":"Comput Ind Eng"},{"issue":"9\u201310","key":"59_CR48","doi-asserted-by":"crossref","first-page":"876","DOI":"10.1007\/s00170-003-1925-2","volume":"25","author":"BH Zhou","year":"2005","unstructured":"Zhou BH, Xi LF, Cao YS (2005) A beam-search-based algorithm for the tool switching problem on a flexible machine. Int J Adv Manuf Technol 25(9\u201310): 876\u2013882","journal-title":"Int J Adv Manuf Technol"},{"key":"59_CR49","first-page":"190","volume-title":"Hybrid metaheuristics 2008. Lecture notes in computer science, vol 5296","author":"JE Amaya","year":"2008","unstructured":"Amaya JE, Cotta C, Fern\u00e1ndez AJ (2008) A memetic algorithm for the tool switching problem. In: Blesa M, Blum C, Cotta C, Fern\u00e1ndez A, Gallardo J, Roli A, Sampels M (eds) Hybrid metaheuristics 2008. Lecture notes in computer science, vol 5296. Springer, Berlin, pp 190\u2013202"},{"key":"59_CR50","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/978-3-642-12538-6_4","volume-title":"Nature Inspired Cooperative Strategies for Optimization (NICSO 2010). Studies in computational intelligence, vol 284","author":"JE Amaya","year":"2010","unstructured":"Amaya JE, Cotta C, Fern\u00e1ndez AJ (2010) Hybrid cooperation models for the tool switching problem. In: Gonz\u00e1lez J, Pelta D, Cruz C, Terrazas G, Krasnogor N (eds) Nature Inspired Cooperative Strategies for Optimization (NICSO 2010). Studies in computational intelligence, vol 284. Springer, Berlin, pp 39\u201352"},{"issue":"2","key":"59_CR51","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1080\/07408170490245351","volume":"36","author":"M Tzur","year":"2004","unstructured":"Tzur M, Altman A (2004) Minimization of tool switches for a flexible manufacturing machine with slot assignment of different tool sizes. IIE Trans 36(2): 95\u2013110","journal-title":"IIE Trans"},{"issue":"11","key":"59_CR52","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovic","year":"1997","unstructured":"Mladenovic N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24(11): 1097\u20131100","journal-title":"Comput Oper Res"},{"key":"59_CR53","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1023\/A:1006529012972","volume":"13","author":"P Larra\u00f1aga","year":"1999","unstructured":"Larra\u00f1aga P, Kuijpers CMH, Murga RH, Inza I, Dizdarevic S (1999) Genetic algorithms for the travelling salesman problem: A review of representations and operators. Artif Intell Rev 13: 129\u2013170","journal-title":"Artif Intell Rev"},{"issue":"1","key":"59_CR54","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1162\/evco.1998.6.1.25","volume":"6","author":"C Cotta","year":"1998","unstructured":"Cotta C, Troya J (1998) Genetic forma recombination in permutation flowshop problems. Evol Comput 6(1): 25\u201344","journal-title":"Evol Comput"},{"issue":"2","key":"59_CR55","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1109\/TEVC.2003.819944","volume":"8","author":"YS Ong","year":"2004","unstructured":"Ong YS, Keane A (2004) Meta-lamarckian learning in memetic algorithms. IEEE Trans Evol Comput 8(2): 99\u2013110","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"59_CR56","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 K (2006) Classification of adaptive memetic algorithms: a comparative study. IEEE Trans Syst Man Cybern B 36(1): 141\u2013152","journal-title":"IEEE Trans Syst Man Cybern B"},{"key":"59_CR57","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1007\/s00500-006-0139-6","volume":"11","author":"J Tang","year":"2007","unstructured":"Tang J, Lim M, Ong Y (2007) Diversity-adaptive parallel memetic algorithm for solving large scale combinatorial optimization problems. Soft Comput 11: 873\u2013888","journal-title":"Soft Comput"},{"issue":"3","key":"59_CR58","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s10489-007-0069-8","volume":"27","author":"F Neri","year":"2007","unstructured":"Neri F, Toivanen J, M\u00e4kinen RAE (2007) An adaptive evolutionary algorithm with intelligent mutation local searchers for designing multidrug therapies for hiv. Appl Intell 27(3): 219\u2013235","journal-title":"Appl Intell"},{"issue":"1","key":"59_CR59","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/TSMCB.2006.883271","volume":"37","author":"A Caponio","year":"2007","unstructured":"Caponio A, Cascella GL, Neri F, Salvatore N, Sumner M (2007) A fast adaptive memetic algorithm for online and offline control design of pmsm drives. IEEE Trans Syst Man Cybern B 37(1): 28\u201341","journal-title":"IEEE Trans Syst Man Cybern B"},{"issue":"4","key":"59_CR60","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1162\/evco.2008.16.4.529","volume":"16","author":"V Tirronen","year":"2008","unstructured":"Tirronen V, Neri F, K\u00e4rkk\u00e4inen T, Majava K, Rossi T (2008) An enhanced memetic differential evolution in filter design for defect detection in paper production. Evol Comput 16(4): 529\u2013555","journal-title":"Evol Comput"},{"issue":"8\u20139","key":"59_CR61","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1007\/s00500-008-0357-1","volume":"13","author":"A Caponio","year":"2009","unstructured":"Caponio A, Neri F, Tirronen V (2009) Super-fit control adaptation in memetic differential evolution frameworks. Soft Comput 13(8\u20139): 811\u2013831","journal-title":"Soft Comput"},{"issue":"1","key":"59_CR62","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10852-005-9029-7","volume":"5","author":"EG Talbi","year":"2006","unstructured":"Talbi EG, Bachelet V (2006) Cosearch: A parallel cooperative metaheuristic. J Math Model Algorithms 5(1): 5\u201322","journal-title":"J Math Model Algorithms"},{"key":"59_CR63","volume-title":"Nonparametrics: statistical methods based on ranks","author":"E Lehmann","year":"1998","unstructured":"Lehmann E, D\u2019Abrera H (1998) Nonparametrics: statistical methods based on ranks. Prentice-Hall, Englewood Cliffs, NJ"},{"issue":"200","key":"59_CR64","doi-asserted-by":"crossref","first-page":"675","DOI":"10.2307\/2279372","volume":"32","author":"M Friedman","year":"1937","unstructured":"Friedman M (1937) The use of ranks to avoid the assumption of normality implicit in the analysis of variance. J Am Stat Assoc 32(200): 675\u2013701","journal-title":"J Am Stat Assoc"},{"key":"59_CR65","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1080\/03610928008827904","volume":"9","author":"R Iman","year":"1980","unstructured":"Iman R, Davenport J (1980) Approximations of the critical region of the Friedman statistic. Commun Stat 9: 571\u2013595","journal-title":"Commun Stat"},{"key":"59_CR66","first-page":"65","volume":"6","author":"S Holm","year":"1979","unstructured":"Holm S (1979) A simple sequentially rejective multiple test procedure. Scand J Stat 6: 65\u201370","journal-title":"Scand J Stat"},{"key":"59_CR67","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1023\/A:1008358805991","volume":"12","author":"E Alba","year":"2000","unstructured":"Alba E, Troya JM (2000) Influence of the migration policy in parallel distributed gas with structured and panmictic populations. Appl Intell 12: 163\u2013181","journal-title":"Appl Intell"},{"key":"59_CR68","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/11428589_4","volume-title":"Self-star properties in complex information systems. Lecture notes in computer science, vol 3460","author":"W Krause","year":"2005","unstructured":"Krause W, Sollacher R, Greiner M et\u00a0al (2005) Self-* topology control in wireless multihop ad hoc communciations networks. In: Babaoglu O (eds) Self-star properties in complex information systems. Lecture notes in computer science, vol 3460. Springer, Berlin, pp 49\u201362"},{"key":"59_CR69","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/978-3-540-79438-7_2","volume-title":"Adaptive and multilevel metaheuristics. Studies in computational intelligence, vol 136","author":"JE Smith","year":"2008","unstructured":"Smith JE (2008) Self-adaptation in evolutionary algorithms for combinatorial optimisation. In: Cotta C, Sevaux M, S\u00f6rensen K (eds) Adaptive and multilevel metaheuristics. Studies in computational intelligence, vol 136. Springer, Berlin, pp 31\u201357"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-011-0059-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12293-011-0059-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-011-0059-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T09:14:45Z","timestamp":1560244485000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12293-011-0059-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,8]]},"references-count":69,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["59"],"URL":"https:\/\/doi.org\/10.1007\/s12293-011-0059-6","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,8]]}}}