{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:11:58Z","timestamp":1759666318276},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,9,1]],"date-time":"2009-09-01T00:00:00Z","timestamp":1251763200000},"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,11]]},"DOI":"10.1007\/s12293-009-0013-z","type":"journal-article","created":{"date-parts":[[2009,8,31]],"date-time":"2009-08-31T09:32:13Z","timestamp":1251711133000},"page":"191-203","source":"Crossref","is-referenced-by-count":10,"title":["Selecting survivors in genetic algorithm using tabu search strategies"],"prefix":"10.1007","volume":"1","author":[{"given":"Chuan-Kang","family":"Ting","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheng-Feng","family":"Ko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chih-Hui","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,9,1]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1016\/S0377-2217(97)00286-5","volume":"106","author":"S Abdinnour-Helm","year":"1998","unstructured":"Abdinnour-Helm S (1998) A hybrid heuristic for the uncapacitated hub location problem. Eur J Oper Res 106: 489\u2013499","journal-title":"Eur J Oper Res"},{"key":"13_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-1997-9","volume-title":"A connectionist machine for genetic Hillclimbing","author":"DH Ackley","year":"1987","unstructured":"Ackley DH (1987) A connectionist machine for genetic Hillclimbing. Kluwer, Boston"},{"issue":"2","key":"13_CR3","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/s12293-009-0010-2","volume":"1","author":"C Aranha","year":"2009","unstructured":"Aranha C, Iba H (2009) The memetic tree-based genetic algorithm and its application to portfolio optimization. Memetic Comput 1(2): 139\u2013151","journal-title":"Memetic Comput"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Bersini H, Dorigo M, Langerman S, Seront G, Gambardella L (1996) Results of the first international contest on evolutionary optimisation. In: Proceedings of the Third IEEE conference on evolutionary computation, pp 611\u2013615","DOI":"10.1109\/ICEC.1996.542670"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Chin AJ, Kit HW, Lim A (1999) A new GA approach for the vehicle routing problem. In: Proceedings of the 11th IEEE international conference on tools with artificial intelligence, pp 307\u2013310","DOI":"10.1109\/TAI.1999.809805"},{"key":"13_CR6","unstructured":"De Jong K (1975) An analysis of the behavior of a class of genetic adaptive systems. Ph.D. thesis, University of Michigan"},{"key":"13_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-05094-1","volume-title":"Introduction to evolutionary computing. Natural Computing","author":"AE Eiben","year":"2003","unstructured":"Eiben AE, Smith JE (2003) Introduction to evolutionary computing. Natural Computing. Springer, Heidelberg"},{"issue":"12","key":"13_CR8","doi-asserted-by":"crossref","first-page":"1351","DOI":"10.1080\/15325000590964254","volume":"33","author":"M Gandomkar","year":"2005","unstructured":"Gandomkar M, Vakilian M, Ehsan M (2005) A genetic-based tabu search algorithm for optimal DG allocation in distribution networks. Elect Power Compon Syst 33(12): 1351\u20131361","journal-title":"Elect Power Compon Syst"},{"issue":"1","key":"13_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0305-0548(93)E0023-M","volume":"22","author":"F Glover","year":"1995","unstructured":"Glover F, Kelly JP, Laguna M (1995) Genetic algorithms and tabu search: hybrid for optimization. Computers Ops Res 22(1): 1\u2013134","journal-title":"Computers Ops Res"},{"key":"13_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F Glover","year":"1997","unstructured":"Glover F, Languna M (1997) Tabu search. Kluwer, Boston"},{"issue":"1","key":"13_CR11","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF00933356","volume":"34","author":"AO Griewank","year":"1981","unstructured":"Griewank AO (1981) Generalized descent for global optimization. J Optim Theory Appl 34(1): 11\u201339","journal-title":"J Optim Theory Appl"},{"key":"13_CR12","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0003-2670(03)00753-0","volume":"490","author":"JA Hageman","year":"2003","unstructured":"Hageman JA, Wehrens R, van Sprang HA, Buydens LMC (2003) Hybrid genetic algorithm-tabu search approach for optimising multilayer optical coatings. Anal Chim Acta 490: 211\u2013222","journal-title":"Anal Chim Acta"},{"key":"13_CR13","unstructured":"Handa K, Kuga S (1995) Pollycell placement for analog lsi chip designs by genetic algorithms and tabu search. In: IEEE int. conf. evol. comput., pp 716\u2013721"},{"key":"13_CR14","volume-title":"Recent advances in memetic algorithms","author":"WE Hart","year":"2004","unstructured":"Hart WE, Krasnogor N, Smith JE (2004) Recent advances in memetic algorithms. Springer, Heidelberg"},{"issue":"1","key":"13_CR15","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s12293-008-0004-5","volume":"1","author":"SMK Hasan","year":"2009","unstructured":"Hasan SMK, Sarker R, Essam D, Cornforth D (2009) Memetic algorithms for solving job-shop scheduling problems. Memetic Comput 1(1): 69\u201383","journal-title":"Memetic Comput"},{"key":"13_CR16","volume-title":"Adaptation in natural and artificial systems","author":"J Holland","year":"1975","unstructured":"Holland J (1975) Adaptation in natural and artificial systems. University of Michigan Press, Michigan"},{"issue":"2","key":"13_CR17","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1109\/TEVC.2003.810752","volume":"7","author":"H Ishibuchi","year":"2003","unstructured":"Ishibuchi H, Yoshida T, Murata T (2003) Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE Trans Evol Comput 7(2): 204\u2013223","journal-title":"IEEE Trans Evol Comput"},{"issue":"8","key":"13_CR18","doi-asserted-by":"crossref","first-page":"4592","DOI":"10.1063\/1.1592796","volume":"119","author":"T Jiang","year":"2003","unstructured":"Jiang T, Cui Q, Shi G, Ma S (2003) Protein folding simulations of the hydrophobic\u2013hydrophilic model by combining tabu search with genetic algorithms. J Chem Phys 119(8): 4592\u20134596","journal-title":"J Chem Phys"},{"key":"13_CR19","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/S0377-2217(99)00168-X","volume":"124","author":"CF Liaw","year":"2000","unstructured":"Liaw CF (2000) A hybrid genetic algorithm for the open shop scheduling problem. Eur J Oper Res 124: 28\u201342","journal-title":"Eur J Oper Res"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Nara K (1997) Genetic algorithm for power systems planning. In: Proceedings of the fourth international conference on advances in power system control, operation and management, pp 11\u201314","DOI":"10.1049\/cp:19971805"},{"issue":"2","key":"13_CR21","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s12293-009-0008-9","volume":"1","author":"F Neri","year":"2009","unstructured":"Neri F, Tirronen V (2009) Scale factor local search in differential evolution. Memetic Comput 1(2): 153\u2013171","journal-title":"Memetic Comput"},{"issue":"1","key":"13_CR22","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 Cybern 36(1): 141\u2013152","journal-title":"IEEE Trans Syst Man Cybern Part B Cybern"},{"key":"13_CR23","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1016\/S0377-2217(97)00269-5","volume":"110","author":"L Ozdamar","year":"1998","unstructured":"Ozdamar L, Birbil SI (1998) Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions. Eur J Oper Res 110: 525\u2013547","journal-title":"Eur J Oper Res"},{"key":"13_CR24","volume-title":"Systems of extremal control","author":"LA Rastrigin","year":"1974","unstructured":"Rastrigin LA (1974) Systems of extremal control. Nauka, Moscow"},{"key":"13_CR25","unstructured":"Gerhard Reinelt. TSPLIB http:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software\/TSPLIB95\/ (1995)"},{"key":"13_CR26","volume-title":"Numerical optimization of computer models","author":"HP Schwefel","year":"1981","unstructured":"Schwefel HP (1981) Numerical optimization of computer models. Wiley, New York"},{"key":"13_CR27","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/j.epsr.2004.01.016","volume":"71","author":"DJ Shin","year":"2004","unstructured":"Shin DJ, Kim JO, Kim KT, Choo JB, Singh C (2004) Optimal service restoration and reconfiguration of network using genetic-tabu algorithm. Elect Power Syst Res 71: 145\u2013152","journal-title":"Elect Power Syst Res"},{"key":"13_CR28","unstructured":"Ting CK, Li ST, Lee C (2001) Tga: a new integrated approach to evolutionary algorithms. In: Proc. of the IEEE congress on evolutionary computation, pp 917\u2013924"},{"key":"13_CR29","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0020-0255(03)00176-2","volume":"156","author":"CK Ting","year":"2003","unstructured":"Ting CK, Li ST, Lee CN (2003) On the harmonious mating strategy through tabu search. Inform Sci 156: 189\u2013214","journal-title":"Inform Sci"},{"key":"13_CR30","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1016\/j.ejor.2007.06.039","volume":"190","author":"G Vilcot","year":"2008","unstructured":"Vilcot G, Billaut JC (2008) A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem. Eur J Oper Res 190: 398\u2013411","journal-title":"Eur J Oper Res"},{"key":"13_CR31","unstructured":"Whitley D (1989) The genitor algorithm and selection pressure: Why rank-based allocation of reproductive trials is best. In: Proc. of the 3rd international conference on genetic algorithms, pp 116\u2013121, San Mateo, CA"},{"key":"13_CR32","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.theochem.2003.11.029","volume":"674","author":"B Xian","year":"2004","unstructured":"Xian B, Li T, Sun G, Cao T (2004) The combination of principal component analysis, genetic algorithm and tabu search in 3d molecular similarity. Mol Struct 674: 87\u201397","journal-title":"Mol Struct"},{"issue":"1","key":"13_CR33","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s12293-008-0003-6","volume":"1","author":"X Yu","year":"2009","unstructured":"Yu X, Tang K, Chen T, Yao X (2009) Empirical analysis of evolutionary algorithms with immigrants schemes for dynamic optimization. Memetic Comput 1(1): 3\u201324","journal-title":"Memetic Comput"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-009-0013-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12293-009-0013-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-009-0013-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T07:45:52Z","timestamp":1559461552000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12293-009-0013-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9,1]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,11]]}},"alternative-id":["13"],"URL":"https:\/\/doi.org\/10.1007\/s12293-009-0013-z","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,9,1]]}}}