{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T16:55:31Z","timestamp":1773248131832,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,5,24]],"date-time":"2021-05-24T00:00:00Z","timestamp":1621814400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,24]],"date-time":"2021-05-24T00:00:00Z","timestamp":1621814400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Innovations Syst Softw Eng"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s11334-021-00397-4","type":"journal-article","created":{"date-parts":[[2021,5,24]],"date-time":"2021-05-24T18:02:41Z","timestamp":1621879361000},"page":"261-275","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["A novel hybrid genetic algorithm-based firefly mating algorithm for solving Sudoku"],"prefix":"10.1007","volume":"17","author":[{"given":"Sunanda","family":"Jana","sequence":"first","affiliation":[]},{"given":"Anamika","family":"Dey","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3320-9965","authenticated-orcid":false,"given":"Arnab Kumar","family":"Maji","sequence":"additional","affiliation":[]},{"given":"Rajat Kumar","family":"Pal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,24]]},"reference":[{"issue":"5","key":"397_CR1","first-page":"1052","volume":"86","author":"T Yato","year":"2003","unstructured":"Yato T, Seta T (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":"397_CR2","first-page":"791","volume-title":"Soft computing: theories and applications, advances in intelligent systems and computing","author":"DB Mishra","year":"2017","unstructured":"Mishra DB, Mishra R, Das KN, Acharya AA (2017) Solving Sudoku puzzles using evolutionary techniques\u2014a systematic survey. In: Pant M, Ray K, Sharma T, Rawat S, Bandyopadhyay A (eds) Soft computing: theories and applications, advances in intelligent systems and computing, vol 583. Springer, Singapore, pp 791\u2013802"},{"key":"397_CR3","doi-asserted-by":"crossref","unstructured":"Chel H, Mylavarapu D, Sharma S (2016) A novel multistage genetic algorithm approach for solving Sudoku puzzle. In: Proceedings of the International Conference on Electrical, Electronics, and Optimisation Techniques (ICEEOT), pp 808\u2013813","DOI":"10.1109\/ICEEOT.2016.7754798"},{"key":"397_CR4","doi-asserted-by":"crossref","unstructured":"Maji AK, Roy S, Pal RK (2014) A novel steganographic scheme using Sudoku. In: Proceedings of the IEEE International Conference on Electrical Information and Communication Technology (ICEICT 2013), Bangladesh, pp 116\u2013121","DOI":"10.1109\/EICT.2014.6777849"},{"key":"397_CR5","doi-asserted-by":"crossref","unstructured":"Srivatsa D, Teja TPVK, Prathyusha I, Jeyakumar G (2019) An empirical analysis of genetic algorithm with different mutation and crossover operators for solving Sudoku. In: B. Deka, P. Maji, S. Mitra, D. Bhattacharyya, P. Bora, and S. Pal (eds), Proceedings of the 8th international conference on Pattern Recognition and Machine Intelligence (PReMI). Lecture Notes in Computer Science, vol 11941, Springer, Cham, pp 356\u2013364, Tezpur, India","DOI":"10.1007\/978-3-030-34869-4_39"},{"key":"397_CR6","doi-asserted-by":"crossref","unstructured":"Rocha M, Neves J (1999) Preventing premature convergence to local optima in genetic algorithms via random offspring generation. In: Proceedings of international conference on industrial and engineering applications of artificial intelligence and expert systems: multiple approaches to intelligent systems, pp 127\u2013136 1999.","DOI":"10.1007\/978-3-540-48765-4_16"},{"issue":"2","key":"397_CR7","first-page":"53","volume":"2","author":"SN Kumbharana","year":"2013","unstructured":"Kumbharana SN, Pandey GM (2013) Solving travelling salesman problem using firefly algorithm. Int J Res Sci Adv Technol (IJRSAT) 2(2):53\u201357","journal-title":"Int J Res Sci Adv Technol (IJRSAT)"},{"key":"397_CR8","first-page":"97","volume":"2","author":"D Weyland","year":"2015","unstructured":"Weyland D (2015) A critical analysis of the harmony search algorithm\u2014how not to solve Sudoku. Oper Res Perspect 2:97\u2013105","journal-title":"Oper Res Perspect"},{"key":"397_CR9","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.asoc.2016.03.020","volume":"45","author":"G Singh","year":"2016","unstructured":"Singh G, Kusum D (2016) A new membrane algorithm using the rules of particle swarm optimization incorporated within the framework of cell-like P-systems to solve Sudoku. Appl Soft Comput 45:27\u201339","journal-title":"Appl Soft Comput"},{"key":"397_CR10","doi-asserted-by":"crossref","unstructured":"Jana S, Dey A, Maji AK, Pal RK (2020) Solving Sudoku using neighbourhood-based mutation. Accepted in Applied Computation, and Security Systems (ACSS). Springer India","DOI":"10.1007\/978-981-16-4287-6_11"},{"key":"397_CR11","unstructured":"Das KN, Bhatia S, Puri S, Deep K (2012) A retrievable GA for solving Sudoku puzzles. Technical Report, Department of Electrical Engineering, IIT, Roorkee"},{"key":"397_CR12","unstructured":"Mehran S, Fatemi B (2014) A retrievable genetic algorithm for efficient solving of Sudoku puzzles. In: Proceedings of International Journal of Computer, Electrical, Automation, Control and Information Engineering, vol 8. World Academy of Science, Engineering and Technology, pp 736\u2013740 2014."},{"issue":"4","key":"397_CR13","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1007\/s13198-017-0620-x","volume":"9","author":"A Assad","year":"2018","unstructured":"Assad A, Kusum D (2018) Harmony search based mimetic algorithms for solving Sudoku. Int J Syst Assur Eng Manag 9(4):741\u2013754","journal-title":"Int J Syst Assur Eng Manag"},{"key":"397_CR14","doi-asserted-by":"crossref","unstructured":"Mantere T, Koljonen J (2007) Solving, rating, and generating Sudoku puzzles with GA. In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC), pp 1382\u20131389","DOI":"10.1109\/CEC.2007.4424632"},{"key":"397_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2017\/8034573","volume":"2017","author":"A Ritthipakdee","year":"2017","unstructured":"Ritthipakdee A, Thammano A, Premasathian N, Jitkongchuen D (2017) Firefly mating algorithm for continuous optimisation problems. Comput Intell Neurosci 2017:1\u201310","journal-title":"Comput Intell Neurosci"},{"key":"397_CR16","unstructured":"http:\/\/www.puzzles.ca\/Sudoku.html"},{"key":"397_CR17","doi-asserted-by":"crossref","unstructured":"Maji AK, Pal RK (2014) Sudoku solver using minigrid based backtracking. In: Proceedings of the IEEE International Advance Computing Conference (IACC), pp 33\u201344, Gurgaon, India","DOI":"10.1109\/IAdCC.2014.6779291"},{"key":"397_CR18","unstructured":"Waters DI (2008) Sudokube: using genetic algorithms to simultaneously solve multiple combinatorial problems. MS Thesis, Graduate College of the Oklahoma State University, May 2008"}],"container-title":["Innovations in Systems and Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11334-021-00397-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11334-021-00397-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11334-021-00397-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T11:56:13Z","timestamp":1672228573000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11334-021-00397-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,24]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["397"],"URL":"https:\/\/doi.org\/10.1007\/s11334-021-00397-4","relation":{},"ISSN":["1614-5046","1614-5054"],"issn-type":[{"value":"1614-5046","type":"print"},{"value":"1614-5054","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,24]]},"assertion":[{"value":"18 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 April 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 May 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}