An Evolutionary Algorithm for Graph Coloring Problems
Fathelalem F. Ali, Zensho Nakao, Richard B. Tan
Abstract
Open-access reader
Fathelalem F. Ali, Zensho Nakao, Richard B. Tan
Abstract
Open-access reader
This paper 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 better solutions. In experiments the algorithm is applied to random normal graphs instances as well as radio-coloring instances.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper 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 better solutions. In experiments the algorithm is applied to random normal graphs instances as well as radio-coloring instances.
Key concepts: Graph coloring, Greedy coloring, Evolutionary algorithm, Computer science, Algorithm, Exploit, List coloring, Graph