School of Computing

Multi-level neutrality in optimization

Colin G. Johnson

In Proceedings of the 2008 IEEE World Congress on Computational Intelligence, pages 182-196. IEEE Press, June 2008.

Abstract

This paper explores the idea of neutrality in heuristic optimization algorithms. In particular, the effect of having multiple levels of neutrality in representations is explored. Two experiments using a fitness-adaptive walk algorithm are carried out: the first is concerned with function optimization with Random Boolean Networks, the second with a tunable neutral mapping applied to the hierarchical if-and-only-if function. In both of these cases it is shown that a two-level neutral mapping can be found that performs better than both nonneutral mappings and mappings with a single level of neutrality.

Download publication 293 kbytes (PDF)

Bibtex Record

@inproceedings{2809,
author = {Colin G. Johnson},
title = {Multi-Level Neutrality in Optimization},
month = {June},
year = {2008},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2008/2809},
    publication_type = {inproceedings},
    submission_id = {7474_1220867878},
    ISBN = {978-1-4244-1823-7},
    booktitle = {Proceedings of the 2008 IEEE World Congress on Computational Intelligence},
    publisher = {IEEE Press},
    refereed = {Yes},
}

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 21/03/2014