{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:47:15Z","timestamp":1750225635711},"publisher-location":"Singapore","reference-count":14,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811310553"},{"type":"electronic","value":"9789811310560"}],"license":[{"start":{"date-parts":[[2018,7,24]],"date-time":"2018-07-24T00:00:00Z","timestamp":1532390400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-981-13-1056-0_38","type":"book-chapter","created":{"date-parts":[[2018,7,23]],"date-time":"2018-07-23T16:30:31Z","timestamp":1532363431000},"page":"369-375","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Improving an Evolutionary Approach to Sudoku Puzzles by Intermediate Optimization of the Population"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Becker","sequence":"first","affiliation":[]},{"given":"Sinan","family":"Balci","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,24]]},"reference":[{"issue":"2744","key":"38_CR1","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/S0262-4079(10)60147-9","volume":"205","author":"C Barras","year":"2010","unstructured":"Barras C (2010) What a maze-solving oil drop can tell us about intelligence. New Sci 205(2744):8\u20139","journal-title":"New Sci"},{"key":"38_CR2","unstructured":"Bartlett A, Chartier TP, Langville AN, Rankin TD (2008) An integer programming model for the Sudoku problem. J Online Math Appl 8 (2008)"},{"key":"38_CR3","doi-asserted-by":"publisher","unstructured":"Becker M (2006) Genetic algorithms for noise reduction in tire design. In: 2006 IEEE international conference on systems, man and cybernetics, vol\u00a06, pp 5304\u20135308, Oct 2006. https:\/\/doi.org\/10.1109\/ICSMC.2006.385151","DOI":"10.1109\/ICSMC.2006.385151"},{"key":"38_CR4","unstructured":"Felgenhauer B, Jarvis F (2005) Enumerating possible Sudoku grids. http:\/\/www.afjarvis.staff.shef.ac.uk\/sudoku\/sudoku.pdf"},{"key":"38_CR5","volume-title":"AI Escargot\u2014the most difficult sudoku puzzle","author":"A Inkala","year":"2007","unstructured":"Inkala A (2007) AI Escargot\u2014the most difficult sudoku puzzle. Lulu Publisher, Finland"},{"key":"38_CR6","unstructured":"Lynce I, Ouaknine J (2006) Sudoku as a sat problem. In: ISAIM"},{"key":"38_CR7","doi-asserted-by":"crossref","unstructured":"Manter T, Koljonen J (2007) Solving, rating and generating Sudoku puzzles with GA. In: IEEE congress on evolutionary computation, 2007. CEC 2007. IEEE, pp 1382\u20131389 (2007)","DOI":"10.1109\/CEC.2007.4424632"},{"key":"38_CR8","doi-asserted-by":"crossref","unstructured":"Moraglio A, Togelius J, Lucas S (2006) Product geometric crossover for the Sudoku puzzle. In: IEEE congress on evolutionary computation, 2006. CEC 2006. IEEE, pp 470\u2013476 (2006)","DOI":"10.1109\/CEC.2006.1688347"},{"key":"38_CR9","doi-asserted-by":"crossref","unstructured":"Sato Y, Inoue H (2010) Solving Sudoku with genetic operations that preserve building blocks. In: 2010 IEEE symposium on computational intelligence and games (CIG). IEEE, pp 23\u201329 (2010)","DOI":"10.1109\/ITW.2010.5593375"},{"key":"38_CR10","doi-asserted-by":"crossref","unstructured":"S\u00f6rensen K (2013) Metaheuristics\u2014the metaphor exposed. Int Trans Oper Res (2013)","DOI":"10.1111\/itor.12001"},{"key":"38_CR11","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-1-4612-1542-4_13","volume-title":"Evolutionary Algorithms","author":"Michael Syrjakow","year":"1999","unstructured":"Syrjakow M, Szczerbicka H (1999) Efficient parameter optimization based on combination of direct global and local search methods. In: Evolutionary algorithms. Springer, pp 227\u2013249"},{"issue":"7","key":"38_CR12","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1080\/019697298125461","volume":"29","author":"M Syrjakow","year":"1998","unstructured":"Syrjakow M, Szczerbicka H, Becker M (1998) Genetic algorithms: a tool for modelling, simulation, and optimization of complex systems. Cybern Syst 29(7):639\u2013659","journal-title":"Cybern Syst"},{"issue":"5","key":"38_CR13","first-page":"1052","volume":"86","author":"Y Takayuki","year":"2003","unstructured":"Takayuki Y, Takahiro S (2003) Complexity and completeness of finding another solution and its application to puzzles. IEICE Trans Fundam Electron Commun Comput Sci 86(5):1052\u20131060","journal-title":"IEICE Trans Fundam Electron Commun Comput Sci"},{"key":"38_CR14","doi-asserted-by":"crossref","unstructured":"Wang Z, Yasuda T, Ohkura K (2015) An evolutionary approach to Sudoku puzzles with filtered mutations. In: 2015 IEEE congress on evolutionary computation (CEC). IEEE, pp 1732\u20131737 (2015)","DOI":"10.1109\/CEC.2015.7257096"}],"container-title":["Lecture Notes in Electrical Engineering","Information Science and Applications 2018"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-13-1056-0_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,21]],"date-time":"2019-10-21T05:16:10Z","timestamp":1571634970000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-13-1056-0_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,24]]},"ISBN":["9789811310553","9789811310560"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-981-13-1056-0_38","relation":{},"ISSN":["1876-1100","1876-1119"],"issn-type":[{"type":"print","value":"1876-1100"},{"type":"electronic","value":"1876-1119"}],"subject":[],"published":{"date-parts":[[2018,7,24]]}}}