{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T08:02:22Z","timestamp":1761897742756,"version":"3.37.3"},"reference-count":71,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,7,8]],"date-time":"2022-07-08T00:00:00Z","timestamp":1657238400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,7,8]],"date-time":"2022-07-08T00:00:00Z","timestamp":1657238400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U21A20464"],"award-info":[{"award-number":["U21A20464"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"crossref","award":["62066005"],"award-info":[{"award-number":["62066005"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Project of Innovation Project of Guangxi Graduate","award":["YCSW2021157"],"award-info":[{"award-number":["YCSW2021157"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s10489-022-03791-y","type":"journal-article","created":{"date-parts":[[2022,7,8]],"date-time":"2022-07-08T09:03:24Z","timestamp":1657271004000},"page":"6372-6400","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Enhanced discrete dragonfly algorithm for solving four-color map problems"],"prefix":"10.1007","volume":"53","author":[{"given":"Lianlian","family":"Zhong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4404-952X","authenticated-orcid":false,"given":"Yongquan","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guo","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qifang","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,8]]},"reference":[{"key":"3791_CR1","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.1007\/s00521-015-1920-1","volume":"27","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S (2016) Dragonfly algorithm: a new meta-heuristic optimization technique for solving single-objective, discrete, and multi-objective problems. Neural Comput & Applic 27:1053\u20131073","journal-title":"Neural Comput & Applic"},{"key":"3791_CR2","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.knosys.2018.06.001","volume":"159","author":"D Gaurav","year":"2018","unstructured":"Gaurav D, Vijay K (2018) Emperor penguin optimizer: A bio-inspired algorithm for engineering problems. Knowl-Based Syst 159:20\u201350","journal-title":"Knowl-Based Syst"},{"key":"3791_CR3","doi-asserted-by":"publisher","first-page":"e6054","DOI":"10.1002\/cpe.6054","volume":"33","author":"L Zhong","year":"2021","unstructured":"Zhong L, Zhou Y, Luo Q, Zhong K (2021) Wind driven dragonfly algorithm for global optimization. Concurrency and Computation: Practice and Experience 33:e6054","journal-title":"Concurrency and Computation: Practice and Experience"},{"key":"3791_CR4","first-page":"1","volume":"5","author":"K Hussain","year":"2018","unstructured":"Hussain K, Salleh M, Shi C, Shi Y (2018) Metaheuristic research: a comprehensive survey. Artif Intell Rev 5:1\u201343","journal-title":"Artif Intell Rev"},{"doi-asserted-by":"publisher","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. Proceedings of the IEEE International Conference on Neural Networks 4:1942\u20131948. https:\/\/doi.org\/10.1109\/ICNN.1995.488968","key":"3791_CR5","DOI":"10.1109\/ICNN.1995.488968"},{"key":"3791_CR6","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","volume":"69","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili S, Mirjalili SM, Lewis A (2014) Grey wolf optimizer. Adv Eng Softw 69:46\u201361","journal-title":"Adv Eng Softw"},{"key":"3791_CR7","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/s00500-018-3102-4","volume":"23","author":"S Arora","year":"2019","unstructured":"Arora S, Singh S (2019) Butterfly optimization algorithm: a novel approach for global optimization. Soft Comput 23:715\u2013734","journal-title":"Soft Comput"},{"issue":"1","key":"3791_CR8","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1038\/scientificamerican0792-66","volume":"267","author":"JH Holland","year":"1992","unstructured":"Holland JH (1992) Genetic algorithms. Sci Am 267(1):66\u201372","journal-title":"Sci Am"},{"key":"3791_CR9","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn R, Price K (1997) Differential evolution-A simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11:341\u2013359","journal-title":"J Glob Optim"},{"key":"3791_CR10","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"266","author":"L Adleman","year":"1994","unstructured":"Adleman L (1994) Molecular computation of solutions to combinatorial problems. Science 266:1021\u20131024","journal-title":"Science"},{"unstructured":"Macato P, Norman M, (1992) A memetic approach for the traveling salesman problem implementation of a computational ecology for combinatorial optimization on messade-passing systems. https:\/\/citeseerx.ist.psu.edu\/viewdoc\/download?doi=10.1.1.50.1940&rep=rep1&type=pdf","key":"3791_CR11"},{"key":"3791_CR12","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1109\/3468.867862","volume":"30","author":"L Jiao","year":"2000","unstructured":"Jiao L, Wang L (2000) A novel genetic algorithm based on immunity. IEEE Transactions on Systems, Man & Cybernetics: Part A 30:552\u2013561","journal-title":"IEEE Transactions on Systems, Man & Cybernetics: Part A"},{"key":"3791_CR13","first-page":"7","volume-title":"Simulated annealing: theory and applications","author":"P Van","year":"1987","unstructured":"Van P, Aarts E (1987) Simulated annealing. In: Simulated annealing: theory and applications. Springer, Dordrecht, pp 7\u201315"},{"doi-asserted-by":"crossref","unstructured":"Bayraktar Z, Komurcu M, Werner DH (2010) Wind Driven Optimization (WDO): A novel nature-inspired optimization algorithm and its application to electromagnetics. Antennas & Propagation Society International Symposium IEEE, 11-17 July 2010, Toronto","key":"3791_CR14","DOI":"10.1109\/APS.2010.5562213"},{"key":"3791_CR15","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.knosys.2015.12.022","volume":"96","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S (2016) SCA: A sine cosine algorithm for solving optimization problems. Knowl-Based Syst 96:120\u2013133","journal-title":"Knowl-Based Syst"},{"key":"3791_CR16","doi-asserted-by":"publisher","first-page":"113308","DOI":"10.1016\/j.eswa.2020.113308","volume":"149","author":"YA Anita","year":"2020","unstructured":"Anita YA, Kumar N (2020) Artificial electric field algorithm for engineering optimization problems. Expert Syst Appl 149:113308","journal-title":"Expert Syst Appl"},{"key":"3791_CR17","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1109\/TEVC.2009.2033580","volume":"14","author":"AYS Lam","year":"2010","unstructured":"Lam AYS, Li VOK (2010) Chemical-reaction-inspired metaheuristic for optimization. IEEE Trans Evol Comput 14:381\u2013399","journal-title":"IEEE Trans Evol Comput"},{"key":"3791_CR18","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.cad.2010.12.015","volume":"43","author":"RV Rao","year":"2011","unstructured":"Rao RV, Savsani VJ, Vakharia DP (2011) Teaching\u2013learning-based optimization: A novel method for constrained mechanical design optimization problems. Computer Aided Design 43:303\u2013315","journal-title":"Computer Aided Design"},{"key":"3791_CR19","doi-asserted-by":"publisher","first-page":"105709","DOI":"10.1016\/j.knosys.2020.105709","volume":"195","author":"A Qamar","year":"2020","unstructured":"Qamar A, Younas I, Saeed M (2020) Political optimizer: A novel socio-inspired meta-heuristic for global optimization. Knowl-Based Syst 195:105709","journal-title":"Knowl-Based Syst"},{"key":"3791_CR20","doi-asserted-by":"publisher","first-page":"106503","DOI":"10.1016\/j.asoc.2020.106503","volume":"95","author":"B Esref","year":"2020","unstructured":"Esref B, Beyhan S (2020) Adolescent identity search algorithm (AISA): A novel metaheuristic approach for solving optimization problems. Appl Soft Comput 95:106503","journal-title":"Appl Soft Comput"},{"key":"3791_CR21","first-page":"139","volume":"20","author":"REHH Bouchekara","year":"2020","unstructured":"Bouchekara REHH (2020) Most valuable player algorithm: a novel optimization algorithm inspired from sport. Oper Res 20:139\u2013195","journal-title":"Oper Res"},{"key":"3791_CR22","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1057\/palgrave.jors.2601830","volume":"56","author":"KA Thompson","year":"2005","unstructured":"Thompson KA, Dowslandj M (2005) Ant Colony optimization for the examination scheduling problem. J Oper Res Soc 56:426\u2013438","journal-title":"J Oper Res Soc"},{"key":"3791_CR23","volume-title":"Bioinspired Optimization Methods and Their Applications. BIOMA 2018. Lecture notes in computer science, vol. 10835","author":"L Brezonik","year":"2018","unstructured":"Brezonik L, Fister I, Podgorelec V (2018) Scrum Task Allocation Based on Particle Swarm Optimization. In: Koro\u0161ec P, Melab N, Talbi EG (eds) Bioinspired Optimization Methods and Their Applications. BIOMA 2018. Lecture notes in computer science, vol. 10835. Springer, Cham"},{"key":"3791_CR24","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.procs.2015.12.059","volume":"73","author":"B Meriem","year":"2015","unstructured":"Meriem B, Guidoum N, SaiDouni DE (2015) A new and fast evolutionary algorithm for strict strong graph coloring problem. Procedia Computer Science 73:138\u2013145","journal-title":"Procedia Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Sarma SS, Mondal R, Seth A (1995) Some sequential graph coloring algorithms for restricted channel routing. Int J Electron 77(1):81\u201393","key":"3791_CR25","DOI":"10.1080\/00207219408926037"},{"key":"3791_CR26","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/s40314-019-0773-0","volume":"38","author":"S Naz","year":"2019","unstructured":"Naz S, Akram M (2019) Novel decision-making approach based on hesitant fuzzy sets and graph theory. Comput Appl Math 38:7","journal-title":"Comput Appl Math"},{"key":"3791_CR27","doi-asserted-by":"publisher","first-page":"1950016","DOI":"10.1142\/S1793830919500162","volume":"11","author":"S Barman","year":"2019","unstructured":"Barman S, Pal M, Mondal S (2019) An optimal algorithm to find minimum k -hop dominating set of interval graphs. Discrete Mathematics Algorithms and Applications 11:1950016","journal-title":"Discrete Mathematics Algorithms and Applications"},{"unstructured":"Garey MR, Johnson DS, (1979) Computers and intractability: a guide to the theory of NP-completeness, W. H. Freeman. & Co. Subs. of Scientific American, Inc., New York","key":"3791_CR28"},{"key":"3791_CR29","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.cor.2018.02.009","volume":"94","author":"N Leite","year":"2018","unstructured":"Leite N, Fernandes CM, Mel\u00edcio F, Rosa AC (2018) A cellular memetic algorithm for the examination timetabling problem. Comput Oper Res 94:118\u2013138","journal-title":"Comput Oper Res"},{"issue":"6","key":"3791_CR30","doi-asserted-by":"publisher","first-page":"489","DOI":"10.6028\/jres.084.024","volume":"84","author":"FT Leighton","year":"1979","unstructured":"Leighton FT (1979) A graph coloring algorithm for large scheduling problems. Journal of Research of the National Bureau of Standards (United States) 84(6):489\u2013506","journal-title":"Journal of Research of the National Bureau of Standards (United States)"},{"key":"3791_CR31","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/T-VT.1986.24063","volume":"35","author":"A Gamst","year":"2006","unstructured":"Gamst A (2006) Some lower bounds for a class of frequency assignment problems. IEEE Trans Veh Technol 35:8\u201314","journal-title":"IEEE Trans Veh Technol"},{"key":"3791_CR32","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/88616.88621","volume":"12","author":"FC Chow","year":"1990","unstructured":"Chow FC, Hennessy JL (1990) The priority-based coloring approach to register allocation. ACM Transactions on Programming Languages & Systems 12:501\u2013536","journal-title":"ACM Transactions on Programming Languages & Systems"},{"key":"3791_CR33","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1016\/j.procs.2018.08.024","volume":"126","author":"M Assi","year":"2018","unstructured":"Assi M, Halawi B, Haraty RA (2018) Genetic algorithm analysis using the graph coloring method for solving the university timetable problem. Procedia Computer Science 126:899\u2013906","journal-title":"Procedia Computer Science"},{"key":"3791_CR34","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1109\/T-C.1974.224018","volume":"23","author":"BS Akers Jr","year":"1974","unstructured":"Akers BS Jr (1974) Fault diagnosis as a graph coloring problem. IEEE Trans Comput 23:706\u2013713","journal-title":"IEEE Trans Comput"},{"key":"3791_CR35","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10951-008-0066-8","volume":"11","author":"N Zufferey","year":"2008","unstructured":"Zufferey N, Amstutz P, Giaccari P (2008) Graph colouring approaches for a satellite range scheduling problem. J Sched 11:263\u2013277","journal-title":"J Sched"},{"key":"3791_CR36","doi-asserted-by":"publisher","first-page":"1794","DOI":"10.1109\/26.120165","volume":"39","author":"TK Woo","year":"2002","unstructured":"Woo TK, Su SYW, Newman-Wolfe R (2002) Resource allocation in a dynamically partitionable bus network using a graph coloring algorithm. IEEE Trans Commun 39:1794\u20131801","journal-title":"IEEE Trans Commun"},{"key":"3791_CR37","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.neucom.2013.03.064","volume":"132","author":"RR Israel","year":"2014","unstructured":"Israel RR, Gra\u00f1a M (2014) An empirical evaluation of gravitational swarm intelligence for graph coloring algorithm. Neurocomputing 132:79\u201384","journal-title":"Neurocomputing"},{"key":"3791_CR38","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/S0012-365X(98)00169-1","volume":"195","author":"M Dror","year":"1999","unstructured":"Dror M, Finke G (1999) On the complexity of a restricted list-coloring problem. Discret Math 195:103\u2013109","journal-title":"Discret Math"},{"key":"3791_CR39","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1016\/j.procs.2015.08.223","volume":"60","author":"J Agrawal","year":"2015","unstructured":"Agrawal J, Agrawal S (2015) Acceleration based particle swarm optimization for graph coloring problem. Procedia Computer Science 60:714\u2013721","journal-title":"Procedia Computer Science"},{"key":"3791_CR40","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.cam.2015.04.030","volume":"293","author":"S Fidanova","year":"2016","unstructured":"Fidanova S, Pop P (2016) An improved hybrid ant-local search algorithm for the partition graph coloring problem. J Comput Appl Math 293:55\u201361","journal-title":"J Comput Appl Math"},{"key":"3791_CR41","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.asoc.2015.04.020","volume":"33","author":"S Mahmoudi","year":"2015","unstructured":"Mahmoudi S, Lotfi S (2015) Modified cuckoo optimization algorithm (MCOA) to solve graph coloring problem. Appl Soft Comput 33:48\u201364","journal-title":"Appl Soft Comput"},{"key":"3791_CR42","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/j.ejor.2014.05.011","volume":"240","author":"D Marc","year":"2015","unstructured":"Marc D, Ekim T, Bernard R, Cerasela T (2015) On some applications of the selective graph coloring problem. Eur J Oper Res 240:307\u2013314","journal-title":"Eur J Oper Res"},{"key":"3791_CR43","volume-title":"Discrete particle swarm optimization algorithm for solving graph coloring problem","author":"Z Kai","year":"2015","unstructured":"Kai Z, Zhu W, Liu J, He J (2015) Discrete particle swarm optimization algorithm for solving graph coloring problem. Springer, Berlin Heidelberg"},{"key":"3791_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1166\/jctn.2015.4322","volume":"12","author":"R Wang","year":"2015","unstructured":"Wang R, Zhou Y (2015) Local greedy flower pollination algorithm for solving planar graph coloring problem. J Comput Theor Nanosci 12:1\u201310","journal-title":"J Comput Theor Nanosci"},{"key":"3791_CR45","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1016\/j.eswa.2016.07.047","volume":"64","author":"Y Zhou","year":"2016","unstructured":"Zhou Y, Hao J, Duval B (2016) Reinforcement learning based local search for grouping problems: A case study on graph coloring. Expert Systems with Application 64:412\u2013422","journal-title":"Expert Systems with Application"},{"doi-asserted-by":"publisher","unstructured":"Chen K, Kanoh H (2016) A discrete artificial bee Colony algorithm based on similarity for graph coloring problems. In: 5th International Conference on the Theory and Practice of Natural Computing (TPNC), 2016-12-12 to 2016-12-13. https:\/\/doi.org\/10.1007\/978-3-319-49001-4_6","key":"3791_CR46","DOI":"10.1007\/978-3-319-49001-4_6"},{"key":"3791_CR47","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.eswa.2017.01.010","volume":"74","author":"MA Mosa","year":"2017","unstructured":"Mosa MA, Hamouda A, Marei M (2017) Graph coloring and ACO based summarization for social networks. Expert Syst Appl 74:115\u2013126","journal-title":"Expert Syst Appl"},{"key":"3791_CR48","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10589-016-9862-9","volume":"66","author":"SF Gal\u00e1n","year":"2017","unstructured":"Gal\u00e1n SF (2017) Simple decentralized graph coloring. Comput Optim Appl 66:163\u2013185","journal-title":"Comput Optim Appl"},{"key":"3791_CR49","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1016\/j.dam.2016.09.006","volume":"2","author":"B Y\u00fcceoglu","year":"2017","unstructured":"Y\u00fcceoglu B, G\u00fcvenc S, Van Hoesel SPM (2017) A column generation based algorithm for the robust graph coloring problem. Discrete Applied Mathematics, Part 2:340\u2013352","journal-title":"Discrete Applied Mathematics, Part"},{"key":"3791_CR50","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/j.jocs.2017.10.005","volume":"24","author":"MR Mirsaleh","year":"2017","unstructured":"Mirsaleh MR, Meybodi MR, Michigan A (2017) Memetic algorithm for solving the vertex coloring problem. Journal of Computational Science 24:389\u2013401","journal-title":"Journal of Computational Science"},{"key":"3791_CR51","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.dam.2016.09.018","volume":"217","author":"C Denis","year":"2017","unstructured":"Denis C, Furini F, Malaguti E (2017) Solving vertex coloring problems as maximum weight stable set problems. Discret Appl Math 217:151\u2013162","journal-title":"Discret Appl Math"},{"doi-asserted-by":"crossref","unstructured":"Chen K, Kanoh H (2017) A discrete firefly algorithm based on similarity for graph coloring problems. IEEE\u00a0SNPD 2017, June 26-28, 2017, Kanazawa, Japan","key":"3791_CR52","DOI":"10.1109\/SNPD.2017.8022702"},{"key":"3791_CR53","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s11228-017-0461-4","volume":"26","author":"FJ Arag\u00f3n Artacho","year":"2018","unstructured":"Arag\u00f3n Artacho FJ, Campoy R (2018) Solving graph coloring problems with the Douglas-Rachford algorithm. Set-Valued and Variational Analysis 26:277\u2013304","journal-title":"Set-Valued and Variational Analysis"},{"key":"3791_CR54","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.eng.2018.02.011","volume":"4","author":"J Xu","year":"2018","unstructured":"Xu J, Qiang X, Zhang K, Zhang C, Yang J (2018) A DNA computing model for the graph vertex coloring problem based on a probe graph. Engineering 4:61\u201377","journal-title":"Engineering"},{"key":"3791_CR55","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1016\/j.asoc.2018.01.027","volume":"65","author":"Y Zhou","year":"2018","unstructured":"Zhou Y, Beatrice D, Hao J (2018) Improving probability learning based local search for graph coloring. Appl Soft Comput 65:542\u2013553","journal-title":"Appl Soft Comput"},{"key":"3791_CR56","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/s13369-017-2686-9","volume":"43","author":"R Marappan","year":"2018","unstructured":"Marappan R, Sethumadhavan G (2018) Solution to graph coloring using genetic and Tabu search procedures. Arab J Sci Eng 43:525\u2013542","journal-title":"Arab J Sci Eng"},{"issue":"1","key":"3791_CR57","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10732-017-9354-9","volume":"24","author":"L Moalic","year":"2018","unstructured":"Moalic L, Gondran A (2018) Variations on memetic algorithms for graph coloring problems. J Heuristics 24(1):1\u201324","journal-title":"J Heuristics"},{"key":"3791_CR58","first-page":"104850","volume":"120","author":"M Taha","year":"2019","unstructured":"Taha M, Khiyabani FM, Navimipour NJ (2019) A systematic study on meta-heuristic approaches for solving the graph coloring problem. Comput Oper Res 120:104850","journal-title":"Comput Oper Res"},{"doi-asserted-by":"crossref","unstructured":"Meraihi Y, Ramdane-Cherif A, Mahseur M, Achelia D (2019) A chaotic binary Salp swarm algorithm for solving the graph coloring problem. In: Proceedings of the 5th International Symposium, MISC 2018, December 16\u201318, 2018, Laghouat","key":"3791_CR59","DOI":"10.1007\/978-3-030-05481-6_8"},{"key":"3791_CR60","doi-asserted-by":"publisher","first-page":"106581","DOI":"10.1016\/j.knosys.2020.106581","volume":"212","author":"O Goudet","year":"2020","unstructured":"Goudet O, Duval B, Hao JK (2020) Population-based gradient descent weight learning for graph coloring problems. Knowl-Based Syst 212:106581","journal-title":"Knowl-Based Syst"},{"key":"3791_CR61","doi-asserted-by":"publisher","first-page":"23","DOI":"10.4018\/IJSIR.2019070102","volume":"10","author":"B Karim","year":"2019","unstructured":"Karim B et al (2019) Solving graph coloring problem using an enhanced binary dragonfly algorithm. International journal of swarm intelligence research 10:23\u201345","journal-title":"International journal of swarm intelligence research"},{"issue":"1","key":"3791_CR62","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1504\/IJBIC.2020.109000","volume":"16","author":"AF da Silva","year":"2020","unstructured":"da Silva AF, Rodriguez LGA, Filho JF (2020) The improved ColourAnt algorithm: a hybrid algorithm for solving the graph colouring problem. International Journal of Bio-Inspired Computation 16(1):1\u201312","journal-title":"International Journal of Bio-Inspired Computation"},{"doi-asserted-by":"crossref","unstructured":"Yassine, M, Mahseur, M, Acheli, D (2020) A modified binary crow search algorithm for solving the graph coloring problem. Int J Appl Evolu Comput (IJAEC) 11(2):1\u201319","key":"3791_CR63","DOI":"10.4018\/IJAEC.2020040103"},{"key":"3791_CR64","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ejor.2020.09.017","volume":"291","author":"A Oe","year":"2021","unstructured":"Oe A, Te B, Zct B (2021) An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs. Eur J Oper Res 291:67\u201383","journal-title":"Eur J Oper Res"},{"key":"3791_CR65","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s10489-020-01636-0","volume":"50","author":"R Zhao","year":"2020","unstructured":"Zhao R, Wang Y, Liu C, Hu P, Li H (2020) Discrete selfish herd optimizer for solving graph coloring problem. Appl Intell 50:9\u20131656","journal-title":"Appl Intell"},{"key":"3791_CR66","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/s00500-019-04278-8","volume":"24","author":"B Abhirup","year":"2020","unstructured":"Abhirup B, Dhar AK, Basu S (2020) Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks. Soft Comput 24:603\u2013625","journal-title":"Soft Comput"},{"doi-asserted-by":"publisher","unstructured":"Dokeroglu T, Sevinc E (2021) Memetic teaching-learning-based optimization algorithms for large graph coloring problems Eng Appl Artif Intell. https:\/\/doi.org\/10.1016\/j.engappai.2021.104282","key":"3791_CR67","DOI":"10.1016\/j.engappai.2021.104282"},{"key":"3791_CR68","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1109\/TEVC.2008.927706","volume":"13","author":"AK Qin","year":"2009","unstructured":"Qin AK, Huang VL, Suguanthan PN (2009) Differential Evolution Algorithm With Strategy Adaptation for Global Numerical Optimization. IEEE trans. On Evolutionary Computations 13:398\u2013417","journal-title":"On Evolutionary Computations"},{"unstructured":"Wei J Guangbin L, Dong L (2008) Elite particle swarm optimization with mutation. In: 2008 Asia Simulation Conference - 7th International Conference on System Simulation and Scientific Computing, 10-12 October 2008, Beijing","key":"3791_CR69"},{"key":"3791_CR70","first-page":"2395","volume":"8","author":"A Singh","year":"2015","unstructured":"Singh A, Singh R (2015) Enhanced PSO for graph coloring problem. International Research Journal of Engineering and Technology 8:2395\u20130072","journal-title":"International Research Journal of Engineering and Technology"},{"doi-asserted-by":"crossref","unstructured":"Marappan R, Sethumadhavan G (2021) Solving graph coloring problem using divide and conquer-based turbulent particle swarm optimization[J]. Arab J Sci Eng:1\u201318","key":"3791_CR71","DOI":"10.1007\/s13369-021-06323-x"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03791-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-022-03791-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03791-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,27]],"date-time":"2023-02-27T04:31:01Z","timestamp":1677472261000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-022-03791-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,8]]},"references-count":71,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["3791"],"URL":"https:\/\/doi.org\/10.1007\/s10489-022-03791-y","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2022,7,8]]},"assertion":[{"value":"18 May 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 July 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}