{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:21:26Z","timestamp":1761805286797},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,1,26]],"date-time":"2012-01-26T00:00:00Z","timestamp":1327536000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1007\/s10489-011-0335-7","type":"journal-article","created":{"date-parts":[[2012,1,25]],"date-time":"2012-01-25T08:05:54Z","timestamp":1327478754000},"page":"405-419","source":"Crossref","is-referenced-by-count":11,"title":["Solving Japanese nonograms by Taguchi-based genetic algorithm"],"prefix":"10.1007","volume":"37","author":[{"given":"Jinn-Tsong","family":"Tsai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,1,26]]},"reference":[{"key":"335_CR1","first-page":"243","volume-title":"Proc Belgian\u2013Dutch conference artificial intelligence","author":"KJ Batenburg","year":"2004","unstructured":"Batenburg KJ, Kosters WA (2004) A\u00a0discrete tomography approach to Japanese puzzles. In: Proc Belgian\u2013Dutch conference artificial intelligence, Groningen, The Netherlands, pp\u00a0243\u2013250"},{"key":"335_CR2","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1007\/978-3-540-78275-9_33","volume-title":"12th international workshop on combinatorial image analysis","author":"KJ Batenburg","year":"2008","unstructured":"Batenburg KJ, Kosters WA (2008) A reasoning framework for solving nonograms. In: 12th international workshop on combinatorial image analysis, vol\u00a04958, pp\u00a0372\u2013383"},{"issue":"8","key":"335_CR3","doi-asserted-by":"crossref","first-page":"1672","DOI":"10.1016\/j.patcog.2008.12.003","volume":"42","author":"KJ Batenburg","year":"2009","unstructured":"Batenburg KJ, Kosters WA (2009) Solving nonograms by combining relaxations. Pattern Recognit 42(8):1672\u20131683","journal-title":"Pattern Recognit"},{"key":"335_CR4","unstructured":"Benton J, Snow R, Wallach N (2005) A\u00a0combinatorial problem associated with nonograms. Technical Report, Artificial Intelligence Dept, Stanford Univ, Stanford, CA"},{"key":"335_CR5","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/s10489-010-0214-7","volume":"32","author":"T Garbolino","year":"2010","unstructured":"Garbolino T, Papa G (2010) Genetic algorithm for test pattern generator design. Appl Intell 32:193\u2013204","journal-title":"Appl Intell"},{"key":"335_CR6","doi-asserted-by":"crossref","first-page":"2962","DOI":"10.1109\/ICMLC.2009.5212614","volume-title":"Proceedings of the 2009 international conference on machine learning and cybernetics","author":"MQ Jing","year":"2009","unstructured":"Jing MQ, Yu CH, Lee HL, Chen LH (2009) Solving Japanese puzzles with logical rules and depth first search algorithm. In: Proceedings of the 2009 international conference on machine learning and cybernetics, vol\u00a05, pp\u00a02962\u20132967"},{"key":"335_CR7","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s10489-008-0158-3","volume":"33","author":"EE Korkmaz","year":"2010","unstructured":"Korkmaz EE (2010) Multi-objective genetic algorithms for grouping problems. Appl Intell 33:179\u2013192","journal-title":"Appl Intell"},{"issue":"10","key":"335_CR8","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1080\/03052150903505885","volume":"42","author":"KM Lee","year":"2010","unstructured":"Lee KM, Tsai JT, Liu TK, Chou JH (2010) Improved genetic algorithm for mixed-discrete-continuous design optimization problems. Eng Optim 42(10):927\u2013941","journal-title":"Eng Optim"},{"issue":"9\u201310","key":"335_CR9","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1007\/s00170-004-2283-4","volume":"27","author":"TK Liu","year":"2006","unstructured":"Liu TK, Tsai JT, Chou JH (2006) Improved genetic algorithm for job-shop scheduling problem. Int J Adv Manuf Technol 27(9\u201310):1021\u20131029","journal-title":"Int J Adv Manuf Technol"},{"issue":"4","key":"335_CR10","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s12065-009-0030-3","volume":"2","author":"EG Ortiz-Garcia","year":"2009","unstructured":"Ortiz-Garcia EG, Salcedo-Sanz S, Perez-Bellido AM, Carro-Calvo L, Portilla-Figueras A, Yao X (2009) Improving the performance of evolutionary algorithms in grid-based puzzles resolution. Evol Intell 2(4):169\u2013181","journal-title":"Evol Intell"},{"key":"335_CR11","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1007\/s10489-009-0206-7","volume":"35","author":"T \u00d6zyer","year":"2011","unstructured":"\u00d6zyer T, Zhang M, Alhajj R (2011) Integrating multi-objective genetic algorithm based clustering and data partitioning for skyline computation. Appl Intell 35:110\u2013122","journal-title":"Appl Intell"},{"key":"335_CR12","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1109\/TE.2007.893170","volume":"50","author":"S Salcedo-Sanz","year":"2007","unstructured":"Salcedo-Sanz S, Portilla-Figueras JA, Ortiz-Garcia EG, Perez-Bellido AM, Yao X (2007) Teaching advanced features of evolutionary algorithms using Japanese puzzles. IEEE Trans Ed 50:151\u2013156","journal-title":"IEEE Trans Ed"},{"key":"335_CR13","volume-title":"Robust engineering","author":"G Taguchi","year":"2000","unstructured":"Taguchi G, Chowdhury S, Taguchi S (2000) Robust engineering. McGraw-Hill, New York"},{"issue":"12","key":"335_CR14","doi-asserted-by":"crossref","first-page":"1079","DOI":"10.1080\/03052151003650084","volume":"42","author":"JT Tsai","year":"2010","unstructured":"Tsai JT (2010) Robust optimal-parameter design approach for tolerance design problems. Eng Optim 42(12):1079\u20131093","journal-title":"Eng Optim"},{"issue":"3","key":"335_CR15","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1109\/TIE.2006.874280","volume":"53","author":"JT Tsai","year":"2006","unstructured":"Tsai JT, Chou JH, Liu TK (2006a) Optimal design of digital IIR filters using hybrid Taguchi genetic algorithm. IEEE Trans Ind Electron 53(3):867\u2013879","journal-title":"IEEE Trans Ind Electron"},{"issue":"1","key":"335_CR16","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1109\/TNN.2005.860885","volume":"17","author":"JT Tsai","year":"2006","unstructured":"Tsai JT, Chou JH, Liu TK (2006b) Tuning the structure and parameters of a neural network by using hybrid Taguchi-genetic algorithm. IEEE Trans Neural Netw 17(1):69\u201380","journal-title":"IEEE Trans Neural Netw"},{"key":"335_CR17","doi-asserted-by":"crossref","unstructured":"Tsai JT, Chou PY, Fang JC (2011) Learning intelligent genetic algorithms using Japanese nonograms. IEEE Trans Ed. doi: 10.1109\/TE.2011.2158214","DOI":"10.1109\/TE.2011.2158214"},{"issue":"4","key":"335_CR18","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1109\/TEVC.2004.826895","volume":"8","author":"JT Tsai","year":"2004","unstructured":"Tsai JT, Liu TK, Chou JH (2004) Hybrid Taguchi-genetic algorithm for global numerical optimization. IEEE Trans Evol Comput 8(4):365\u2013377","journal-title":"IEEE Trans Evol Comput"},{"issue":"9\u201310","key":"335_CR19","doi-asserted-by":"crossref","first-page":"987","DOI":"10.1007\/s00170-007-1142-5","volume":"38","author":"JT Tsai","year":"2008","unstructured":"Tsai JT, Liu TK, Ho WH, Chou JH (2008) An improved genetic algorithm for job-shop scheduling problems using Taguchi-based crossover. Int J Adv Manuf Technol 38(9\u201310):987\u2013994","journal-title":"Int J Adv Manuf Technol"},{"issue":"3","key":"335_CR20","doi-asserted-by":"crossref","first-page":"6928","DOI":"10.1016\/j.eswa.2008.08.065","volume":"36","author":"JT Tsai","year":"2009","unstructured":"Tsai JT, Ho WH, Chou JH (2009) Design of two-dimensional IIR digital structure-specified filters by using an improved genetic algorithm. Expert Syst Appl 36(3):6928\u20136934","journal-title":"Expert Syst Appl"},{"key":"335_CR21","unstructured":"Ueda N, Nagao T (1996) NP-completeness results for nonograms via parsimonious reductions. Technical Report TR96-0008, Tokyo Institute of Technology, Tokyo, Japan"},{"key":"335_CR22","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/s001700200126","volume":"20","author":"L Wang","year":"2002","unstructured":"Wang L, Zheng DZ (2002) A\u00a0modified genetic algorithm for job shop scheduling. Int J Adv Manuf Technol 20:72\u201376","journal-title":"Int J Adv Manuf Technol"},{"key":"335_CR23","first-page":"1","volume-title":"Proceedings of the first twente student conference on IT","author":"W Wiggers","year":"2004","unstructured":"Wiggers W (2004) A\u00a0comparison of a genetic algorithm and a depth first search algorithm applied to Japanese nonograms. In: Proceedings of the first twente student conference on IT, pp\u00a01\u20136"},{"key":"335_CR24","doi-asserted-by":"crossref","DOI":"10.1115\/1.801578","volume-title":"Taguchi methods for robust design","author":"Y Wu","year":"2000","unstructured":"Wu Y (2000) Taguchi methods for robust design. The American Society of Mechanical Engineers, New York"},{"key":"335_CR25","doi-asserted-by":"crossref","unstructured":"Xing H, Qu R (2011) A\u00a0compact genetic algorithm for the network coding based resource minimization problem. Applied Intelligence, doi: 10.1007\/s10489-011-0298-8","DOI":"10.1007\/s10489-011-0298-8"},{"key":"335_CR26","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1109\/TAAI.2010.95","volume-title":"2010 International conference on technologies and applications of artificial intelligence","author":"SJ Yen","year":"2010","unstructured":"Yen SJ, Su TC, Chiu SY, Chen JC (2010) Optimization of nonogram\u2019s solver by using an efficient algorithm. In: 2010 International conference on technologies and applications of artificial intelligence, pp\u00a0444\u2013449"},{"key":"335_CR27","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s10489-007-0112-9","volume":"31","author":"B Yu","year":"2009","unstructured":"Yu B, Yang Z (2009) A\u00a0dynamic holding strategy in public transit systems with real-time information. Appl Intell 31:69\u201380","journal-title":"Appl Intell"},{"key":"335_CR28","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/s10489-009-0200-0","volume":"35","author":"CH Yu","year":"2011","unstructured":"Yu CH, Lee HL, Chen LH (2011) An efficient algorithm for solving nonograms. Appl Intell 35:18\u201331","journal-title":"Appl Intell"},{"key":"335_CR29","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s10489-008-0134-y","volume":"32","author":"R Zhang","year":"2010","unstructured":"Zhang R, Wu C (2010) A\u00a0hybrid approach to large-scale job shop scheduling. Appl Intell 32:47\u201359","journal-title":"Appl Intell"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-011-0335-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-011-0335-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-011-0335-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,22]],"date-time":"2019-06-22T22:25:44Z","timestamp":1561242344000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-011-0335-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,26]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["335"],"URL":"https:\/\/doi.org\/10.1007\/s10489-011-0335-7","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1,26]]}}}