{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:17:17Z","timestamp":1781104637327,"version":"3.54.1"},"reference-count":42,"publisher":"IGI Global Scientific Publishing","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7,1]]},"abstract":"<p>The graph coloring problem (GCP) is one of the most interesting classical combinatorial optimization problems in graph theory. It is known to be an NP-Hard problem, so many heuristic algorithms have been employed to solve this problem. In this article, the authors propose a new enhanced binary dragonfly algorithm to solve the graph coloring problem. The binary dragonfly algorithm has been enhanced by introducing two modifications. First, the authors use the Gaussian distribution random selection method for choosing the right value of the inertia weight w used to update the step vector (\u2206X). Second, the authors adopt chaotic maps to determine the random parameters s, a, c, f, and e. The aim of these modifications is to improve the performance and the efficiency of the binary dragonfly algorithm and ensure the diversity of solutions. The authors consider the well-known DIMACS benchmark graph coloring instances to evaluate the performance of their algorithm. The simulation results reveal the effectiveness and the successfulness of the proposed algorithm in comparison with some well-known algorithms in the literature.<\/p>","DOI":"10.4018\/ijsir.2019070102","type":"journal-article","created":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T13:18:08Z","timestamp":1559567888000},"page":"23-45","source":"Crossref","is-referenced-by-count":15,"title":["Solving Graph Coloring Problem Using an Enhanced Binary Dragonfly Algorithm"],"prefix":"10.4018","volume":"10","author":[{"given":"Karim","family":"Baiche","sequence":"first","affiliation":[{"name":"Applied Automation Laboratory, University of MHamed Bougara Boumerdes, Boumerdes, Algeria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3735-7797","authenticated-orcid":true,"given":"Yassine","family":"Meraihi","sequence":"additional","affiliation":[{"name":"Department of Automation, Applied Automation Laboratory, University of M'Hamed Bougara Boumerdes, Boumerdes, Algeria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8523-3986","authenticated-orcid":true,"given":"Manolo Dulva","family":"Hina","sequence":"additional","affiliation":[{"name":"ECE Paris School of Engineering, Paris, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Amar","family":"Ramdane-Cherif","sequence":"additional","affiliation":[{"name":"LISV Laboratory, University of Versailles St-Quentin-en-Yvelines, Versailles, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammed","family":"Mahseur","sequence":"additional","affiliation":[{"name":"University of Sciences and Technology Houari Boumediene, Bab Ezzouar, Algeria"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"IJSIR.2019070102-0","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-013-0429-5"},{"key":"IJSIR.2019070102-1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63315-2_43"},{"key":"IJSIR.2019070102-2","doi-asserted-by":"crossref","unstructured":"Agrawal, J., & Agrawal, S. (2015). Acceleration based particle swarm optimization for graph coloring problem. Procedia Computer Science, 60, 714-721.","DOI":"10.1016\/j.procs.2015.08.223"},{"key":"IJSIR.2019070102-3","doi-asserted-by":"publisher","DOI":"10.1080\/00207217.2017.1407964"},{"key":"IJSIR.2019070102-4","doi-asserted-by":"publisher","DOI":"10.1145\/359094.359101"},{"key":"IJSIR.2019070102-5","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2006.07.012"},{"key":"IJSIR.2019070102-6","doi-asserted-by":"publisher","DOI":"10.1016\/0096-0551(81)90048-5"},{"key":"IJSIR.2019070102-7","doi-asserted-by":"crossref","unstructured":"Chen, K., & Kanoh, H. (2017). A discrete firefly algorithm based on similarity for graph coloring problems. In 2017 18th IEEE\/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel\/Distributed Computing (SNPD) (pp. 65-70).","DOI":"10.1109\/SNPD.2017.8022702"},{"key":"IJSIR.2019070102-8","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2009.11.014"},{"key":"IJSIR.2019070102-9","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(85)90167-5"},{"key":"IJSIR.2019070102-10","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00105-5"},{"key":"IJSIR.2019070102-11","doi-asserted-by":"crossref","unstructured":"Djelloul, H., Sabba, S., & Chikhi, S. (2014). Binary bat algorithm for graph coloring problem. In 2014 Second World Conference on Complex Systems (WCCS) (pp. 481-486). IEEE.","DOI":"10.1109\/ICoCS.2014.7060988"},{"key":"IJSIR.2019070102-12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksues.2013.04.001"},{"key":"IJSIR.2019070102-13","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601830"},{"issue":"1","key":"IJSIR.2019070102-14","first-page":"41","article-title":"Proposing a new algorithm based on bees behavior for solving graph coloring.","volume":"6","author":"M.Faraji","year":"2011","journal-title":"International Journal of Contemporary Mathematical Sciences"},{"key":"IJSIR.2019070102-15","doi-asserted-by":"publisher","DOI":"10.1109\/T-VT.1986.24063"},{"key":"IJSIR.2019070102-16","doi-asserted-by":"publisher","DOI":"10.1109\/TCS.1976.1084138"},{"key":"IJSIR.2019070102-17","doi-asserted-by":"publisher","DOI":"10.1016\/j.cmpb.2017.11.021"},{"key":"IJSIR.2019070102-18","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-015-2037-2"},{"key":"IJSIR.2019070102-19","doi-asserted-by":"publisher","DOI":"10.1007\/BF02239976"},{"key":"IJSIR.2019070102-20","doi-asserted-by":"publisher","DOI":"10.1007\/s10015-016-0342-1"},{"key":"IJSIR.2019070102-21","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2007.10.049"},{"key":"IJSIR.2019070102-22","first-page":"74","article-title":"Chaotic fruit fly optimization algorithm.","author":"X.Lei","year":"2014","journal-title":"International Conference in Swarm Intelligence"},{"key":"IJSIR.2019070102-23","doi-asserted-by":"publisher","DOI":"10.6028\/jres.084.024"},{"key":"IJSIR.2019070102-24","doi-asserted-by":"crossref","unstructured":"Lotfi, V., & Sarin, S. (1986). A graph coloring algorithm for large scale scheduling problems. Computers \\& operations research, 13(1), 27-32.","DOI":"10.1016\/0305-0548(86)90061-4"},{"key":"IJSIR.2019070102-25","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2009.07.016"},{"key":"IJSIR.2019070102-26","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2008.03.050"},{"key":"IJSIR.2019070102-27","doi-asserted-by":"crossref","unstructured":"Mafarja, M. M., Eleyan, D., Jaber, I., Hammouri, A., & Mirjalili, S. (2017). Binary dragonfly algorithm for feature selection. In 2017 International Conference on New Trends in Computing Sciences (ICTCS) (pp. 12-17).","DOI":"10.1109\/ICTCS.2017.43"},{"key":"IJSIR.2019070102-28","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.04.020"},{"issue":"2","key":"IJSIR.2019070102-29","first-page":"37","article-title":"Noise reduction in VLSI circuits using modified GA based graph coloring.","volume":"3","author":"T.Maitra","year":"2010","journal-title":"International Journal of Control and Automation"},{"key":"IJSIR.2019070102-30","doi-asserted-by":"publisher","DOI":"10.1007\/s13369-017-2686-9"},{"key":"IJSIR.2019070102-31","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-015-1920-1"},{"key":"IJSIR.2019070102-32","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-013-1525-5"},{"issue":"4","key":"IJSIR.2019070102-33","first-page":"273","article-title":"Optimization of distribution network reconfiguration using dragonfly algorithm.","volume":"16","author":"A. S.Reddy","year":"2016","journal-title":"Journal of Electrical Engineering"},{"key":"IJSIR.2019070102-34","unstructured":"Sambandam, R. K., & Jayaraman, S. (2016). Self-adaptive dragonfly based optimal thresholding for multilevel segmentation of digital images. Journal of King Saud University-Computer and Information Sciences."},{"key":"IJSIR.2019070102-35","doi-asserted-by":"publisher","DOI":"10.1080\/00207219408926037"},{"key":"IJSIR.2019070102-36","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(98)80006-4"},{"key":"IJSIR.2019070102-37","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-016-0514-9"},{"key":"IJSIR.2019070102-38","doi-asserted-by":"crossref","unstructured":"Tamiru, A., & Hashim, F. (2013). Application of bat algorithm and fuzzy systems to model exergy changes in a gas turbine. In Artificial intelligence, evolutionary computing and metaheuristics (pp. 685-719).","DOI":"10.1007\/978-3-642-29694-9_26"},{"key":"IJSIR.2019070102-39","doi-asserted-by":"publisher","DOI":"10.1088\/1757-899X\/310\/1\/012154"},{"key":"IJSIR.2019070102-40","doi-asserted-by":"publisher","DOI":"10.1109\/26.120165"},{"key":"IJSIR.2019070102-41","doi-asserted-by":"publisher","DOI":"10.1007\/s10470-015-0548-5"}],"container-title":["International Journal of Swarm Intelligence Research"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=230976","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,6]],"date-time":"2022-05-06T16:57:27Z","timestamp":1651856247000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJSIR.2019070102"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2019,7,1]]},"references-count":42,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,7]]}},"URL":"https:\/\/doi.org\/10.4018\/ijsir.2019070102","relation":{},"ISSN":["1947-9263","1947-9271"],"issn-type":[{"value":"1947-9263","type":"print"},{"value":"1947-9271","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7,1]]}}}