A Modified Binary Crow Search Algorithm for Solving the Graph Coloring Problem

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 t...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of applied evolutionary computation Ročník 11; číslo 2; s. 28 - 46
Hlavní autoři: Mahseur, Mohammed, Meraihi, Yassine, Acheli, Dalila
Médium: Journal Article
Jazyk:angličtina
Vydáno: Hershey IGI Global 01.04.2020
Témata:
Algorithms
Combinatorial analysis
Graph coloring
Graph theory
Heuristic methods
Normal distribution
Random variables
Search algorithms
Statistical analysis
Transfer functions
ISSN:1942-3594, 1942-3608
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract 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.
AbstractList 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.
Author Mahseur, Mohammed
Meraihi, Yassine
Acheli, Dalila
AuthorAffiliation University of Sciences and Technology Houari Boumediene, Bab Ezzouar, Algeria
University of M'Hamed Bougara, Boumerdes, Algeria
AuthorAffiliation_xml – name: University of M'Hamed Bougara, Boumerdes, Algeria
– name: University of Sciences and Technology Houari Boumediene, Bab Ezzouar, Algeria
Author_xml – sequence: 1
  givenname: Mohammed
  surname: Mahseur
  fullname: Mahseur, Mohammed
  organization: University of Sciences and Technology Houari Boumediene, Bab Ezzouar, Algeria
– sequence: 2
  givenname: Yassine
  surname: Meraihi
  fullname: Meraihi, Yassine
  organization: University of M'Hamed Bougara, Boumerdes, Algeria
– sequence: 3
  givenname: Dalila
  surname: Acheli
  fullname: Acheli, Dalila
  organization: University of M'Hamed Bougara, Boumerdes, Algeria
BookMark eNp9kN1PwjAUxRuDiYi8-9jEF1_Afq3bHueCiMGPBH1uuq1lJWPFbmj87y1OQ0LUvtze3nNOb36noFfbWgFwjtGYIRxdze6SSTomiCDke0SPQB_HjIwoR1Hv5x7E7AQMm2aF_AlYyELcBw8JvLeF0UYV8NrU0n3A1Nl3uFDS5SVMqqV1pi3XUFsHF7Z6M_UStqWCUyc3JUxt5ef-6cnZrFLrM3CsZdWo4XcdgJebyXN6O5o_TmdpMh_lBFO_C1YyUDHLNOOSF7lWFAUc6SykWSSR5kxrlmOJCh4VTGPFFVaqIAEjmkqZ0QG46HI3zr5uVdOKld262n8pSEzDkIaUEq_inSp3tmmc0iI3rWyNrVsnTSUwEjt84guf2OPzRnRg3Diz9nD-s0w7i1ma_TIdWdGRFTuyoiP7Vw7GPunyl6RDodgUmn4CUNeWug
CitedBy_id crossref_primary_10_1007_s10462_020_09911_9
crossref_primary_10_1007_s10489_022_03791_y
crossref_primary_10_1088_1742_6596_2157_1_012003
Cites_doi 10.1057/palgrave.jors.2601830
10.1016/j.chaos.2007.10.049
10.1109/SMC.2015.341
10.1016/S0377-2217(98)80006-4
10.1145/359094.359101
10.1007/s10470-015-0548-5
10.3390/en11030571
10.12785/amis/070249
10.1016/0305-0548(86)90061-4
10.1016/j.ejor.2008.03.050
10.1109/26.120165
10.1016/j.ejor.2009.07.016
10.1016/S0166-218X(99)00105-5
10.1016/j.jksues.2013.04.001
10.1016/j.eswa.2017.02.042
10.1016/j.asoc.2018.03.019
10.4018/ijaec.2014070103
10.1016/0096-0551(81)90048-5
10.1016/0377-2217(85)90167-5
10.1016/j.ecolind.2017.06.009
10.4304/jcp.6.6.1175-1182
10.1109/AISP.2012.6313794
10.1007/978-3-662-45049-9_95
10.1016/j.asoc.2009.11.014
10.1016/j.asoc.2015.04.020
10.1007/s00521-013-1525-5
10.1109/TCS.1976.1084138
10.1007/978-3-319-11857-4_9
10.1016/j.jestch.2017.02.004
10.1007/s00521-015-2037-2
10.6028/jres.084.024
10.1109/T-VT.1986.24063
10.1007/BF02239976
10.1016/j.jocs.2017.10.001
10.1007/s10489-013-0429-5
10.1016/j.compstruc.2016.03.001
ContentType Journal Article
Copyright Copyright © 2020, IGI Global. Copying or distributing in print or electronic forms without written permission of IGI Global is prohibited.
Copyright_xml – notice: Copyright © 2020, IGI Global. Copying or distributing in print or electronic forms without written permission of IGI Global is prohibited.
DBID AAYXX
CITATION
7SC
8FD
8FE
8FG
AFKRA
ARAPS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
GNUQQ
HCIFZ
JQ2
K7-
L7M
L~C
L~D
P62
PHGZM
PHGZT
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
DOI 10.4018/IJAEC.2020040103
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials
ProQuest Central
Technology Collection
ProQuest One Community College
ProQuest Central
ProQuest Central Student
SciTech Premium
ProQuest Computer Science Collection
Computer Science Database
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Databases
ProQuest One Academic
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
DatabaseTitle CrossRef
Computer Science Database
ProQuest Central Student
Technology Collection
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
SciTech Premium Collection
ProQuest One Community College
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Central Korea
ProQuest Central (New)
Advanced Technologies Database with Aerospace
Advanced Technologies & Aerospace Collection
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest SciTech Collection
Computer and Information Systems Abstracts Professional
ProQuest One Academic UKI Edition
ProQuest One Academic
ProQuest One Academic (New)
DatabaseTitleList
Computer Science Database
CrossRef
Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1942-3608
EndPage 46
ExternalDocumentID 10_4018_IJAEC_2020040103
dified_Binary_Crow_Search10_4018_IJAEC_202004010311
GroupedDBID 0R
ABEPT
ADEKF
ALMA_UNASSIGNED_HOLDINGS
COVLG
EBS
HZ
JRD
MV1
NEEBM
O9-
RIF
0R~
4.4
AAYVP
AAYXX
ACOJC
AFFHD
AFKRA
ARAPS
ARCSS
BAAKF
BENPR
BGLVJ
BYHXH
CBWLS
CCPQU
CDTDJ
CIGCI
CITATION
CKMBR
CNQXE
CTSEY
EJD
H13
HCIFZ
HZ~
IAO
ICD
ITC
K7-
N95
PHGZM
PHGZT
PQGLB
7SC
8FD
8FE
8FG
AZQEC
DWQXO
GNUQQ
JQ2
L7M
L~C
L~D
P62
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
ID FETCH-LOGICAL-c2132-31ea5e94bf46a6dcfe30560fb73b8a0f64ff4c1a0d68d4f1e6e1eed2542f3aab3
IEDL.DBID K7-
ISSN 1942-3594
IngestDate Sun Nov 09 08:41:01 EST 2025
Sat Nov 29 02:23:35 EST 2025
Tue Nov 18 22:06:18 EST 2025
Tue Jan 05 23:26:18 EST 2021
Fri Jan 15 00:06:45 EST 2021
IsPeerReviewed true
IsScholarly true
Issue 2
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c2132-31ea5e94bf46a6dcfe30560fb73b8a0f64ff4c1a0d68d4f1e6e1eed2542f3aab3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-3735-7797
PQID 2937737332
PQPubID 2045865
PageCount 19
ParticipantIDs crossref_citationtrail_10_4018_IJAEC_2020040103
igi_journals_dified_Binary_Crow_Search10_4018_IJAEC_202004010311
proquest_journals_2937737332
crossref_primary_10_4018_IJAEC_2020040103
PublicationCentury 2000
PublicationDate 2020-04-01T00:00:00
PublicationDateYYYYMMDD 2020-04-01
PublicationDate_xml – month: 04
  year: 2020
  text: 2020-04-01T00:00:00
  day: 01
PublicationDecade 2020
PublicationPlace Hershey
PublicationPlace_xml – name: Hershey
PublicationTitle International journal of applied evolutionary computation
PublicationYear 2020
Publisher IGI Global
Publisher_xml – name: IGI Global
References M.Faraji (IJAEC.2020040103-14) 2011; 6
IJAEC.2020040103-29
IJAEC.2020040103-31
IJAEC.2020040103-0
IJAEC.2020040103-30
IJAEC.2020040103-7
IJAEC.2020040103-17
IJAEC.2020040103-39
IJAEC.2020040103-8
IJAEC.2020040103-38
IJAEC.2020040103-5
IJAEC.2020040103-15
IJAEC.2020040103-37
IJAEC.2020040103-6
IJAEC.2020040103-36
IJAEC.2020040103-3
IJAEC.2020040103-13
IJAEC.2020040103-35
IJAEC.2020040103-4
IJAEC.2020040103-12
IJAEC.2020040103-1
IJAEC.2020040103-11
IJAEC.2020040103-33
IJAEC.2020040103-2
IJAEC.2020040103-10
IJAEC.2020040103-32
IJAEC.2020040103-9
IJAEC.2020040103-19
IJAEC.2020040103-18
G. I.Sayed (IJAEC.2020040103-34) 2017
IJAEC.2020040103-20
M.Garey (IJAEC.2020040103-16) 1979
IJAEC.2020040103-40
IJAEC.2020040103-28
IJAEC.2020040103-27
IJAEC.2020040103-26
IJAEC.2020040103-25
IJAEC.2020040103-24
IJAEC.2020040103-23
IJAEC.2020040103-22
IJAEC.2020040103-21
References_xml – ident: IJAEC.2020040103-13
  doi: 10.1057/palgrave.jors.2601830
– ident: IJAEC.2020040103-18
– ident: IJAEC.2020040103-22
  doi: 10.1016/j.chaos.2007.10.049
– ident: IJAEC.2020040103-2
  doi: 10.1109/SMC.2015.341
– ident: IJAEC.2020040103-36
  doi: 10.1016/S0377-2217(98)80006-4
– ident: IJAEC.2020040103-4
  doi: 10.1145/359094.359101
– start-page: 1
  year: 2017
  ident: IJAEC.2020040103-34
  article-title: Feature selection via a novel chaotic crow search algorithm.
  publication-title: Neural Computing & Applications
– ident: IJAEC.2020040103-39
  doi: 10.1007/s10470-015-0548-5
– ident: IJAEC.2020040103-9
  doi: 10.3390/en11030571
– ident: IJAEC.2020040103-40
  doi: 10.12785/amis/070249
– ident: IJAEC.2020040103-26
  doi: 10.1016/0305-0548(86)90061-4
– ident: IJAEC.2020040103-28
  doi: 10.1016/j.ejor.2008.03.050
– ident: IJAEC.2020040103-37
  doi: 10.1109/26.120165
– ident: IJAEC.2020040103-27
  doi: 10.1016/j.ejor.2009.07.016
– ident: IJAEC.2020040103-35
– ident: IJAEC.2020040103-8
  doi: 10.1016/S0166-218X(99)00105-5
– ident: IJAEC.2020040103-12
  doi: 10.1016/j.jksues.2013.04.001
– ident: IJAEC.2020040103-31
  doi: 10.1016/j.eswa.2017.02.042
– ident: IJAEC.2020040103-33
  doi: 10.1016/j.asoc.2018.03.019
– ident: IJAEC.2020040103-10
  doi: 10.4018/ijaec.2014070103
– ident: IJAEC.2020040103-5
  doi: 10.1016/0096-0551(81)90048-5
– ident: IJAEC.2020040103-7
  doi: 10.1016/0377-2217(85)90167-5
– ident: IJAEC.2020040103-25
  doi: 10.1016/j.ecolind.2017.06.009
– ident: IJAEC.2020040103-32
  doi: 10.4304/jcp.6.6.1175-1182
– ident: IJAEC.2020040103-11
  doi: 10.1109/AISP.2012.6313794
– volume: 6
  start-page: 41
  issue: 1
  year: 2011
  ident: IJAEC.2020040103-14
  article-title: Proposing a new algorithm based on bees behavior for solving graph coloring.
  publication-title: International Journal of Contemporary Mathematical Sciences
– ident: IJAEC.2020040103-38
  doi: 10.1007/978-3-662-45049-9_95
– ident: IJAEC.2020040103-6
  doi: 10.1016/j.asoc.2009.11.014
– ident: IJAEC.2020040103-29
  doi: 10.1016/j.asoc.2015.04.020
– ident: IJAEC.2020040103-30
  doi: 10.1007/s00521-013-1525-5
– ident: IJAEC.2020040103-17
  doi: 10.1109/TCS.1976.1084138
– ident: IJAEC.2020040103-23
  doi: 10.1007/978-3-319-11857-4_9
– ident: IJAEC.2020040103-1
  doi: 10.1016/j.jestch.2017.02.004
– year: 1979
  ident: IJAEC.2020040103-16
  publication-title: A Guide to the Theory of NP-Completeness
– ident: IJAEC.2020040103-19
  doi: 10.1007/s00521-015-2037-2
– ident: IJAEC.2020040103-24
  doi: 10.6028/jres.084.024
– ident: IJAEC.2020040103-15
  doi: 10.1109/T-VT.1986.24063
– ident: IJAEC.2020040103-20
  doi: 10.1007/BF02239976
– ident: IJAEC.2020040103-21
  doi: 10.1016/j.jocs.2017.10.001
– ident: IJAEC.2020040103-0
  doi: 10.1007/s10489-013-0429-5
– ident: IJAEC.2020040103-3
  doi: 10.1016/j.compstruc.2016.03.001
SSID ssj0000547471
Score 2.100084
Snippet 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...
SourceID proquest
crossref
igi
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 28
SubjectTerms Algorithms
Combinatorial analysis
Graph coloring
Graph theory
Heuristic methods
Normal distribution
Random variables
Search algorithms
Statistical analysis
Transfer functions
Title A Modified Binary Crow Search Algorithm for Solving the Graph Coloring Problem
URI http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAEC.2020040103
https://www.proquest.com/docview/2937737332
Volume 11
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 1942-3608
  dateEnd: 20220131
  omitProxy: false
  ssIdentifier: ssj0000547471
  issn: 1942-3594
  databaseCode: K7-
  dateStart: 20100101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1942-3608
  dateEnd: 20220131
  omitProxy: false
  ssIdentifier: ssj0000547471
  issn: 1942-3594
  databaseCode: BENPR
  dateStart: 20100101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT8MwDLZ4HbgwnmIwUJC4cKjWNlmbnmBM4yUxTTwkblGT1GPSWAcb_H6SpmVCCC6ck6aVndj-bDcfwDFNqR9KrrwEW9KzpTVPcup7MUqpUKOvfEc2Efd6_Okp6ZcJt2nZVlnZxMJQ61zZHHnTuKU4pjGl4enk1bOsUba6WlJoLMJyEBojbIuysfeVYzHhSIW5Emab1hPmKpUGVPDm9U272zEI0e4Ty3bwzTMtDgfDH-a58DkXtf9-7TqsldEmabvtsQEL2XgTahWTAykP9hb02uQ210M08Sg5L_7QJR2Dz4lrRibt0cAsPnt-ISbEJff5yGYhiAkdyaW975p0ctfHR_qOnmYbHi-6D50rr2Ra8FRo4KgxxFnayhImkUVppBVmFln4KGMqeepjxBCZClJfR1wzDLIoC4xzNeAyRJqmku7A0jgfZ7tAaMgjjHzJlEImtU60DDmXln8iTFqo6tCspCxUeQ25ZcMYCQNHrF5EoRcx10sdTr6emLgrOP6Ye2QUJ8pzOP0xLiYa63D2bY6TrnDSFVa6wkn3t5cEQR0aldrn68x1vvf38D6s2sVc_08DlmZv79kBrKiP2XD6dgjL591e_-6w2MqfXe31_g
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LbxMxEB61BQkuLU-RUsBIcOCwyq7t7HoPqITQ0pA2qkSRenPXjymR0myaBKr-KX4j9nq3UVXRWw-c7fXK48_z8Iz9AbxjBYupEjrKsaMin1qLlGBxlKFSGg3GOg5kE9lwKI6P88MV-NPchfFllY1OrBS1KbU_I287s5RlLGOMbk_PI88a5bOrDYVGgMXAXl64kG3-sf_Fre97Snd3jnp7Uc0qEGnqQi-ndGzRsTlXyNMiNRqt96JjVBlToogx5YhcJ0VsUmE4Jja1iTMkLpCiyIpCMTfuKtzjTGR-Xw2y6OpMx7k_TYyXc18kn_OQGXVBjGj3v3V3ei4i9bj07ArXLOHq6HR0wxxUNm5343-TziNYr71p0g3wfwwrdvIENhqmClIrrqcw7JKD0ozQ-dvkc3UDmfRm5QUJxdakOz51k1n8PCPOhSffy7E_ZSHONSZf_XvepFeGOkVyGOh3nsGPO5nVc1iblBP7AgijIsU0Vlxr5MqY3CgqhPL8GjTvoG5Bu1lVqetn1j3bx1i6cMvjQFY4kEsctODD1RfT8MTILX3fOqDIWs_Mb7TLqcEWfLrWJ0hXBulKL10ZpPuvnyRJC7YamC3HWWJs8_bmN_Bg7-hgX-73h4OX8NAPHGqdtmBtMftlX8F9_Xsxms9eV9uHwMldI_IvmvJUCA
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Modified+Binary+Crow+Search+Algorithm+for+Solving+the+Graph+Coloring+Problem&rft.jtitle=International+journal+of+applied+evolutionary+computation&rft.au=Mahseur%2C+Mohammed&rft.au=Meraihi%2C+Yassine&rft.au=Acheli%2C+Dalila&rft.date=2020-04-01&rft.issn=1942-3594&rft.eissn=1942-3608&rft.volume=11&rft.issue=2&rft.spage=28&rft.epage=46&rft_id=info:doi/10.4018%2FIJAEC.2020040103&rft.externalDocID=dified_Binary_Crow_Search10_4018_IJAEC_202004010311
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1942-3594&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1942-3594&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1942-3594&client=summon