Graph coloring and recombination

Lewis, Rhyd ORCID: https://orcid.org/0000-0003-1046-811X 2015. Graph coloring and recombination. Kacprzyk, J. and Pedrycz, W., eds. Springer Handbook of Computational Intelligence, Springer, pp. 1239-1254.

Full text not available from this repository.

Abstract

It is widely acknowledged that some of the most powerful algorithms for graph coloring involve the combination of evolutionary-based methods with exploitative local search-based techniques. This chapter conducts a review and discussion of such methods, principally focussing on the role that recombination plays in this process. In particular we observe that, while in some cases recombination seems to be usefully combining substructures inherited from parents, in other cases it is merely acting as a macro perturbation operator, helping to reinvigorate the search from time to time.

Item Type:	Book Section
Date Type:	Publication
Status:	Published
Schools:	Mathematics
Subjects:	Q Science > QA Mathematics
Publisher:	Springer
ISBN:	9783662435045
Last Modified:	28 Oct 2022 09:13
URI:	https://orca.cardiff.ac.uk/id/eprint/73772

Citation Data

Cited 2 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item