{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T16:29:25Z","timestamp":1772296165446,"version":"3.50.1"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"8-9","license":[{"start":{"date-parts":[[2008,7,26]],"date-time":"2008-07-26T00:00:00Z","timestamp":1217030400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2009,7]]},"DOI":"10.1007\/s00500-008-0354-4","type":"journal-article","created":{"date-parts":[[2008,7,25]],"date-time":"2008-07-25T06:52:11Z","timestamp":1216968731000},"page":"871-882","source":"Crossref","is-referenced-by-count":31,"title":["A case study of memetic algorithms for constraint optimization"],"prefix":"10.1007","volume":"13","author":[{"given":"Ender","family":"\u00d6zcan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Can","family":"Ba\u015faran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,7,26]]},"reference":[{"key":"354_CR1","doi-asserted-by":"crossref","unstructured":"Alkan A, Ozcan E (2003) Memetic algorithms for timetabling. In: Proc of IEEE congress on evo comp, pp 1796\u20131802","DOI":"10.1109\/CEC.2003.1299890"},{"issue":"3","key":"354_CR2","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1023\/A:1011291030731","volume":"15","author":"E Burke","year":"2001","unstructured":"Burke E, Cowling P, Causmaecker PD, Berge GV (2001) A memetic approach to the nurse rostering problem. Appl Intell 15(3): 199\u2013214","journal-title":"Appl Intell"},{"key":"354_CR3","unstructured":"Burke EK, Kendall G, Newall J, Hart E, Ross P, Schulenburg S (2003) Hyperheuristics: an emerging direction in modern search technology. Handbook of metaheuristics. International Series in OR & Management Science, vol 57. Kluwer, Dordrecht, pp 457\u2013474"},{"issue":"1","key":"354_CR4","first-page":"122","volume":"15","author":"EK Burke","year":"2000","unstructured":"Burke EK, Smith AJ (2000) Hybrid evolutionary techniques for the maintenance scheduling problem. IEEE Trans PS 15(1): 122\u2013128","journal-title":"IEEE Trans PS"},{"issue":"1","key":"354_CR5","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1009642405419","volume":"4","author":"PC Chu","year":"1998","unstructured":"Chu PC, Beasley JE (1998) A genetic algorithm for the multidimensional knapsack problem. J Heuristics 4(1): 63\u201386","journal-title":"J Heuristics"},{"key":"354_CR6","first-page":"34","volume":"3448","author":"R Cleary","year":"2005","unstructured":"Cleary R, O\u2019Neill M (2005) An attribute grammar decoder for the 01 multiconstrained knapsack problem. LNCS 3448: 34\u201345","journal-title":"LNCS"},{"key":"354_CR7","doi-asserted-by":"crossref","unstructured":"Cotta C, Troya JM (1998) A hybrid genetic algorithm for the 0-1 multiple knapsack problem. In: Artificial NN and GAs, vol 3. Springer, Heidelberg, pp 251\u2013255","DOI":"10.1007\/978-3-7091-6492-1_55"},{"key":"354_CR8","unstructured":"Cowling P, Kendall G, Soubeiga E (2000) A hyperheuristic approach to scheduling a sales summit. In: Selected papers from 3rd int conf on PATAT. LNCS, vol 2079, pp 176\u2013190"},{"key":"354_CR9","unstructured":"Davis L (1991) Bit climbing, representational bias, and test suite design. In: Proc of the 4th int conf on GAs, pp 18\u201323"},{"key":"354_CR10","unstructured":"Ersoy E, \u00d6zcan E, Uyar \u015e (2007) Memetic algorithms and hyperhill-climbers. In: Proc of the 3rd multidisciplinary int conf on scheduling: theory and applications, pp 159\u2013166"},{"key":"354_CR11","first-page":"265","volume-title":"Foundations of genetic algorithms","author":"LJ Eshelman","year":"1991","unstructured":"Eshelman LJ (1991) The CHC adaptive search algorithm: how to have safe search when engaging in nontraditional genetic recombination. In: Rawlins GJE(eds) Foundations of genetic algorithms. Morgan Kaufmann, Menlo Park, pp 265\u2013283"},{"issue":"1","key":"354_CR12","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/S0377-2217(00)00140-5","volume":"132","author":"PM Fran\u00e7a","year":"2001","unstructured":"Fran\u00e7a PM, Mendes A, Moscato P (2001) A memetic algorithm for the total tardiness single machine scheduling problem. EJOR 132(1): 224\u2013242","journal-title":"EJOR"},{"issue":"1","key":"354_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(03)00274-1","volume":"155","author":"A Freville","year":"2004","unstructured":"Freville A (2004) The multidimensional 0\u20131 knapsack problem: an overview. EJOR 155(1): 1\u201321","journal-title":"EJOR"},{"key":"354_CR14","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0166-218X(94)90209-7","volume":"49","author":"A Freville","year":"1994","unstructured":"Freville A, Plateau G (1994) An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem. Discrete Appl Math 49: 189\u2013212","journal-title":"Discrete Appl Math"},{"key":"354_CR15","volume-title":"Computers and intractability: a guide to the theory of np-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DJ (1979) Computers and intractability: a guide to the theory of np-completeness. W.H. Freeman, San Francisco"},{"key":"354_CR16","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/BF02591863","volume":"31","author":"B Gavish","year":"1985","unstructured":"Gavish B, Pirkul H (1985) Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality. Math Program 31: 78\u2013105","journal-title":"Math Program"},{"key":"354_CR17","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/978-1-4613-1361-8_25","volume-title":"Meta-heuristics: theory and applications","author":"F Glover","year":"1996","unstructured":"Glover F, Kochenberger GA (1996) Critical event tabu search for multidimensional knapsack problems. In: Osman IH, Kelly JP(eds) Meta-heuristics: theory and applications. Kluwer, Dordrecht, pp 407\u2013427"},{"key":"354_CR18","volume-title":"Genetic algorithms in search, optimization, and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading"},{"key":"354_CR19","unstructured":"Gottlieb J (1999) Evolutionary algorithms for constraint optimization problems. Dissertation, Institut f\u00fcr Informatik der Technischen Universitat Clausthal"},{"key":"354_CR20","unstructured":"Hancock PJB (1999) Selection methods for evolutionary algorithms. In: Chambers L (ed) Practical handbook of genetic algorithms, New Frontiers, vol 2, Chap. 3, pp 67\u201393"},{"key":"354_CR21","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1007\/978-3-540-71618-1_40","volume":"4431","author":"F Hembecker","year":"2007","unstructured":"Hembecker F, Lopes HS, Godoy JrW (2007) Particle swarm optimization for the multidimensional knapsack problem. LNCS Adapt Nat Comput Algorithms 4431: 358\u2013365","journal-title":"LNCS Adapt Nat Comput Algorithms"},{"key":"354_CR22","volume-title":"Adaptation in natural and artificial systems","author":"JH Holland","year":"1975","unstructured":"Holland JH (1975) Adaptation in natural and artificial systems. Univ. Mich. Press, Ann Arbor"},{"key":"354_CR23","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: 204\u2013223","journal-title":"IEEE Trans Evol Comput"},{"key":"354_CR24","doi-asserted-by":"crossref","unstructured":"Khuri S, Back T, Heitkotter J (1994) The zero\/one multiple knapsack problem and genetic algorithms. In: Proceedings of the ACM symposium of applied comp, pp 188\u2013193","DOI":"10.1145\/326619.326694"},{"key":"354_CR25","unstructured":"Krasnogor N (2002) Studies on the theory and design space of memetic algorithms. PhD Thesis, University of the West of England, Bristol"},{"key":"354_CR26","unstructured":"Krasnogor N, Smith JE (2001) Emergence of profitable search strategies based on a simple inheritance mechanism. In: Proc of the genetic and evolutionary comp. conf., pp 432\u2013439"},{"key":"354_CR27","first-page":"1578","volume":"12","author":"P Linqiang","year":"2005","unstructured":"Linqiang P, Mart\u00edn-Vide C (2005) Solving multidimensional 0-1 knapsack problem by P systems with input and active membranes. J Par Dist Comput (65) 12: 1578\u20131584","journal-title":"J Par Dist Comput (65)"},{"key":"354_CR28","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0377-2217(84)90286-8","volume":"16","author":"MJ Magazine","year":"1984","unstructured":"Magazine MJ, Oguz O (1984) A heuristic algorithm for the multidimensional zero-one knapsack problem. EJOR 16: 319\u2013326","journal-title":"EJOR"},{"issue":"4","key":"354_CR29","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"},{"key":"354_CR30","first-page":"1","volume-title":"Handbook of evolutionary computation, vol B2.7","author":"M Mitchell","year":"1997","unstructured":"Mitchell M, Forrest S (1997) Fitness landscapes: royal road functions. In: Baeck T, Fogel D, Michalewicz Z(eds) Handbook of evolutionary computation, vol B2.7. Institute of Physics Publishing, Philadelphia and Bristol UK, pp 1\u201325"},{"key":"354_CR31","unstructured":"Moscato P, Norman MG (1992) A memetic approach for the traveling salesman problem implementation of a computational ecology for combinatorial optimization on message-passing systems. In: Valero M, Onate E, Jane M, Larriba JL, Suarez B (eds) Parallel computing and transputer applications, IOS Press, pp 177\u2013186"},{"issue":"2","key":"354_CR32","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1109\/TCBB.2007.070202","volume":"4","author":"F Neri","year":"2007","unstructured":"Neri F, Toivanen J, Cascella GL, Ong YS (2007) An adaptive multimeme algorithm for designing HIV multidrug therapies. IEEE-ACM Trans Comput Bio Bioinf 4(2): 264\u2013278","journal-title":"IEEE-ACM Trans Comput Bio Bioinf"},{"issue":"2","key":"354_CR33","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1162\/evco.2006.14.2.157","volume":"14","author":"G Ochoa","year":"2006","unstructured":"Ochoa G (2006) Error thresholds in genetic algorithms. Evol Comp J 14(2): 157\u2013182","journal-title":"Evol Comp J"},{"issue":"2","key":"354_CR34","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1109\/TEVC.2003.819944","volume":"8","author":"YS Ong","year":"2004","unstructured":"Ong YS, Keane AJ (2004) Meta-lamarckian learning in memetic algorithms. IEEE Trans Evol Comp 8(2): 99\u2013110","journal-title":"IEEE Trans Evol Comp"},{"issue":"1","key":"354_CR35","first-page":"141","volume":"36","author":"YS Ong","year":"2006","unstructured":"Ong YS, Lim MH, Ning Z, Wong KW (2006) Classification of adaptive memetic algorithms: a comparative study. IEEE Trans SMC BC 36(1): 141\u2013152","journal-title":"IEEE Trans SMC BC"},{"key":"354_CR36","unstructured":"Ozcan E (2006) An empirical investigation on memes, self-generation and nurse rostering. In: Proc of the 6th int conf on the practice and theory of automated timetabling, pp 246\u2013263"},{"key":"354_CR37","unstructured":"Ozcan E (2005) Memetic Algorithms for Nurse Rostering, ISCIS 2005. LNCS, vol 3733, pp 482\u2013492"},{"issue":"1","key":"354_CR38","doi-asserted-by":"crossref","first-page":"3","DOI":"10.3233\/IDA-2008-12102","volume":"12","author":"E Ozcan","year":"2008","unstructured":"Ozcan E, Bilgin B, Korkmaz EE (2008) A comprehensive analysis of hyper-heuristics. Intell Data Anal 12(1): 3\u201323","journal-title":"Intell Data Anal"},{"key":"354_CR39","doi-asserted-by":"crossref","first-page":"987","DOI":"10.1016\/S0167-8655(97)00123-2","volume":"18","author":"E Ozcan","year":"1997","unstructured":"Ozcan E, Mohan CK (1997) Partial shape matching using genetic algorithms. Pattern Recogn Lett 18: 987\u2013992","journal-title":"Pattern Recogn Lett"},{"issue":"1","key":"354_CR40","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10766-006-0026-x","volume":"35","author":"E Ozcan","year":"2007","unstructured":"Ozcan E, Onbasioglu E (2007) Memetic algorithms for parallel code optimization. Int J Parallel Prog 35(1): 33\u201361","journal-title":"Int J Parallel Prog"},{"key":"354_CR41","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1002\/1520-6750(198704)34:2<161::AID-NAV3220340203>3.0.CO;2-A","volume":"34","author":"H Pirkul","year":"1987","unstructured":"Pirkul H (1987) A heuristic solution procedure for the multiconstraint zero-one knapsack problem. Naval Res Logist 34: 161\u2013172","journal-title":"Naval Res Logist"},{"key":"354_CR42","unstructured":"Pisinger D (1995) Algorithms for knapsack problems. PhD thesis, DIKU, University of Copenhagen, Report 95\/1"},{"key":"354_CR43","unstructured":"Reeves C (1993) Using genetic algorithms with small populations. In: Forrest S (ed) Proc of the 5th int conf on GAs, pp 92\u201399"},{"key":"354_CR44","doi-asserted-by":"crossref","unstructured":"Radcliffe NJ, Surry PD (1994) Formal memetic algorithms. Evolutionary Computing: AISB Workshop. LNCS, vol 865. Springer, Heidelberg, pp 1\u201316","DOI":"10.1007\/3-540-58483-8_1"},{"issue":"2","key":"354_CR45","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s005000050009","volume":"1","author":"J Smith","year":"1997","unstructured":"Smith J, Fogarty TC (1997) Operator and parameter adaptation in genetic algorithms. Soft Comput 1(2): 81\u201387","journal-title":"Soft Comput"},{"key":"354_CR46","first-page":"2","volume-title":"Proc of the 3rd int conf on GAs","author":"G Syswerda","year":"1989","unstructured":"Syswerda G (1989) Uniform crossover in genetic algorithms. In: Schaffer J(eds) Proc of the 3rd int conf on GAs. Morgan Kaufmann Publishers, Los Altos, pp 2\u20139"},{"issue":"9","key":"354_CR47","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 MH, Ong YS (2007) Diversity-adaptive parallel memetic algorithm for solving large scale combinatorial optimization problems. Soft Comput 11(9): 873\u2013888","journal-title":"Soft Comput"},{"key":"354_CR48","doi-asserted-by":"crossref","unstructured":"Tavares J, Francisco BP, Costa E (2006) The role of representation on the multidimensional knapsack problem by means of fitness landscape analysis. In: Proc. of the Congress of Evol Comp, pp 2307\u20132314","DOI":"10.1109\/CEC.2006.1688593"},{"key":"354_CR49","unstructured":"Tavares J, Francisco BP, Costa E (2007) Multidimensional knapsack problem: the influence of representation. CISUC Technical Report TR 2007\/003. ISSN 0874-338X"},{"key":"354_CR50","doi-asserted-by":"crossref","first-page":"963","DOI":"10.1057\/jors.1990.148","volume":"41","author":"A Volgenant","year":"1990","unstructured":"Volgenant A, Zoon JA (1990) An improved heuristic for multidimensional 0-1 knapsack problems. JORS 41: 963\u2013970","journal-title":"JORS"},{"issue":"1","key":"354_CR51","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D Wolpert","year":"1997","unstructured":"Wolpert D, MacReady WG (1997) No free lunch theorems for optimization. IEEE Trans Evo Comp 1(1): 67\u201382","journal-title":"IEEE Trans Evo Comp"},{"issue":"10","key":"354_CR52","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1007\/s00500-006-0145-8","volume":"11","author":"Z Zhou","year":"2007","unstructured":"Zhou Z, Ong YS, Lim MH, Lee BS (2007) Memetic algorithm using multi-surrogates for computationally expensive optimization problems. Soft Comput 11(10): 957\u2013971","journal-title":"Soft Comput"},{"issue":"1","key":"354_CR53","first-page":"70","volume":"37","author":"Z Zhu","year":"2007","unstructured":"Zhu Z, Ong YS, Dash M (2007) Wrapper-filter feature selection algorithm using a memetic framework. IEEE Trans SBC BC 37(1): 70\u201376","journal-title":"IEEE Trans SBC BC"},{"key":"354_CR54","unstructured":"Zhu Z, Ong YS, Wong KW, Lim MH (2003) Choice of memes in memetic algorithm. In: Proceedings of the 2nd international conference on computational intelligence, robotics and autonomous systems"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-008-0354-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-008-0354-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-008-0354-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:39:55Z","timestamp":1559093995000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-008-0354-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,26]]},"references-count":54,"journal-issue":{"issue":"8-9","published-print":{"date-parts":[[2009,7]]}},"alternative-id":["354"],"URL":"https:\/\/doi.org\/10.1007\/s00500-008-0354-4","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,7,26]]}}}