DocumentCode :
729380
Title :
A discrete flower pollination algorithm for graph coloring problem
Author :
Bensouyad, Meriem ; Saidouni, DjamelEddine
Author_Institution :
MISC Lab., Constantine 2 Univ., Constantine, Algeria
fYear :
2015
fDate :
24-26 June 2015
Firstpage :
151
Lastpage :
155
Abstract :
Flower pollination algorithm is a recent nature inspired algorithm for continuous optimization; this algorithm is inspired by the pollination process of flowers. In this paper, we introduce a discrete version of the algorithm to deal with the graph coloring problem. The performance of the algorithm is evaluated on benchmark instances set and the computational results show promising results where it achieves the exact solution in almost cases.
Keywords :
graph colouring; optimisation; continuous optimization; discrete flower pollination algorithm; discrete optimization; flower pollination process; graph coloring problem; nature inspired algorithm; Color; Complexity theory; Law; Optimization; Sociology; Statistics; Discrete Optimization; Flower Pollination Algorithm; Graph coloring;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Cybernetics (CYBCONF), 2015 IEEE 2nd International Conference on
Conference_Location :
Gdynia
Print_ISBN :
978-1-4799-8320-9
Type :
conf
DOI :
10.1109/CYBConf.2015.7175923
Filename :
7175923
Link To Document :
بازگشت