School of Computing

Using tabu search and genetic algorithms in mathematics research

Colin G. Johnson

In Ahmed Lotfi, editor, Proceedings of the Fifth International Conference on Recent Advances in Soft Computing, pages 182-196. Nottingham Trent University, December 2004.

Abstract

This paper discusses an ongoing project which uses computational heuristic search techniques such as tabu search and genetic algorithms as a tool for mathematics research. We discuss three ways in which such search techniques can be useful for mathematicians: in nding counterexamples to conjectures, in enumerating examples, and in nding sequences of transformations between two objects which are conjectured to be related. These problem-types are discussed using examples from topology.

Download publication 195 kbytes (PDF)

Bibtex Record

@inproceedings{2034,
author = {Colin G. Johnson},
title = {Using tabu search and genetic algorithms in mathematics research},
month = {December},
year = {2004},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2004/2034},
    publication_type = {inproceedings},
    submission_id = {15004_1105440861},
    ISBN = {1-84233-110-8},
    booktitle = {Proceedings of the Fifth International Conference on Recent Advances in Soft Computing},
    editor = {Ahmed Lotfi},
    publisher = {Nottingham Trent University},
    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