An Evolutionary Annealing Approach to Graph Coloring

Fotakis, D; Likothanassis, S; Stefanakos, S

dc.contributor.author	Fotakis, D	en
dc.contributor.author	Likothanassis, S	en
dc.contributor.author	Stefanakos, S	en
dc.date.accessioned	2014-03-01T02:49:02Z
dc.date.available	2014-03-01T02:49:02Z
dc.date.issued	2001	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/34247
dc.subject	Genetic Algorithm	en
dc.subject	Graph Coloring	en
dc.subject	Graph Coloring Problem	en
dc.subject	Heuristic Algorithm	en
dc.subject	Simulated Annealing	en
dc.title	An Evolutionary Annealing Approach to Graph Coloring	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/3-540-45365-2_13	en
heal.identifier.secondary	http://dx.doi.org/10.1007/3-540-45365-2_13	en
heal.publicationDate	2001	en
heal.abstract	This paper presents a new heuristic algorithm for the graph coloring problem based on a combination of genetic algorithms and sim- ulated annealing. Our algorithm exploits a novel crossover operator for graph coloring. Moreover, we investigate various ways in which simulated annealing can be used to enhance the performance of an evolutionary al- gorithm. Experiments performed on various collections of	en
heal.journalName	EvoWorkshops	en
dc.identifier.doi	10.1007/3-540-45365-2_13	en