{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T16:44:53Z","timestamp":1781109893093,"version":"3.54.1"},"reference-count":41,"publisher":"IGI Global Scientific Publishing","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,4]]},"abstract":"<jats:p>The graph coloring problem (GCP) is a well-known classical combinatorial optimization problem in graph theory. It is known to be an NP-Hard problem, so many heuristic algorithms have been employed to solve this problem. This article proposes a modified binary crow search algorithm (MBCSA) to solve the graph coloring problem. First, the binary crow search algorithm is obtained from the original crow search algorithm using the V-shaped transfer function and the discretization method. Second, we use chaotic maps to choose the right values of the flight length (FL) and the awareness probability (AP). Third, we adopt the Gaussian distribution method to replace the random variables used for updating the position of the crows. The aim of these contributions is to avoid the premature convergence to local optima and ensure the diversity of the solutions. To evaluate the performance of our algorithm, we use the well-known DIMACS benchmark graph coloring instances. The simulation results reveal the efficiency of our proposed algorithm in comparison with other existing algorithms in the literature.<\/jats:p>","DOI":"10.4018\/ijaec.2020040103","type":"journal-article","created":{"date-parts":[[2020,2,7]],"date-time":"2020-02-07T14:36:56Z","timestamp":1581086216000},"page":"28-46","source":"Crossref","is-referenced-by-count":5,"title":["A Modified Binary Crow Search Algorithm for Solving the Graph Coloring Problem"],"prefix":"10.4018","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3735-7797","authenticated-orcid":true,"given":"Yassine","family":"Meraihi","sequence":"first","affiliation":[{"name":"University of M'Hamed Bougara, Boumerdes, Algeria"}],"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"}]},{"given":"Dalila","family":"Acheli","sequence":"additional","affiliation":[{"name":"University of M'Hamed Bougara, Boumerdes, Algeria"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"IJAEC.2020040103-0","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-013-0429-5"},{"key":"IJAEC.2020040103-1","doi-asserted-by":"crossref","unstructured":"Abdelaziz, A. Y., & Fathy, A. (2017). A novel approach based on crow search algorithm for optimal selection of conductor size in radial distribution networks. Engineering Science and Technology, an International Journal, 20(2), 391-402.","DOI":"10.1016\/j.jestch.2017.02.004"},{"key":"IJAEC.2020040103-2","doi-asserted-by":"publisher","DOI":"10.1109\/SMC.2015.341"},{"key":"IJAEC.2020040103-3","doi-asserted-by":"publisher","DOI":"10.1016\/j.compstruc.2016.03.001"},{"key":"IJAEC.2020040103-4","doi-asserted-by":"publisher","DOI":"10.1145\/359094.359101"},{"key":"IJAEC.2020040103-5","doi-asserted-by":"publisher","DOI":"10.1016\/0096-0551(81)90048-5"},{"key":"IJAEC.2020040103-6","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2009.11.014"},{"key":"IJAEC.2020040103-7","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(85)90167-5"},{"key":"IJAEC.2020040103-8","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00105-5"},{"key":"IJAEC.2020040103-9","doi-asserted-by":"publisher","DOI":"10.3390\/en11030571"},{"key":"IJAEC.2020040103-10","doi-asserted-by":"publisher","DOI":"10.4018\/ijaec.2014070103"},{"key":"IJAEC.2020040103-11","doi-asserted-by":"publisher","DOI":"10.1109\/AISP.2012.6313794"},{"key":"IJAEC.2020040103-12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksues.2013.04.001"},{"key":"IJAEC.2020040103-13","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601830"},{"issue":"1","key":"IJAEC.2020040103-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":"IJAEC.2020040103-15","doi-asserted-by":"publisher","DOI":"10.1109\/T-VT.1986.24063"},{"key":"IJAEC.2020040103-16","author":"M.Garey","year":"1979","journal-title":"A Guide to the Theory of NP-Completeness"},{"key":"IJAEC.2020040103-17","doi-asserted-by":"publisher","DOI":"10.1109\/TCS.1976.1084138"},{"key":"IJAEC.2020040103-18","unstructured":"Ge, F., Wei, Z., Tian, Y., & Huang, Z. (2010). Chaotic ant swarm for graph coloring. Proceedings of the 2010 IEEE International Conference on Intelligent Computing and Intelligent Systems (ICIS) (Vol. 1, pp. 512-516). IEEE Press."},{"key":"IJAEC.2020040103-19","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-015-2037-2"},{"key":"IJAEC.2020040103-20","doi-asserted-by":"publisher","DOI":"10.1007\/BF02239976"},{"key":"IJAEC.2020040103-21","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2017.10.001"},{"key":"IJAEC.2020040103-22","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2007.10.049"},{"key":"IJAEC.2020040103-23","doi-asserted-by":"crossref","unstructured":"Lei, X., Du, M., Xu, J., & Tan, Y. (2014). Chaotic fruit fly optimization algorithm. Proceedings of theInternational Conference in Swarm Intelligence (pp. 74-85). Academic Press.","DOI":"10.1007\/978-3-319-11857-4_9"},{"key":"IJAEC.2020040103-24","doi-asserted-by":"publisher","DOI":"10.6028\/jres.084.024"},{"key":"IJAEC.2020040103-25","doi-asserted-by":"publisher","DOI":"10.1016\/j.ecolind.2017.06.009"},{"key":"IJAEC.2020040103-26","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":"IJAEC.2020040103-27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2009.07.016"},{"key":"IJAEC.2020040103-28","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2008.03.050"},{"key":"IJAEC.2020040103-29","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.04.020"},{"key":"IJAEC.2020040103-30","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-013-1525-5"},{"key":"IJAEC.2020040103-31","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2017.02.042"},{"key":"IJAEC.2020040103-32","doi-asserted-by":"publisher","DOI":"10.4304\/jcp.6.6.1175-1182"},{"key":"IJAEC.2020040103-33","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2018.03.019"},{"key":"IJAEC.2020040103-34","first-page":"1","article-title":"Feature selection via a novel chaotic crow search algorithm.","author":"G. I.Sayed","year":"2017","journal-title":"Neural Computing & Applications"},{"key":"IJAEC.2020040103-35","unstructured":"Sheta, A. F. (2017). Solving the Economic Load Dispatch Problem Using Crow Search Algorithm. Proceedings of the 8th International Multi-Conference on Complexity, Informatics and Cybernetics (IMCIC 2017) (pp. 95-100). Academic Press."},{"key":"IJAEC.2020040103-36","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(98)80006-4"},{"key":"IJAEC.2020040103-37","doi-asserted-by":"publisher","DOI":"10.1109\/26.120165"},{"key":"IJAEC.2020040103-38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45049-9_95"},{"key":"IJAEC.2020040103-39","doi-asserted-by":"publisher","DOI":"10.1007\/s10470-015-0548-5"},{"key":"IJAEC.2020040103-40","doi-asserted-by":"publisher","DOI":"10.12785\/amis\/070249"}],"container-title":["International Journal of Applied Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=248489","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,5]],"date-time":"2022-05-05T18:00:08Z","timestamp":1651773608000},"score":1,"resource":{"primary":{"URL":"http:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJAEC.2020040103"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2020,4]]},"references-count":41,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.4018\/ijaec.2020040103","relation":{},"ISSN":["1942-3594","1942-3608"],"issn-type":[{"value":"1942-3594","type":"print"},{"value":"1942-3608","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4]]}}}