DocumentCode
3462528
Title
An evolutionary approach for graph coloring
Author
Ali, Fathelalem F. ; Nakao, Zensho ; Tan, Richard B. ; Chen, Yen-wei
Author_Institution
Dept. of Electron. & Electr. Eng., Univ. of the Ryukyus, Okinawa, Japan
Volume
5
fYear
1999
fDate
1999
Firstpage
527
Abstract
Presents an evolutionary algorithm for graph coloring problems. The proposed evolutionary algorithm works on artificial strings each of which represents some coloring solution. Using robust encoding and genetic operators, the algorithm exploits, and evolves new better solutions. The algorithm is applied to random normal graphs, and λ-coloring problems. Results as good as the best heuristic and local search methods are obtained
Keywords
computational complexity; genetic algorithms; graph colouring; λ-coloring problems; artificial strings; evolutionary approach; genetic operators; random normal graphs; robust encoding; Application specific integrated circuits; Computer science; Evolutionary computation; Genetics; Group technology; Manufacturing; NP-hard problem; Optimization methods; Robustness; Search methods;
fLanguage
English
Publisher
ieee
Conference_Titel
Systems, Man, and Cybernetics, 1999. IEEE SMC '99 Conference Proceedings. 1999 IEEE International Conference on
Conference_Location
Tokyo
ISSN
1062-922X
Print_ISBN
0-7803-5731-0
Type
conf
DOI
10.1109/ICSMC.1999.815607
Filename
815607
Link To Document