Memetic Teaching–Learning-Based Optimization algorithms for large graph coloring problems
The Graph Coloring Problem (GCP) can be simply defined as partitioning the vertices of a graph into independent sets while minimizing the number of colors used. So far, many approaches have been implemented to solve the GCP. However, researchers are still trying to solve this important NP-Hard probl...
Saved in:
| Published in | Engineering applications of artificial intelligence Vol. 102; p. 104282 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier Ltd
01.06.2021
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 0952-1976 1873-6769 |
| DOI | 10.1016/j.engappai.2021.104282 |
Cover
| Abstract | The Graph Coloring Problem (GCP) can be simply defined as partitioning the vertices of a graph into independent sets while minimizing the number of colors used. So far, many approaches have been implemented to solve the GCP. However, researchers are still trying to solve this important NP-Hard problem much faster and with better results for large graphs. The Teaching-Learning-Based Optimization (TLBO) metaheuristic is a recent approach that has attracted the attention of many researchers due to its algorithm-specific parameterless concept and high performance. In this study, we propose a new memetic TLBO algorithm (TLBO-Color) combined with a robust tabu search algorithm to solve the GCP. A scalable parallel version of TLBO-Color is also developed for painting 43 benchmark DIMACS graphs with thousands of vertices and millions of edges. The optimization times of the TLBO-Color algorithm are very practical and the best results (for 33 of the graphs) or solutions with a few more colors are reported. On average, there are only 1.77% more colors compared to the best solutions. The obtained results confirm that the proposed algorithm is competitive with the state-of-the-art algorithms in the literature. |
|---|---|
| AbstractList | The Graph Coloring Problem (GCP) can be simply defined as partitioning the vertices of a graph into independent sets while minimizing the number of colors used. So far, many approaches have been implemented to solve the GCP. However, researchers are still trying to solve this important NP-Hard problem much faster and with better results for large graphs. The Teaching-Learning-Based Optimization (TLBO) metaheuristic is a recent approach that has attracted the attention of many researchers due to its algorithm-specific parameterless concept and high performance. In this study, we propose a new memetic TLBO algorithm (TLBO-Color) combined with a robust tabu search algorithm to solve the GCP. A scalable parallel version of TLBO-Color is also developed for painting 43 benchmark DIMACS graphs with thousands of vertices and millions of edges. The optimization times of the TLBO-Color algorithm are very practical and the best results (for 33 of the graphs) or solutions with a few more colors are reported. On average, there are only 1.77% more colors compared to the best solutions. The obtained results confirm that the proposed algorithm is competitive with the state-of-the-art algorithms in the literature. |
| ArticleNumber | 104282 |
| Author | Dokeroglu, Tansel Sevinc, Ender |
| Author_xml | – sequence: 1 givenname: Tansel surname: Dokeroglu fullname: Dokeroglu, Tansel email: tansel@ceng.metu.edu.tr – sequence: 2 givenname: Ender surname: Sevinc fullname: Sevinc, Ender |
| BookMark | eNqFkEtOwzAQhi0EEqVwBeQLpPiVxJFYABUvqaibsmJhOc4kdZXYkR0hwYo7cENOQkphw6arGc3o-zXznaBD5x0gdE7JjBKaXWxm4Brd99rOGGF0HAom2QGaUJnzJMuz4hBNSJGyhBZ5doxOYtwQQrgU2QS9PEEHgzV4BdqsrWu-Pj4XoIMb2-RGR6jwsh9sZ9_1YL3Dum18sMO6i7j2Abc6NICboPs1Nr4dV67BffBlC108RUe1biOc_dYper67Xc0fksXy_nF-vUgMp2xI8lrklRGsSI1mVBJRV6YmxlQlAS6y0pTCyJRLSCGlHAqpZSVLUZcSiopDyafocpdrgo8xQK2MHX7OHYK2raJEbUWpjfoTpbai1E7UiGf_8D7YToe3_eDVDoTxuVcLQUVjwRmobAAzqMrbfRHfIPqM2A |
| CitedBy_id | crossref_primary_10_3390_math10060930 crossref_primary_10_1007_s10489_022_03791_y crossref_primary_10_1007_s40747_023_01118_z crossref_primary_10_29130_dubited_1113519 crossref_primary_10_1007_s00521_023_08387_2 crossref_primary_10_1109_ACCESS_2023_3318206 crossref_primary_10_3390_math9121419 crossref_primary_10_3934_mbe_2023389 crossref_primary_10_3390_en14164753 crossref_primary_10_7717_peerj_cs_836 crossref_primary_10_1016_j_eswa_2023_122315 crossref_primary_10_1016_j_swevo_2021_100958 crossref_primary_10_1155_2022_4177405 crossref_primary_10_3390_math10234405 crossref_primary_10_37394_23202_2023_22_53 crossref_primary_10_3390_ijt1010003 crossref_primary_10_1109_ACCESS_2023_3260652 crossref_primary_10_1109_ACCESS_2024_3455436 |
| Cites_doi | 10.1016/j.cor.2011.04.002 10.1016/j.eswa.2016.07.047 10.1016/j.jsv.2020.115315 10.1109/TCS.1976.1084138 10.1080/0305215X.2011.652103 10.1016/j.ins.2013.02.041 10.1090/dimacs/026/16 10.1007/s10845-014-0918-3 10.1016/j.dam.2013.02.013 10.1145/3400031 10.1016/j.cor.2005.09.010 10.1007/s10489-011-0309-9 10.1016/j.cie.2015.03.001 10.1080/01621459.1978.10481589 10.1007/BF02125407 10.1016/j.cor.2006.05.014 10.1016/j.ejor.2005.08.012 10.1023/B:ANOR.0000032574.01332.98 10.1016/j.dam.2008.03.022 10.1109/EURDAC.1992.246238 10.1016/j.dam.2006.07.017 10.3390/s18124131 10.1016/j.tafmec.2020.102554 10.1016/j.engfracmech.2018.09.032 10.1016/j.cor.2009.06.024 10.1016/S0377-2217(02)00832-9 10.1016/j.engappai.2018.01.012 10.1016/S0377-2217(87)80148-0 10.1109/4235.585893 10.1016/j.parco.2012.07.001 10.1023/A:1011237503342 10.1007/BF02239976 10.1145/321921.321926 10.1016/j.engappai.2016.02.004 10.1145/177492.177575 10.6028/jres.084.024 10.1016/j.cad.2010.12.015 10.1287/ijoc.1070.0245 10.1016/j.engstruct.2018.09.070 10.1016/S0166-218X(99)00105-5 10.1023/A:1009823419804 10.1016/j.cie.2019.106040 10.1016/j.ins.2012.05.009 10.1137/0914041 10.1080/0305215X.2011.624183 10.1016/j.cor.2014.05.017 10.1016/j.asoc.2015.04.020 10.1016/j.engappai.2012.02.016 10.1145/359094.359101 10.1002/1096-9128(200010)12:12<1131::AID-CPE528>3.0.CO;2-2 10.1016/j.cor.2011.10.008 10.1016/j.dam.2016.09.018 10.1016/j.ejor.2009.07.016 10.1016/j.cor.2005.07.028 |
| ContentType | Journal Article |
| Copyright | 2021 Elsevier Ltd |
| Copyright_xml | – notice: 2021 Elsevier Ltd |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.engappai.2021.104282 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Applied Sciences Computer Science |
| EISSN | 1873-6769 |
| ExternalDocumentID | 10_1016_j_engappai_2021_104282 S0952197621001299 |
| GroupedDBID | --K --M .DC .~1 0R~ 1B1 1~. 1~5 29G 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABMAC ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADJOM ADMUD ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q GBLVA GBOLZ HLZ HVGLF HZ~ IHE J1W JJJVA KOM LG9 LY7 M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SBC SDF SDG SDP SES SET SEW SPC SPCBC SST SSV SSZ T5K TN5 UHS WUQ ZMT ~G- AATTM AAXKI AAYWO AAYXX ABJNI ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c312t-7f47dc4295ca21804fdcf0ccdb0e346bcb4c8538e5e513e98a8d8b4fb8e9d3eb3 |
| IEDL.DBID | .~1 |
| ISSN | 0952-1976 |
| IngestDate | Thu Apr 24 22:51:53 EDT 2025 Sat Oct 25 05:30:32 EDT 2025 Fri Feb 23 02:44:07 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | TLBO Graph coloring Parallel TabuCol Memetic Optimization |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c312t-7f47dc4295ca21804fdcf0ccdb0e346bcb4c8538e5e513e98a8d8b4fb8e9d3eb3 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_engappai_2021_104282 crossref_primary_10_1016_j_engappai_2021_104282 elsevier_sciencedirect_doi_10_1016_j_engappai_2021_104282 |
| PublicationCentury | 2000 |
| PublicationDate | June 2021 2021-06-00 |
| PublicationDateYYYYMMDD | 2021-06-01 |
| PublicationDate_xml | – month: 06 year: 2021 text: June 2021 |
| PublicationDecade | 2020 |
| PublicationTitle | Engineering applications of artificial intelligence |
| PublicationYear | 2021 |
| Publisher | Elsevier Ltd |
| Publisher_xml | – name: Elsevier Ltd |
| References | Avanthay, Hertz, Zufferey (b3) 2003; 151 Wan, W., Perkowski, M.A., 1992. A new approach to the decomposition of incompletely specified multi-output functions based on graph coloring and local transformations and its application to FPGA mapping. In: Proceedings of the Conference on European Design Automation. pp. 230–235. Črepinšek, Liu, Mernik (b14) 2012; 212 Cornaz, Furini, Malaguti (b13) 2017; 217 Dokeroglu, Sevinc, Kucukyilmaz, Cosar (b19) 2019; 137 Malaguti, Monaci, Toth (b47) 2008; 20 Markid, Dadaneh, Moghaddam (b49) 2015 Khatir, Boutchicha, Le Thanh, Tran-Ngoc, Nguyen, Abdel-Wahab (b40) 2020; 107 Morgenstern (b51) 1996; 26 Jones, Plassmann (b39) 1993; 14 Wang, Hao, Wu (b68) 2018; 71 Dokeroglu (b17) 2015; 85 Venkata Rao, Patel (b66) 2012; 44 Dorne, Hao (b21) 1999 Porumbel, Hao, Kuntz (b55) 2009 Archetti, Bianchessi, Hertz (b2) 2014; 165 Garey, Johnson, So (b31) 1976; 23 Chams, Hertz, De Werra (b11) 1987; 32 Tran-Ngoc, Khatir, De Roeck, Bui-Tien, Nguyen-Ngoc, Abdel Wahab (b65) 2018; 18 San Segundo (b62) 2012; 39 Chiarandini, M., Stützle, T., et al., 2002. An application of iterated local search to graph coloring problem. In: Proceedings of the Computational Symposium on Graph Coloring and Its Generalizations. pp. 112–125. Li, Chen, Quan, Fang, Su, Tang, Yang (b44) 2016 Tran-Ngoc, He, Reynders, Khatir, Le-Xuan, De Roeck, Bui-Tien, Wahab (b64) 2020; 476 Tiachacht, Bouazzouni, Khatir, Wahab, Behtani, Capozucca (b63) 2018; 177 Mahmoudi, Lotfi (b46) 2015; 33 Deveci, Boman, Devine, Rajamanickam (b16) 2016 Yu, Wang, Wang (b71) 2016; 27 Funabiki, Higashino (b24) 2000; 83 Wolpert, Macready (b69) 1997; 1 de Werra, Eisenbeis, Lelait, Marmol (b15) 1999; 93 Brélaz (b7) 1979; 22 Galinier, Hao (b25) 1999; 3 Osama, Truong, Yang, Buluç, Owens (b54) 2019 Malkawi, Hassan, Hassan (b48) 2008; 5 Porumbel, Hao, Kuntz (b56) 2010; 37 Barnier, Brisset (b4) 2004; 130 Burke, McCollum, Meisels, Petrovic, Qu (b9) 2007; 176 Leighton (b43) 1979; 84 Ahmed (b1) 2012; 3 Wu, Hao (b70) 2012; 39 Zhou, Li, Huang, Xu (b73) 2014; 51 Briggs, Cooper, Torczon (b8) 1994; 16 Çatalyürek, Feo, Gebremedhin, Halappanavar, Pothen (b10) 2012; 38 Rao, Patel (b58) 2013; 26 Jensen, Toft (b38) 2011 Lü, Hao (b45) 2010; 203 Galinier, Hertz, Zufferey (b27) 2008; 156 Nayyar, Nguyen (b53) 2018 Rao, Patel (b57) 2012; 3 Laguna, Martí (b42) 2001; 19 Glover, Laguna (b33) 1998 Khatir, Wahab (b41) 2019; 205 Rao, Savsani, Balic (b59) 2012; 44 Rao, Savsani, Vakharia (b60) 2011; 43 Hertz, Plumettaz, Zufferey (b36) 2008; 156 Nayyar, Le, Nguyen (b52) 2018 Gamache, Hertz, Ouellet (b28) 2007; 34 Dokeroglu, Cosar (b18) 2016; 52 Zhou, Hao, Duval (b72) 2016; 64 Harada, Alba (b35) 2020; 53 Blöchliger, Zufferey (b5) 2008; 35 Fleurent, Ferland (b23) 1996; 63 Matula, Marble, Isaacson (b50) 1972 Garey, Johnson (b30) 1979 Hansen, Delattre (b34) 1978; 73 Hertz, de Werra (b37) 1987; 39 Sabar, Ayob, Qu, Kendall (b61) 2012; 37 BoussaïD, Lepagnot, Siarry (b6) 2013; 237 Dorne, Hao (b20) 1998 Garey, Johnson (b29) 1976; 23 Gebremedhin, Manne (b32) 2000; 12 Galinier, Hertz (b26) 2006; 33 Ferland, Fleurent (b22) 1994 Çatalyürek (10.1016/j.engappai.2021.104282_b10) 2012; 38 Archetti (10.1016/j.engappai.2021.104282_b2) 2014; 165 Hertz (10.1016/j.engappai.2021.104282_b36) 2008; 156 Jensen (10.1016/j.engappai.2021.104282_b38) 2011 Črepinšek (10.1016/j.engappai.2021.104282_b14) 2012; 212 Malaguti (10.1016/j.engappai.2021.104282_b47) 2008; 20 Tiachacht (10.1016/j.engappai.2021.104282_b63) 2018; 177 Yu (10.1016/j.engappai.2021.104282_b71) 2016; 27 Tran-Ngoc (10.1016/j.engappai.2021.104282_b64) 2020; 476 Galinier (10.1016/j.engappai.2021.104282_b25) 1999; 3 Venkata Rao (10.1016/j.engappai.2021.104282_b66) 2012; 44 Galinier (10.1016/j.engappai.2021.104282_b26) 2006; 33 Rao (10.1016/j.engappai.2021.104282_b58) 2013; 26 Briggs (10.1016/j.engappai.2021.104282_b8) 1994; 16 Deveci (10.1016/j.engappai.2021.104282_b16) 2016 Malkawi (10.1016/j.engappai.2021.104282_b48) 2008; 5 Barnier (10.1016/j.engappai.2021.104282_b4) 2004; 130 Dokeroglu (10.1016/j.engappai.2021.104282_b17) 2015; 85 Hansen (10.1016/j.engappai.2021.104282_b34) 1978; 73 Fleurent (10.1016/j.engappai.2021.104282_b23) 1996; 63 Sabar (10.1016/j.engappai.2021.104282_b61) 2012; 37 Blöchliger (10.1016/j.engappai.2021.104282_b5) 2008; 35 Ferland (10.1016/j.engappai.2021.104282_b22) 1994 Harada (10.1016/j.engappai.2021.104282_b35) 2020; 53 Garey (10.1016/j.engappai.2021.104282_b29) 1976; 23 Li (10.1016/j.engappai.2021.104282_b44) 2016 Dokeroglu (10.1016/j.engappai.2021.104282_b18) 2016; 52 Porumbel (10.1016/j.engappai.2021.104282_b55) 2009 Nayyar (10.1016/j.engappai.2021.104282_b53) 2018 Mahmoudi (10.1016/j.engappai.2021.104282_b46) 2015; 33 San Segundo (10.1016/j.engappai.2021.104282_b62) 2012; 39 Cornaz (10.1016/j.engappai.2021.104282_b13) 2017; 217 Osama (10.1016/j.engappai.2021.104282_b54) 2019 Leighton (10.1016/j.engappai.2021.104282_b43) 1979; 84 de Werra (10.1016/j.engappai.2021.104282_b15) 1999; 93 Rao (10.1016/j.engappai.2021.104282_b57) 2012; 3 Galinier (10.1016/j.engappai.2021.104282_b27) 2008; 156 BoussaïD (10.1016/j.engappai.2021.104282_b6) 2013; 237 Brélaz (10.1016/j.engappai.2021.104282_b7) 1979; 22 Tran-Ngoc (10.1016/j.engappai.2021.104282_b65) 2018; 18 Avanthay (10.1016/j.engappai.2021.104282_b3) 2003; 151 Rao (10.1016/j.engappai.2021.104282_b60) 2011; 43 Khatir (10.1016/j.engappai.2021.104282_b41) 2019; 205 Wang (10.1016/j.engappai.2021.104282_b68) 2018; 71 Matula (10.1016/j.engappai.2021.104282_b50) 1972 Rao (10.1016/j.engappai.2021.104282_b59) 2012; 44 Dorne (10.1016/j.engappai.2021.104282_b21) 1999 Nayyar (10.1016/j.engappai.2021.104282_b52) 2018 Lü (10.1016/j.engappai.2021.104282_b45) 2010; 203 Hertz (10.1016/j.engappai.2021.104282_b37) 1987; 39 10.1016/j.engappai.2021.104282_b67 Markid (10.1016/j.engappai.2021.104282_b49) 2015 Garey (10.1016/j.engappai.2021.104282_b31) 1976; 23 Burke (10.1016/j.engappai.2021.104282_b9) 2007; 176 Wu (10.1016/j.engappai.2021.104282_b70) 2012; 39 Zhou (10.1016/j.engappai.2021.104282_b72) 2016; 64 Wolpert (10.1016/j.engappai.2021.104282_b69) 1997; 1 Dokeroglu (10.1016/j.engappai.2021.104282_b19) 2019; 137 Jones (10.1016/j.engappai.2021.104282_b39) 1993; 14 Khatir (10.1016/j.engappai.2021.104282_b40) 2020; 107 Chams (10.1016/j.engappai.2021.104282_b11) 1987; 32 Ahmed (10.1016/j.engappai.2021.104282_b1) 2012; 3 Morgenstern (10.1016/j.engappai.2021.104282_b51) 1996; 26 Laguna (10.1016/j.engappai.2021.104282_b42) 2001; 19 Glover (10.1016/j.engappai.2021.104282_b33) 1998 Garey (10.1016/j.engappai.2021.104282_b30) 1979 Dorne (10.1016/j.engappai.2021.104282_b20) 1998 Zhou (10.1016/j.engappai.2021.104282_b73) 2014; 51 Funabiki (10.1016/j.engappai.2021.104282_b24) 2000; 83 Porumbel (10.1016/j.engappai.2021.104282_b56) 2010; 37 10.1016/j.engappai.2021.104282_b12 Gamache (10.1016/j.engappai.2021.104282_b28) 2007; 34 Gebremedhin (10.1016/j.engappai.2021.104282_b32) 2000; 12 |
| References_xml | – volume: 83 start-page: 1420 year: 2000 end-page: 1430 ident: b24 article-title: A minimal-state processing search algorithm for graph coloring problems publication-title: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. – volume: 23 start-page: 591 year: 1976 end-page: 599 ident: b31 article-title: An application of graph coloring to printed circuit testing publication-title: IEEE Trans. Circuits Syst. – start-page: 77 year: 1999 end-page: 92 ident: b21 article-title: Tabu search for graph coloring, T-colorings and set T-colorings publication-title: Meta-Heuristics – volume: 73 start-page: 397 year: 1978 end-page: 403 ident: b34 article-title: Complete-link cluster analysis by graph coloring publication-title: J. Amer. Statist. Assoc. – volume: 107 year: 2020 ident: b40 article-title: Improved ANN technique combined with jaya algorithm for crack identification in plates using XIGA and experimental analysis publication-title: Theor. Appl. Fract. Mech. – start-page: 892 year: 2016 end-page: 901 ident: b16 article-title: Parallel graph coloring for manycore architectures publication-title: 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS) – volume: 137 year: 2019 ident: b19 article-title: A survey on new generation metaheuristic algorithms publication-title: Comput. Ind. Eng. – start-page: 121 year: 2009 end-page: 132 ident: b55 article-title: Diversity control and multi-parent recombination for evolutionary graph coloring algorithms publication-title: European Conference on Evolutionary Computation in Combinatorial Optimization – volume: 84 start-page: 489 year: 1979 end-page: 506 ident: b43 article-title: A graph coloring algorithm for large scheduling problems publication-title: J. Res. Natl. Bur. Stand. – volume: 130 start-page: 163 year: 2004 end-page: 178 ident: b4 article-title: Graph coloring for air traffic flow management publication-title: Ann. Oper. Res. – volume: 34 start-page: 2384 year: 2007 end-page: 2395 ident: b28 article-title: A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding publication-title: Comput. Oper. Res. – volume: 63 start-page: 437 year: 1996 end-page: 461 ident: b23 article-title: Genetic and hybrid algorithms for graph coloring publication-title: Ann. Oper. Res. – volume: 16 start-page: 428 year: 1994 end-page: 455 ident: b8 article-title: Improvements to graph coloring register allocation publication-title: ACM Trans. Program. Lang. Syst. (TOPLAS) – volume: 39 start-page: 345 year: 1987 end-page: 351 ident: b37 article-title: Using tabu search techniques for graph coloring publication-title: Computing – volume: 3 start-page: 379 year: 1999 end-page: 397 ident: b25 article-title: Hybrid evolutionary algorithms for graph coloring publication-title: J. Comb. Optim. – volume: 476 year: 2020 ident: b64 article-title: An efficient approach to model updating for a multispan railway bridge using orthogonal diagonalization combined with improved particle swarm optimization publication-title: J. Sound Vib. – volume: 35 start-page: 960 year: 2008 end-page: 975 ident: b5 article-title: A graph coloring heuristic using partial solutions and a reactive tabu scheme publication-title: Comput. Oper. Res. – volume: 177 start-page: 421 year: 2018 end-page: 430 ident: b63 article-title: Damage assessment in structures using combination of a modified cornwell indicator and genetic algorithm publication-title: Eng. Struct. – start-page: 109 year: 1972 end-page: 122 ident: b50 article-title: Graph coloring algorithms publication-title: Graph Theory and Computing – volume: 44 start-page: 1447 year: 2012 end-page: 1462 ident: b59 article-title: Teaching–learning-based optimization algorithm for unconstrained and constrained real-parameter optimization problems publication-title: Eng. Optim. – year: 1979 ident: b30 article-title: Computers and Intractability, Vol. 174 – year: 2011 ident: b38 article-title: Graph Coloring Problems, Vol. 39 – volume: 37 start-page: 769 year: 2010 end-page: 778 ident: b56 article-title: A search space “cartography” for guiding graph coloring heuristics publication-title: Comput. Oper. Res. – volume: 165 start-page: 49 year: 2014 end-page: 59 ident: b2 article-title: A branch-and-price algorithm for the robust graph coloring problem publication-title: Discrete Appl. Math. – volume: 33 start-page: 2547 year: 2006 end-page: 2562 ident: b26 article-title: A survey of local search methods for graph coloring publication-title: Comput. Oper. Res. – volume: 20 start-page: 302 year: 2008 end-page: 316 ident: b47 article-title: A metaheuristic approach for the vertex coloring problem publication-title: INFORMS J. Comput. – volume: 156 start-page: 2551 year: 2008 end-page: 2560 ident: b36 article-title: Variable space search for graph coloring publication-title: Discrete Appl. Math. – volume: 93 start-page: 191 year: 1999 end-page: 203 ident: b15 article-title: On a graph-theoretical model for cyclic register allocation publication-title: Discrete Appl. Math. – volume: 27 start-page: 831 year: 2016 end-page: 843 ident: b71 article-title: An improved teaching-learning-based optimization algorithm for numerical and engineering optimization problems publication-title: J. Intell. Manuf. – volume: 151 start-page: 379 year: 2003 end-page: 388 ident: b3 article-title: A variable neighborhood search for graph coloring publication-title: European J. Oper. Res. – reference: Chiarandini, M., Stützle, T., et al., 2002. An application of iterated local search to graph coloring problem. In: Proceedings of the Computational Symposium on Graph Coloring and Its Generalizations. pp. 112–125. – volume: 37 start-page: 1 year: 2012 end-page: 11 ident: b61 article-title: A graph coloring constructive hyper-heuristic for examination timetabling problems publication-title: Appl. Intell. – start-page: 745 year: 1998 end-page: 754 ident: b20 article-title: A new genetic local search algorithm for graph coloring publication-title: International Conference on Parallel Problem Solving from Nature – start-page: 845 year: 2016 end-page: 854 ident: b44 article-title: High performance parallel graph coloring on gpgpus publication-title: 2016 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) – volume: 53 start-page: 1 year: 2020 end-page: 39 ident: b35 article-title: Parallel genetic algorithms: A useful survey publication-title: ACM Comput. Surv. – volume: 3 start-page: 535 year: 2012 end-page: 560 ident: b57 article-title: An elitist teaching-learning-based optimization algorithm for solving complex constrained optimization problems publication-title: Int. J. Ind. Eng. Comput. – volume: 32 start-page: 260 year: 1987 end-page: 266 ident: b11 article-title: Some experiments with simulated annealing for coloring graphs publication-title: European J. Oper. Res. – start-page: 2093 year: 1998 end-page: 2229 ident: b33 article-title: Tabu search publication-title: Handbook of Combinatorial Optimization – volume: 156 start-page: 267 year: 2008 end-page: 279 ident: b27 article-title: An adaptive memory algorithm for the k-coloring problem publication-title: Discrete Appl. Math. – volume: 23 start-page: 43 year: 1976 end-page: 49 ident: b29 article-title: The complexity of near-optimal graph coloring publication-title: J. ACM – start-page: 112 year: 2015 end-page: 117 ident: b49 article-title: A new tabucol embedded artificial bee colony based algorithm for graph coloring publication-title: 2015 5th International Conference on Computer and Knowledge Engineering (ICCKE) – volume: 85 start-page: 86 year: 2015 end-page: 101 ident: b17 article-title: Hybrid teaching–learning-based optimization algorithms for the quadratic assignment problem publication-title: Comput. Ind. Eng. – volume: 71 start-page: 1 year: 2018 end-page: 14 ident: b68 article-title: Tabu search with feasible and infeasible searches for equitable coloring publication-title: Eng. Appl. Artif. Intell. – start-page: 231 year: 2019 end-page: 240 ident: b54 article-title: Graph coloring on the GPU publication-title: 2019 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) – volume: 205 start-page: 285 year: 2019 end-page: 300 ident: b41 article-title: Fast simulations for solving fracture mechanics inverse problems using POD-RBF XIGA and jaya algorithm publication-title: Eng. Fract. Mech. – volume: 43 start-page: 303 year: 2011 end-page: 315 ident: b60 article-title: Teaching–learning-based optimization: a novel method for constrained mechanical design optimization problems publication-title: Comput. Aided Des. – volume: 203 start-page: 241 year: 2010 end-page: 250 ident: b45 article-title: A memetic algorithm for graph coloring publication-title: European J. Oper. Res. – volume: 1 start-page: 67 year: 1997 end-page: 82 ident: b69 article-title: No free lunch theorems for optimization publication-title: IEEE Trans. Evol. Comput. – volume: 212 start-page: 79 year: 2012 end-page: 93 ident: b14 article-title: A note on teaching–learning-based optimization algorithm publication-title: Inform. Sci. – volume: 237 start-page: 82 year: 2013 end-page: 117 ident: b6 article-title: A survey on optimization metaheuristics publication-title: Inform. Sci. – volume: 33 start-page: 48 year: 2015 end-page: 64 ident: b46 article-title: Modified cuckoo optimization algorithm (MCOA) to solve graph coloring problem publication-title: Appl. Soft Comput. – volume: 3 start-page: 1 year: 2012 end-page: 7 ident: b1 article-title: Applications of graph coloring in modern computer science publication-title: Int. J. Comput. Inf. Technol. – volume: 39 start-page: 1724 year: 2012 end-page: 1733 ident: b62 article-title: A new DSATUR-based algorithm for exact vertex coloring publication-title: Comput. Oper. Res. – volume: 44 start-page: 965 year: 2012 end-page: 983 ident: b66 article-title: Multi-objective optimization of combined brayton and inverse brayton cycles using advanced optimization algorithms publication-title: Eng. Optim. – reference: Wan, W., Perkowski, M.A., 1992. A new approach to the decomposition of incompletely specified multi-output functions based on graph coloring and local transformations and its application to FPGA mapping. In: Proceedings of the Conference on European Design Automation. pp. 230–235. – year: 2018 ident: b52 article-title: Advances in Swarm Intelligence for Optimizing Problems in Computer Science – volume: 26 start-page: 335 year: 1996 end-page: 358 ident: b51 article-title: Distributed coloration neighborhood search publication-title: Discrete Math. Theor. Comput. Sci. – volume: 39 start-page: 283 year: 2012 end-page: 290 ident: b70 article-title: Coloring large graphs based on independent set extraction publication-title: Comput. Oper. Res. – volume: 14 start-page: 654 year: 1993 end-page: 669 ident: b39 article-title: A parallel graph coloring heuristic publication-title: SIAM J. Sci. Comput. – volume: 5 year: 2008 ident: b48 article-title: A new exam scheduling algorithm using graph coloring. publication-title: Int. Arab J. Inf. Technol. (IAJIT) – year: 1994 ident: b22 article-title: Object-Oriented Implementation of Heuristic Search Methods for Graph Coloring, Maximum Clique and Satisfiability – volume: 26 start-page: 430 year: 2013 end-page: 445 ident: b58 article-title: Multi-objective optimization of two stage thermoelectric cooler using a modified teaching–learning-based optimization algorithm publication-title: Eng. Appl. Artif. Intell. – volume: 176 start-page: 177 year: 2007 end-page: 192 ident: b9 article-title: A graph-based hyper-heuristic for educational timetabling problems publication-title: European J. Oper. Res. – volume: 217 start-page: 151 year: 2017 end-page: 162 ident: b13 article-title: Solving vertex coloring problems as maximum weight stable set problems publication-title: Discrete Appl. Math. – start-page: 53 year: 2018 end-page: 78 ident: b53 article-title: Introduction to swarm intelligence publication-title: Adv. Swarm Intell. Optim. Probl. Comput. Sci. – volume: 38 start-page: 576 year: 2012 end-page: 594 ident: b10 article-title: Graph coloring algorithms for multi-core and massively multithreaded architectures publication-title: Parallel Comput. – volume: 18 start-page: 4131 year: 2018 ident: b65 article-title: Model updating for Nam O bridge using particle swarm optimization algorithm and genetic algorithm publication-title: Sensors – volume: 12 start-page: 1131 year: 2000 end-page: 1146 ident: b32 article-title: Scalable parallel graph coloring algorithms publication-title: Concurrency, Pract. Exp. – volume: 52 start-page: 10 year: 2016 end-page: 25 ident: b18 article-title: A novel multistart hyper-heuristic algorithm on the grid for the quadratic assignment problem publication-title: Eng. Appl. Artif. Intell. – volume: 51 start-page: 282 year: 2014 end-page: 301 ident: b73 article-title: An exact algorithm with learning for the graph coloring problem publication-title: Comput. Oper. Res. – volume: 22 start-page: 251 year: 1979 end-page: 256 ident: b7 article-title: New methods to color the vertices of a graph publication-title: Commun. ACM – volume: 19 start-page: 165 year: 2001 end-page: 178 ident: b42 article-title: A GRASP for coloring sparse graphs publication-title: Comput. Optim. Appl. – volume: 64 start-page: 412 year: 2016 end-page: 422 ident: b72 article-title: Reinforcement learning based local search for grouping problems: A case study on graph coloring publication-title: Expert Syst. Appl. – start-page: 892 year: 2016 ident: 10.1016/j.engappai.2021.104282_b16 article-title: Parallel graph coloring for manycore architectures – volume: 39 start-page: 283 issue: 2 year: 2012 ident: 10.1016/j.engappai.2021.104282_b70 article-title: Coloring large graphs based on independent set extraction publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2011.04.002 – year: 1979 ident: 10.1016/j.engappai.2021.104282_b30 – volume: 64 start-page: 412 year: 2016 ident: 10.1016/j.engappai.2021.104282_b72 article-title: Reinforcement learning based local search for grouping problems: A case study on graph coloring publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2016.07.047 – volume: 3 start-page: 535 issue: 4 year: 2012 ident: 10.1016/j.engappai.2021.104282_b57 article-title: An elitist teaching-learning-based optimization algorithm for solving complex constrained optimization problems publication-title: Int. J. Ind. Eng. Comput. – volume: 476 year: 2020 ident: 10.1016/j.engappai.2021.104282_b64 article-title: An efficient approach to model updating for a multispan railway bridge using orthogonal diagonalization combined with improved particle swarm optimization publication-title: J. Sound Vib. doi: 10.1016/j.jsv.2020.115315 – volume: 23 start-page: 591 issue: 10 year: 1976 ident: 10.1016/j.engappai.2021.104282_b31 article-title: An application of graph coloring to printed circuit testing publication-title: IEEE Trans. Circuits Syst. doi: 10.1109/TCS.1976.1084138 – volume: 44 start-page: 1447 issue: 12 year: 2012 ident: 10.1016/j.engappai.2021.104282_b59 article-title: Teaching–learning-based optimization algorithm for unconstrained and constrained real-parameter optimization problems publication-title: Eng. Optim. doi: 10.1080/0305215X.2011.652103 – volume: 237 start-page: 82 year: 2013 ident: 10.1016/j.engappai.2021.104282_b6 article-title: A survey on optimization metaheuristics publication-title: Inform. Sci. doi: 10.1016/j.ins.2013.02.041 – volume: 26 start-page: 335 year: 1996 ident: 10.1016/j.engappai.2021.104282_b51 article-title: Distributed coloration neighborhood search publication-title: Discrete Math. Theor. Comput. Sci. doi: 10.1090/dimacs/026/16 – year: 1994 ident: 10.1016/j.engappai.2021.104282_b22 – volume: 27 start-page: 831 issue: 4 year: 2016 ident: 10.1016/j.engappai.2021.104282_b71 article-title: An improved teaching-learning-based optimization algorithm for numerical and engineering optimization problems publication-title: J. Intell. Manuf. doi: 10.1007/s10845-014-0918-3 – volume: 165 start-page: 49 year: 2014 ident: 10.1016/j.engappai.2021.104282_b2 article-title: A branch-and-price algorithm for the robust graph coloring problem publication-title: Discrete Appl. Math. doi: 10.1016/j.dam.2013.02.013 – start-page: 77 year: 1999 ident: 10.1016/j.engappai.2021.104282_b21 article-title: Tabu search for graph coloring, T-colorings and set T-colorings – volume: 53 start-page: 1 issue: 4 year: 2020 ident: 10.1016/j.engappai.2021.104282_b35 article-title: Parallel genetic algorithms: A useful survey publication-title: ACM Comput. Surv. doi: 10.1145/3400031 – volume: 34 start-page: 2384 issue: 8 year: 2007 ident: 10.1016/j.engappai.2021.104282_b28 article-title: A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2005.09.010 – volume: 37 start-page: 1 issue: 1 year: 2012 ident: 10.1016/j.engappai.2021.104282_b61 article-title: A graph coloring constructive hyper-heuristic for examination timetabling problems publication-title: Appl. Intell. doi: 10.1007/s10489-011-0309-9 – year: 2011 ident: 10.1016/j.engappai.2021.104282_b38 – volume: 85 start-page: 86 year: 2015 ident: 10.1016/j.engappai.2021.104282_b17 article-title: Hybrid teaching–learning-based optimization algorithms for the quadratic assignment problem publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2015.03.001 – volume: 73 start-page: 397 issue: 362 year: 1978 ident: 10.1016/j.engappai.2021.104282_b34 article-title: Complete-link cluster analysis by graph coloring publication-title: J. Amer. Statist. Assoc. doi: 10.1080/01621459.1978.10481589 – start-page: 121 year: 2009 ident: 10.1016/j.engappai.2021.104282_b55 article-title: Diversity control and multi-parent recombination for evolutionary graph coloring algorithms – volume: 3 start-page: 1 issue: 2 year: 2012 ident: 10.1016/j.engappai.2021.104282_b1 article-title: Applications of graph coloring in modern computer science publication-title: Int. J. Comput. Inf. Technol. – volume: 63 start-page: 437 issue: 3 year: 1996 ident: 10.1016/j.engappai.2021.104282_b23 article-title: Genetic and hybrid algorithms for graph coloring publication-title: Ann. Oper. Res. doi: 10.1007/BF02125407 – volume: 35 start-page: 960 issue: 3 year: 2008 ident: 10.1016/j.engappai.2021.104282_b5 article-title: A graph coloring heuristic using partial solutions and a reactive tabu scheme publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2006.05.014 – volume: 176 start-page: 177 issue: 1 year: 2007 ident: 10.1016/j.engappai.2021.104282_b9 article-title: A graph-based hyper-heuristic for educational timetabling problems publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2005.08.012 – volume: 130 start-page: 163 issue: 1 year: 2004 ident: 10.1016/j.engappai.2021.104282_b4 article-title: Graph coloring for air traffic flow management publication-title: Ann. Oper. Res. doi: 10.1023/B:ANOR.0000032574.01332.98 – volume: 83 start-page: 1420 issue: 7 year: 2000 ident: 10.1016/j.engappai.2021.104282_b24 article-title: A minimal-state processing search algorithm for graph coloring problems publication-title: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. – volume: 156 start-page: 2551 issue: 13 year: 2008 ident: 10.1016/j.engappai.2021.104282_b36 article-title: Variable space search for graph coloring publication-title: Discrete Appl. Math. doi: 10.1016/j.dam.2008.03.022 – ident: 10.1016/j.engappai.2021.104282_b67 doi: 10.1109/EURDAC.1992.246238 – volume: 156 start-page: 267 issue: 2 year: 2008 ident: 10.1016/j.engappai.2021.104282_b27 article-title: An adaptive memory algorithm for the k-coloring problem publication-title: Discrete Appl. Math. doi: 10.1016/j.dam.2006.07.017 – volume: 18 start-page: 4131 issue: 12 year: 2018 ident: 10.1016/j.engappai.2021.104282_b65 article-title: Model updating for Nam O bridge using particle swarm optimization algorithm and genetic algorithm publication-title: Sensors doi: 10.3390/s18124131 – start-page: 53 year: 2018 ident: 10.1016/j.engappai.2021.104282_b53 article-title: Introduction to swarm intelligence publication-title: Adv. Swarm Intell. Optim. Probl. Comput. Sci. – year: 2018 ident: 10.1016/j.engappai.2021.104282_b52 – ident: 10.1016/j.engappai.2021.104282_b12 – volume: 107 year: 2020 ident: 10.1016/j.engappai.2021.104282_b40 article-title: Improved ANN technique combined with jaya algorithm for crack identification in plates using XIGA and experimental analysis publication-title: Theor. Appl. Fract. Mech. doi: 10.1016/j.tafmec.2020.102554 – volume: 205 start-page: 285 year: 2019 ident: 10.1016/j.engappai.2021.104282_b41 article-title: Fast simulations for solving fracture mechanics inverse problems using POD-RBF XIGA and jaya algorithm publication-title: Eng. Fract. Mech. doi: 10.1016/j.engfracmech.2018.09.032 – start-page: 845 year: 2016 ident: 10.1016/j.engappai.2021.104282_b44 article-title: High performance parallel graph coloring on gpgpus – volume: 37 start-page: 769 issue: 4 year: 2010 ident: 10.1016/j.engappai.2021.104282_b56 article-title: A search space “cartography” for guiding graph coloring heuristics publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2009.06.024 – volume: 151 start-page: 379 issue: 2 year: 2003 ident: 10.1016/j.engappai.2021.104282_b3 article-title: A variable neighborhood search for graph coloring publication-title: European J. Oper. Res. doi: 10.1016/S0377-2217(02)00832-9 – start-page: 112 year: 2015 ident: 10.1016/j.engappai.2021.104282_b49 article-title: A new tabucol embedded artificial bee colony based algorithm for graph coloring – volume: 71 start-page: 1 year: 2018 ident: 10.1016/j.engappai.2021.104282_b68 article-title: Tabu search with feasible and infeasible searches for equitable coloring publication-title: Eng. Appl. Artif. Intell. doi: 10.1016/j.engappai.2018.01.012 – volume: 32 start-page: 260 issue: 2 year: 1987 ident: 10.1016/j.engappai.2021.104282_b11 article-title: Some experiments with simulated annealing for coloring graphs publication-title: European J. Oper. Res. doi: 10.1016/S0377-2217(87)80148-0 – start-page: 231 year: 2019 ident: 10.1016/j.engappai.2021.104282_b54 article-title: Graph coloring on the GPU – volume: 1 start-page: 67 issue: 1 year: 1997 ident: 10.1016/j.engappai.2021.104282_b69 article-title: No free lunch theorems for optimization publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/4235.585893 – volume: 38 start-page: 576 issue: 10–11 year: 2012 ident: 10.1016/j.engappai.2021.104282_b10 article-title: Graph coloring algorithms for multi-core and massively multithreaded architectures publication-title: Parallel Comput. doi: 10.1016/j.parco.2012.07.001 – volume: 19 start-page: 165 issue: 2 year: 2001 ident: 10.1016/j.engappai.2021.104282_b42 article-title: A GRASP for coloring sparse graphs publication-title: Comput. Optim. Appl. doi: 10.1023/A:1011237503342 – volume: 39 start-page: 345 issue: 4 year: 1987 ident: 10.1016/j.engappai.2021.104282_b37 article-title: Using tabu search techniques for graph coloring publication-title: Computing doi: 10.1007/BF02239976 – volume: 23 start-page: 43 issue: 1 year: 1976 ident: 10.1016/j.engappai.2021.104282_b29 article-title: The complexity of near-optimal graph coloring publication-title: J. ACM doi: 10.1145/321921.321926 – volume: 52 start-page: 10 year: 2016 ident: 10.1016/j.engappai.2021.104282_b18 article-title: A novel multistart hyper-heuristic algorithm on the grid for the quadratic assignment problem publication-title: Eng. Appl. Artif. Intell. doi: 10.1016/j.engappai.2016.02.004 – volume: 16 start-page: 428 issue: 3 year: 1994 ident: 10.1016/j.engappai.2021.104282_b8 article-title: Improvements to graph coloring register allocation publication-title: ACM Trans. Program. Lang. Syst. (TOPLAS) doi: 10.1145/177492.177575 – volume: 84 start-page: 489 issue: 6 year: 1979 ident: 10.1016/j.engappai.2021.104282_b43 article-title: A graph coloring algorithm for large scheduling problems publication-title: J. Res. Natl. Bur. Stand. doi: 10.6028/jres.084.024 – volume: 43 start-page: 303 issue: 3 year: 2011 ident: 10.1016/j.engappai.2021.104282_b60 article-title: Teaching–learning-based optimization: a novel method for constrained mechanical design optimization problems publication-title: Comput. Aided Des. doi: 10.1016/j.cad.2010.12.015 – start-page: 109 year: 1972 ident: 10.1016/j.engappai.2021.104282_b50 article-title: Graph coloring algorithms – volume: 20 start-page: 302 issue: 2 year: 2008 ident: 10.1016/j.engappai.2021.104282_b47 article-title: A metaheuristic approach for the vertex coloring problem publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.1070.0245 – volume: 177 start-page: 421 year: 2018 ident: 10.1016/j.engappai.2021.104282_b63 article-title: Damage assessment in structures using combination of a modified cornwell indicator and genetic algorithm publication-title: Eng. Struct. doi: 10.1016/j.engstruct.2018.09.070 – volume: 5 issue: 1 year: 2008 ident: 10.1016/j.engappai.2021.104282_b48 article-title: A new exam scheduling algorithm using graph coloring. publication-title: Int. Arab J. Inf. Technol. (IAJIT) – volume: 93 start-page: 191 issue: 2–3 year: 1999 ident: 10.1016/j.engappai.2021.104282_b15 article-title: On a graph-theoretical model for cyclic register allocation publication-title: Discrete Appl. Math. doi: 10.1016/S0166-218X(99)00105-5 – start-page: 2093 year: 1998 ident: 10.1016/j.engappai.2021.104282_b33 article-title: Tabu search – start-page: 745 year: 1998 ident: 10.1016/j.engappai.2021.104282_b20 article-title: A new genetic local search algorithm for graph coloring – volume: 3 start-page: 379 issue: 4 year: 1999 ident: 10.1016/j.engappai.2021.104282_b25 article-title: Hybrid evolutionary algorithms for graph coloring publication-title: J. Comb. Optim. doi: 10.1023/A:1009823419804 – volume: 137 year: 2019 ident: 10.1016/j.engappai.2021.104282_b19 article-title: A survey on new generation metaheuristic algorithms publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2019.106040 – volume: 212 start-page: 79 year: 2012 ident: 10.1016/j.engappai.2021.104282_b14 article-title: A note on teaching–learning-based optimization algorithm publication-title: Inform. Sci. doi: 10.1016/j.ins.2012.05.009 – volume: 14 start-page: 654 issue: 3 year: 1993 ident: 10.1016/j.engappai.2021.104282_b39 article-title: A parallel graph coloring heuristic publication-title: SIAM J. Sci. Comput. doi: 10.1137/0914041 – volume: 44 start-page: 965 issue: 8 year: 2012 ident: 10.1016/j.engappai.2021.104282_b66 article-title: Multi-objective optimization of combined brayton and inverse brayton cycles using advanced optimization algorithms publication-title: Eng. Optim. doi: 10.1080/0305215X.2011.624183 – volume: 51 start-page: 282 year: 2014 ident: 10.1016/j.engappai.2021.104282_b73 article-title: An exact algorithm with learning for the graph coloring problem publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2014.05.017 – volume: 33 start-page: 48 year: 2015 ident: 10.1016/j.engappai.2021.104282_b46 article-title: Modified cuckoo optimization algorithm (MCOA) to solve graph coloring problem publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2015.04.020 – volume: 26 start-page: 430 issue: 1 year: 2013 ident: 10.1016/j.engappai.2021.104282_b58 article-title: Multi-objective optimization of two stage thermoelectric cooler using a modified teaching–learning-based optimization algorithm publication-title: Eng. Appl. Artif. Intell. doi: 10.1016/j.engappai.2012.02.016 – volume: 22 start-page: 251 issue: 4 year: 1979 ident: 10.1016/j.engappai.2021.104282_b7 article-title: New methods to color the vertices of a graph publication-title: Commun. ACM doi: 10.1145/359094.359101 – volume: 12 start-page: 1131 issue: 12 year: 2000 ident: 10.1016/j.engappai.2021.104282_b32 article-title: Scalable parallel graph coloring algorithms publication-title: Concurrency, Pract. Exp. doi: 10.1002/1096-9128(200010)12:12<1131::AID-CPE528>3.0.CO;2-2 – volume: 39 start-page: 1724 issue: 7 year: 2012 ident: 10.1016/j.engappai.2021.104282_b62 article-title: A new DSATUR-based algorithm for exact vertex coloring publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2011.10.008 – volume: 217 start-page: 151 year: 2017 ident: 10.1016/j.engappai.2021.104282_b13 article-title: Solving vertex coloring problems as maximum weight stable set problems publication-title: Discrete Appl. Math. doi: 10.1016/j.dam.2016.09.018 – volume: 203 start-page: 241 issue: 1 year: 2010 ident: 10.1016/j.engappai.2021.104282_b45 article-title: A memetic algorithm for graph coloring publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2009.07.016 – volume: 33 start-page: 2547 issue: 9 year: 2006 ident: 10.1016/j.engappai.2021.104282_b26 article-title: A survey of local search methods for graph coloring publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2005.07.028 |
| SSID | ssj0003846 |
| Score | 2.443679 |
| Snippet | The Graph Coloring Problem (GCP) can be simply defined as partitioning the vertices of a graph into independent sets while minimizing the number of colors... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 104282 |
| SubjectTerms | Graph coloring Memetic Optimization Parallel TabuCol TLBO |
| Title | Memetic Teaching–Learning-Based Optimization algorithms for large graph coloring problems |
| URI | https://dx.doi.org/10.1016/j.engappai.2021.104282 |
| Volume | 102 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Baden-Württemberg Complete Freedom Collection (Elsevier) customDbUrl: eissn: 1873-6769 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0003846 issn: 0952-1976 databaseCode: GBLVA dateStart: 20110101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection customDbUrl: eissn: 1873-6769 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0003846 issn: 0952-1976 databaseCode: .~1 dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection EURAC customDbUrl: eissn: 1873-6769 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0003846 issn: 0952-1976 databaseCode: ACRLP dateStart: 19950201 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: ScienceDirect Freedom Collection Journals customDbUrl: eissn: 1873-6769 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0003846 issn: 0952-1976 databaseCode: AIKHN dateStart: 19950201 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVLSH databaseName: Elsevier Journals customDbUrl: mediaType: online eissn: 1873-6769 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0003846 issn: 0952-1976 databaseCode: AKRWK dateStart: 19880301 isFulltext: true providerName: Library Specific Holdings |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT8JAEN4QvHjxbcQH2YPX0te23R6RSFACJgqRxEPT7m4RAoUAXo3_wX_oL3GGbn0kJhw8Nd3sNM10d75vp_Mg5BLrp1iO4IZkKbpuAmnE0k4MpPcyFApAC_2Qna7f6rPbgTcokUaRC4Nhldr25zZ9ba31iKm1ac5HI_MByAFsN9jM9tqbgkl8jAXYxaD2-h3m4fI8WQcmGzj7R5bwuKayYTyfxyM4Jzo2_u50uPM3QP0AneYe2dFskdbzF9onJZUdkF3NHKnel0sYKpozFGOH5KmjppigSHs6XvLj7V0XUx0aV4Bdkt6BuZjqPEwaT4azxWj1PF1S4LF0ghHidF3OmmJha3T_Ud19ZnlE-s3rXqNl6E4KhnBtZ2UEKQukAOjxRAyYbrFUitQSQiaWcpmfiIQJwG2uPOXZrgp5zCVPWJpwFUoXztvHpJzNMnVCaBIKyS0_9lIsnO-HPBVW6gXALGIfnigqxCvUFwldZhy7XUyiIp5sHBVqj1DtUa72CjG_5OZ5oY2NEmHxdaJfSyYCNNgge_oP2TOyjXd5vNg5Ka8WL-oCmMkqqa6XXpVs1W_arS5e2_eP7U_ZYue7 |
| linkProvider | Elsevier |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV07T8MwELZKGWDhjShPD6xpnk6cESqqAm0ZaKVKDFFiOyVVm0ZtWBH_gX_IL-GcOFAkJAZWxxdFF_u-8_nuO4QuJX-KYTGqcSeWoRuPayE3I02699xnAkBLxiF7fbczdO5GZFRDraoWRqZVKttf2vTCWqsRXWlTz5JEfwTnALYbbGaziKb4a2jdIZYnT2DN1-88D5uW1TowW5PTV8qEJ02RjsMsCxM4KFqmvO-0qPU7Qq2gTnsHbSl3EV-VX7SLaiLdQ9vKdcRqYy5hqOrOUI3to6eemMkKRTxQCZMfb--KTXWsXQN4cfwA9mKmCjFxOB3PF0n-PFticGTxVKaI44LPGktmaxn_w6r9zPIADds3g1ZHU60UNGabVq55seNxBthDWAigbjgxZ7HBGI8MYTtuxCKHAXBTQQQxbeHTkHIaOXFEhc9tOHAfono6T8URwpHPODXckMSSOd_1acyMmHjgWoQuvJE1EKnUFzDFMy7bXUyDKqFsElRqD6Tag1LtDaR_yWUl08afEn71d4IfayYAOPhD9vgfshdoozPodYPubf_-BG3KJ2Xy2Cmq54sXcQZuSh6dF8vwEwZM560 |
| 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=Memetic+Teaching%E2%80%93Learning-Based+Optimization+algorithms+for+large+graph+coloring+problems&rft.jtitle=Engineering+applications+of+artificial+intelligence&rft.au=Dokeroglu%2C+Tansel&rft.au=Sevinc%2C+Ender&rft.date=2021-06-01&rft.issn=0952-1976&rft.volume=102&rft.spage=104282&rft_id=info:doi/10.1016%2Fj.engappai.2021.104282&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_engappai_2021_104282 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0952-1976&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0952-1976&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0952-1976&client=summon |