{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T13:46:38Z","timestamp":1707831998928},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,4,27]],"date-time":"2017-04-27T00:00:00Z","timestamp":1493251200000},"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":["Int J Syst Assur Eng Manag"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s13198-017-0620-x","type":"journal-article","created":{"date-parts":[[2017,4,27]],"date-time":"2017-04-27T18:02:23Z","timestamp":1493316143000},"page":"741-754","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Harmony search based memetic algorithms for solving sudoku"],"prefix":"10.1007","volume":"9","author":[{"given":"Assif","family":"Assad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kusum","family":"Deep","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,27]]},"reference":[{"issue":"5","key":"620_CR1","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":"620_CR2","unstructured":"Mantere T, Koljonen J (2006) Solving and rating sudoku puzzles with geneticalgorithms. In: New developments in artificial intelligence and the semantic web, proceedings of the 12th finnish artificial intelligence conference STeP. Citeseer, 2006, pp 86\u201392"},{"key":"620_CR3","doi-asserted-by":"crossref","unstructured":"Jones SK, Roach PA, Perkins S (2008) Construction of heuristics for a search-based approach to olving sudoku. In: Research and development in intelligent systems XXIV. Springer, 2008, pp. 37\u201349","DOI":"10.1007\/978-1-84800-094-0_4"},{"issue":"2","key":"620_CR4","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1177\/003754970107600201","volume":"76","author":"ZW Geem","year":"2001","unstructured":"Geem ZW, Kim JH, Loganathan G (2001) A new heuristic optimization algorithm: harmony search. Simulation 76(2):60\u201368","journal-title":"Simulation"},{"issue":"6","key":"620_CR5","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1080\/0305215X.2012.704028","volume":"45","author":"S Gholizadeh","year":"2013","unstructured":"Gholizadeh S, Barzegar A (2013) Shape optimization of structures for frequency constraints by sequential harmony search algorithm. Eng Optim 45(6):627\u2013646","journal-title":"Eng Optim"},{"issue":"1","key":"620_CR6","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1016\/j.ijepes.2012.08.021","volume":"44","author":"L Wang","year":"2013","unstructured":"Wang L, Li L-P (2013) An effective differential harmony search algorithm for the solving non-convex economic load dispatch problems. Int J Electr Power Energy Syst 44(1):832\u2013843","journal-title":"Int J Electr Power Energy Syst"},{"issue":"1","key":"620_CR7","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1109\/TSG.2012.2237420","volume":"4","author":"K Nekooei","year":"2013","unstructured":"Nekooei K, Farsangi MM, Nezamabadi-Pour H, Lee KY (2013) An improved multi-objective harmony search for optimal placement of dgs in distribution systems. Smart Grid IEEE Trans 4(1):557\u2013567","journal-title":"Smart Grid IEEE Trans"},{"key":"620_CR8","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.ins.2012.12.025","volume":"233","author":"M Hadwan","year":"2013","unstructured":"Hadwan M, Ayob M, Sabar NR, Qu R (2013) A harmony search algorithm for nurse rostering problems. Inf Sci 233:126\u2013140","journal-title":"Inf Sci"},{"issue":"6","key":"620_CR9","doi-asserted-by":"crossref","first-page":"1509","DOI":"10.1109\/TSMCB.2012.2193613","volume":"42","author":"R Diao","year":"2012","unstructured":"Diao R, Shen Q (2012) Feature selection with harmony search. Syst Man Cybern Part B Cybern IEEE Trans 42(6):1509\u20131523","journal-title":"Syst Man Cybern Part B Cybern IEEE Trans"},{"issue":"4","key":"620_CR10","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1007\/s00521-014-1766-y","volume":"26","author":"H Fattahi","year":"2015","unstructured":"Fattahi H, Gholami A, Amiribakhtiar MS, Moradi S (2015) Estimation of asphaltene precipitation from titration data: a hybrid support vector regression with harmony search. Neural Comput Appl 26(4):789\u2013798","journal-title":"Neural Comput Appl"},{"issue":"5","key":"620_CR11","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1109\/TSMCC.2011.2174356","volume":"42","author":"MA Al-Betar","year":"2012","unstructured":"Al-Betar MA, Khader AT, Zaman M (2012) University course timetabling using a hybrid harmony search metaheuristic algorithm. Syst Man Cybern Part C Appl Rev IEEE Trans 42(5):664\u2013681","journal-title":"Syst Man Cybern Part C Appl Rev IEEE Trans"},{"key":"620_CR12","doi-asserted-by":"crossref","unstructured":"Geem ZW (2005) Harmony search in water pump switching problem. In: Proceedings of international conference on natural computation. Springer, pp. 751\u2013760","DOI":"10.1007\/11539902_92"},{"issue":"1","key":"620_CR13","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1109\/TSMCB.2005.856143","volume":"36","author":"Y-S Ong","year":"2006","unstructured":"Ong Y-S, Lim M-H, Zhu N, Wong K-W (2006) Classification of adaptive memetic algorithms: a comparative study. Syst Man Cybern Part B Cybern IEEE Trans 36(1):141\u2013152","journal-title":"Syst Man Cybern Part B Cybern IEEE Trans"},{"key":"620_CR14","unstructured":"Dawkins R (2006) The selfish gene. Oxford university press, no. 199"},{"key":"620_CR15","unstructured":"Ong Y-S, Nguyen Q-H, Lim M-H, Jing T (2006) A development platform for memetic algorithm design. In: SCIS and ISIS 2006. Japan society for fuzzy theory and intelligent informatics, pp 1027\u20131032"},{"issue":"2","key":"620_CR16","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. Evolut Comput IEEE Trans 7(2):204\u2013223","journal-title":"Evolut Comput IEEE Trans"},{"issue":"5","key":"620_CR17","doi-asserted-by":"crossref","first-page":"730","DOI":"10.1109\/TEVC.2011.2171972","volume":"16","author":"T-M Chan","year":"2012","unstructured":"Chan T-M, Leung K-S, Lee K-H (2012) Memetic algorithms for de novo motif discovery. Evolut Comput IEEE Trans 16(5):730\u2013748","journal-title":"Evolut Comput IEEE Trans"},{"issue":"11","key":"620_CR19","doi-asserted-by":"crossref","first-page":"2652","DOI":"10.1080\/00207721.2015.1010748","volume":"47","author":"H Sharma","year":"2016","unstructured":"Sharma H, Bansal JC, Arya KV, Yang X-S (2016) L\u00e9vy flight artificial bee colony algorithm. Int J Syst Sci 47(11):2652\u20132670","journal-title":"Int J Syst Sci"},{"issue":"3","key":"620_CR20","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s12293-015-0158-x","volume":"7","author":"SS Jadon","year":"2015","unstructured":"Jadon SS, Bansal JC, Tiwari R, Sharma H (2015) Accelerating artificial bee colony algorithm with adaptive local search. Memet Comput 7(3):215\u2013230","journal-title":"Memet Comput"},{"issue":"2","key":"620_CR21","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1504\/IJCISTUDIES.2013.055217","volume":"2","author":"H Sharma","year":"2013","unstructured":"Sharma H, Bansal JC, Arya K (2013) Power law-based local search in differential evolution. Int J Comput Intell Stud 2(2):90\u2013112","journal-title":"Int J Comput Intell Stud"},{"key":"620_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-32363-5","volume-title":"Recent advances in memetic algorithms","author":"WE Hart","year":"2005","unstructured":"Hart WE, Krasnogor N, Smith JE (2005) Recent advances in memetic algorithms, vol 166. Springer Science & Business Media, New York"},{"key":"620_CR23","doi-asserted-by":"crossref","unstructured":"Moon TK, Gunther JH (2006) Multiple constraint satisfaction by belief ropagation: an example using sudoku. In: IEEE mountain workshop on 2006. Adaptive and learning systems, IEEE, 2006, pp. 122\u2013126","DOI":"10.1109\/SMCALS.2006.250702"},{"key":"620_CR24","unstructured":"Lynce I, Ouaknine J (2006) Sudoku as a sat problem. In: Proceedings of the 9th Symposium on Artificial Intelligence and Mathematics (AIMATH), 6 jan 2006"},{"issue":"4","key":"620_CR25","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s10732-007-9012-8","volume":"13","author":"R Lewis","year":"2007","unstructured":"Lewis R (2007) Metaheuristics can solve sudoku puzzles. J Heuristics 13(4):387\u2013401","journal-title":"J Heuristics"},{"key":"620_CR26","volume-title":"Using ant systems to solve sudoku problems","author":"D Mullaney","year":"2006","unstructured":"Mullaney D (2006) Using ant systems to solve sudoku problems. University College Dublin, Dublin"},{"key":"620_CR27","unstructured":"Boryczka U, Juszczuk P (2012) Solving the sudoku with the differential evolution. Zeszyty Naukowe Politechniki Bia\u0142ostockiej. Informatyka, pp 5\u201316"},{"issue":"4","key":"620_CR28","doi-asserted-by":"crossref","first-page":"1741","DOI":"10.1109\/TIT.2009.2013004","volume":"55","author":"TK Moon","year":"2009","unstructured":"Moon TK, Gunther JH, Kupin JJ (2009) Sinkhorn solves sudoku. Inf Theory IEEE Trans 55(4):1741\u20131746","journal-title":"Inf Theory IEEE Trans"},{"issue":"1","key":"620_CR29","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1109\/TSP.2011.2169253","volume":"60","author":"J Gunther","year":"2012","unstructured":"Gunther J, Moon T (2012) Entropy minimization for solving sudoku. Signal Process IEEE Trans 60(1):508\u2013513","journal-title":"Signal Process IEEE Trans"},{"key":"620_CR30","unstructured":"Garey M, Johnson D (1979) Computers and intractability WH freeman and company New York"},{"key":"620_CR31","unstructured":"Das KN, Bhatia S, Puri S, Deep K (2012) A retrievable ga for solving sudoku puzzles. Tech. Rep, Citeseer"},{"key":"620_CR32","doi-asserted-by":"crossref","unstructured":"Nicolau M, Ryan C (2006) Solving sudoku with the gauge system. In: Genetic programming. Springer, pp 213\u2013224","DOI":"10.1007\/11729976_19"},{"issue":"3","key":"620_CR33","first-page":"68","volume":"28","author":"Y Li","year":"2011","unstructured":"Li Y, Deng X (2011) Solving sudoku puzzles based on improved genetic algorithm. Jisuanji Yingyong Yu Ruanjian 28(3):68\u201370","journal-title":"Jisuanji Yingyong Yu Ruanjian"},{"key":"620_CR34","doi-asserted-by":"crossref","unstructured":"Sato Y, Inoue H (2010) Solving sudoku with genetic operations that preserve building blocks. In: IEEE Symposium on Computational intelligence and games (CIG), 2010. IEEE, pp 23\u201329","DOI":"10.1109\/ITW.2010.5593375"},{"issue":"2","key":"620_CR35","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s11590-011-0413-0","volume":"7","author":"XQ Deng","year":"2013","unstructured":"Deng XQ, Da Li Y (2013) A novel hybrid genetic algorithm for solving sudoku puzzles. Optim Lett 7(2):241\u2013257","journal-title":"Optim Lett"},{"key":"620_CR36","doi-asserted-by":"crossref","unstructured":"Sato Y, Hasegawa N, Sato M (2013) Acceleration of genetic algorithms for sudoku solution on many-core rocessors. In: Massively parallel evolutionary computation on GPGPUs. Springer, pp 421\u2013444","DOI":"10.1007\/978-3-642-37959-8_19"},{"key":"620_CR37","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","DOI":"10.1109\/CEC.2006.1688347"},{"key":"620_CR38","unstructured":"Soto R, Crawford B, Galleguillos C, Paredes F, Norero E, (2015) A hybrid alldifferent-tabu search algorithm for solving sudoku puzzles. Comput Intell Neurosci 2015"},{"key":"620_CR39","doi-asserted-by":"crossref","unstructured":"Wang Z, Yasuda T, Ohkura K, (2015) An evolutionary approach to sudoku puzzles with filtered mutations. In: IEEE congress on evolutionary computation (CEC), 2015. IEEE, pp 1732\u20131737","DOI":"10.1109\/CEC.2015.7257096"},{"issue":"15","key":"620_CR40","doi-asserted-by":"crossref","first-page":"5817","DOI":"10.1016\/j.eswa.2013.05.019","volume":"40","author":"R Soto","year":"2013","unstructured":"Soto R, Crawford B, Galleguillos C, Monfroy E, Paredes F (2013) A hybrid ac3-tabu search algorithm for solving sudoku puzzles. Exp Syst Appl 40(15):5817\u20135821","journal-title":"Exp Syst Appl"},{"key":"620_CR41","unstructured":"Simonis H (2005) Sudoku as a constraint problem. In: CP workshop on modeling and reformulating constraint satisfaction problems. Citeseer, vol\u00a012, pp 13\u201327"},{"key":"620_CR42","volume-title":"Handbook of constraint programming","author":"F Rossi","year":"2006","unstructured":"Rossi F, Van Beek P, Walsh T (2006) Handbook of constraint programming. Elsevier, Amsterdam"},{"key":"620_CR43","doi-asserted-by":"crossref","unstructured":"Manter T, Koljonen J (2007) Solving, rating and generating sudoku puzzles with ga. In: IEEE Congress on evolutionary computation, CEC 2007. IEEE 2007, pp 1382\u20131389","DOI":"10.1109\/CEC.2007.4424632"},{"key":"620_CR44","doi-asserted-by":"crossref","unstructured":"Soto R, Crawford B, Galleguillos C, Monfroy E, Paredes F (2014) A prefiltered cuckoo search algorithm with geometric operators for solving sudoku problems, vol 2014. The Scientific World Journal","DOI":"10.1155\/2014\/465359"},{"key":"620_CR45","doi-asserted-by":"crossref","unstructured":"Geem ZW (2007) Harmony search algorithm for solving sudoku. In: Knowledge-based intelligent information and engineering systems. Springer, pp 371\u2013378","DOI":"10.1007\/978-3-540-74819-9_46"},{"key":"620_CR46","first-page":"97","volume":"2","author":"D Weyland","year":"2015","unstructured":"Weyland D (2015) A critical analysis of the harmony search algorithm how not to solve sudoku. Op Res Perspect 2:97\u2013105","journal-title":"Op Res Perspect"},{"issue":"7","key":"620_CR47","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1145\/364520.364540","volume":"7","author":"R Durstenfeld","year":"1964","unstructured":"Durstenfeld R (1964) Algorithm 235: random permutation. Commun ACM 7(7):420","journal-title":"Commun ACM"},{"issue":"2","key":"620_CR48","first-page":"111","volume":"9","author":"X Jin","year":"1997","unstructured":"Jin X, Li Z (1997) Genetic-catastrophic algorithms and its application in nonlinear control system. J Syst Simul 9(2):111\u2013115","journal-title":"J Syst Simul"}],"container-title":["International Journal of System Assurance Engineering and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13198-017-0620-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13198-017-0620-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13198-017-0620-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,22]],"date-time":"2019-09-22T05:28:07Z","timestamp":1569130087000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13198-017-0620-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,27]]},"references-count":47,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["620"],"URL":"https:\/\/doi.org\/10.1007\/s13198-017-0620-x","relation":{},"ISSN":["0975-6809","0976-4348"],"issn-type":[{"value":"0975-6809","type":"print"},{"value":"0976-4348","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4,27]]}}}