{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:33:20Z","timestamp":1742988800335,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540389903"},{"type":"electronic","value":"9783540389910"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11844297_20","type":"book-chapter","created":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T18:55:37Z","timestamp":1160074537000},"page":"192-201","source":"Crossref","is-referenced-by-count":7,"title":["A Local Genetic Algorithm for Binary-Coded Problems"],"prefix":"10.1007","author":[{"given":"Carlos","family":"Garc\u00eda-Mart\u00ednez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Lozano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Molina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"Beasley, J.E.: Heuristic algorithms for the unconstrained binary quadratic programming problem. Technical Report, Management School, Imperial College, UK (1998)"},{"issue":"2","key":"20_CR2","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C. Blum","year":"2003","unstructured":"Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Computing Surveys (CSUR)\u00a035(2), 268\u2013308 (2003)","journal-title":"ACM Computing Surveys (CSUR)"},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0167-6377(94)90065-5","volume":"16","author":"K.D. Boese","year":"1994","unstructured":"Boese, K.D., Muddu, S.: A new adaptive multi-start technique for combinatorial global optimizations. Operations Research Letters\u00a016, 101\u2013113 (1994)","journal-title":"Operations Research Letters"},{"key":"20_CR4","unstructured":"De Jong, K., Potter, M.A., Spears, W.M.: Using problem generators to explore the effects of epistasis. In: Proc. of the Seventh International Conference on Genetic Algorithms, pp. 338\u2013345 (1997)"},{"key":"20_CR5","first-page":"60","volume-title":"Proc. of the 2001 Congress on Evolutionary Computation","author":"C. Fernandes","year":"2001","unstructured":"Fernandes, C., Rosa, A.: A study on non-random mating and varying population size in genetic algorithms using a royal road function. In: Proc. of the 2001 Congress on Evolutionary Computation, pp. 60\u201366. IEEE Press, Piscataway, New Jersey (2001)"},{"key":"20_CR6","unstructured":"Garc\u00eda-Mart\u00ednez, C., Lozano, M., Herrera, F., Molina, D., S\u00e1nchez, A.M.: Global and local real-coded genetic algorithms based on parent-centric crossover operators. European Journal of Operational Research (in press, 2006)"},{"issue":"1","key":"20_CR7","first-page":"106","volume":"50","author":"F. Glover","year":"1999","unstructured":"Glover, F., Laguna, M.: Tabu search. Operational Research Society Journal\u00a050(1), 106\u2013107 (1999)","journal-title":"Operational Research Society Journal"},{"key":"20_CR8","first-page":"493","volume":"3","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E., Korb, B., Deb, K.: Messy genetic algorithms: motivation, analysis, and first results. Complex Systems\u00a03, 493\u2013530 (1989)","journal-title":"Complex Systems"},{"key":"20_CR9","volume-title":"Genetic algorithms in search, optimization, and machine learning","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading (1989)"},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0377-2217(84)90055-9","volume":"15","author":"V.P. Gulati","year":"1984","unstructured":"Gulati, V.P., Gupta, S.K., Mittal, A.K.: Unconstrained quadratic bivalent programming problem. European Journal of Operational Research\u00a015, 121\u2013125 (1984)","journal-title":"European Journal of Operational Research"},{"key":"20_CR11","first-page":"24","volume-title":"Proc. of the 6th International Conference on Genetic Algorithms","author":"G. Harik","year":"1995","unstructured":"Harik, G.: Finding multimodal solutions using restricted tournament selection. In: Eshelman, L.J. (ed.) Proc. of the 6th International Conference on Genetic Algorithms, pp. 24\u201331. Morgan Kaufmann, San Mateo, California (1995)"},{"issue":"3","key":"20_CR12","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1137\/S1052623497328987","volume":"10","author":"C. Helmberg","year":"2000","unstructured":"Helmberg, C., Rendl, F.: A spectral bundle method for semidefinite programming. Siam Journal of Optimization\u00a010(3), 673\u2013696 (2000)","journal-title":"Siam Journal of Optimization"},{"issue":"1","key":"20_CR13","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/4235.843494","volume":"4","author":"F. Herrera","year":"2000","unstructured":"Herrera, F., Lozano, M.: Gradual distributed real-coded genetic algorithms. IEEE Transactions on Evolutionary Computation\u00a04(1), 43\u201363 (2000)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"20_CR14","unstructured":"Holland, J.H.: Adaptation in natural and artificial systems. The University of Michigan Press, The MIT Press, London (1992)"},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R., Thatcher, J. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"issue":"3","key":"20_CR16","first-page":"430","volume":"J84-A","author":"K. Katayama","year":"2001","unstructured":"Katayama, K., Narihisa, H.: A variant k-opt local search heuristic for binary quadratic programming. Trans. IEICE (A)\u00a0J84-A(3), 430\u2013435 (2001)","journal-title":"Trans. IEICE (A)"},{"issue":"3","key":"20_CR17","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1109\/4235.930311","volume":"5","author":"S.A. Kazarlis","year":"2001","unstructured":"Kazarlis, S.A., Papadakis, S.E., Theocharis, J.B., Petridis, V.: Microgenetic algorithms as generalized hill-climbing operators for GA optimization. IEEE Transactions on Evolutionary Computation\u00a05(3), 204\u2013217 (2001)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"3","key":"20_CR18","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1162\/1063656041774983","volume":"12","author":"M. Lozano","year":"2004","unstructured":"Lozano, M., Herrera, F., Krasnogor, N., Molina, D.: Real-coded memetic algorithms with crossover hill-climbing. Evolutionary Computation Journal\u00a012(3), 273\u2013302 (2004)","journal-title":"Evolutionary Computation Journal"},{"issue":"1-3","key":"20_CR19","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.biosystems.2004.08.002","volume":"79","author":"P. Merz","year":"2004","unstructured":"Merz, P., Katayama, K.: Memetic algorithms for the unconstrained binary quadratic programming problem. Bio Systems\u00a079(1-3), 99\u2013118 (2004)","journal-title":"Bio Systems"},{"key":"20_CR20","unstructured":"Sywerda, G.: Uniform crossover in genetic algorithms. In: Proc. of the third international conference on Genetic algorithms, pp. 2\u20139 (1989)"},{"key":"20_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-540-24855-2_21","volume-title":"Genetic and Evolutionary Computation \u2013 GECCO 2004","author":"D. Thierens","year":"2004","unstructured":"Thierens, D.: Population-based iterated local search: restricting neighborhood search by crossover. In: Deb, K., et al. (eds.) GECCO 2004. LNCS, vol.\u00a03103, pp. 234\u2013245. Springer, Heidelberg (2004)"},{"key":"20_CR22","first-page":"238","volume-title":"Proc. of the Seventh International Conference on Genetic Algorithms","author":"S. Tsutsui","year":"1997","unstructured":"Tsutsui, S., Ghosh, A., Corne, D., Fujimoto, Y.: A real coded genetic algorithm with an explorer and an exploiter population. In: B\u00e4ck, T. (ed.) Proc. of the Seventh International Conference on Genetic Algorithms, pp. 238\u2013245. Morgan Kaufmann Publishers, San Francisco (1997)"},{"key":"20_CR23","first-page":"116","volume-title":"Proc. of the Third International Conference on Genetic Algorithms","author":"D. Whitley","year":"1989","unstructured":"Whitley, D.: The GENITOR algorithm and selection pressure: why rank-based allocation of reproductive trials is best. In: David Schaffer, J. (ed.) Proc. of the Third International Conference on Genetic Algorithms, pp. 116\u2013121. Morgan Kaufmann, San Mateo (1989)"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature - PPSN IX"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/11844297_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T01:07:24Z","timestamp":1664240844000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/11844297_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540389903","9783540389910"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11844297_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}