Skip to main content
Kent Academic Repository

Using tabu search and genetic algorithms in mathematics research

Johnson, Colin G. (2004) Using tabu search and genetic algorithms in mathematics research. In: Lotfi, Ahmed, ed. Proceedings of the Fifth International Conference on Recent Advances in Soft Computing. . pp. 243-248. Nottingham Trent University ISBN 1-84233-110-8. (KAR id:14050)

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.

Item Type: Conference or workshop item (Paper)
Uncontrolled keywords: experimental mathematics, genetic algorithms, tabu search, heuristics, heuristic search, topology
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Mark Wheadon
Date Deposited: 24 Nov 2008 18:01 UTC
Last Modified: 16 Nov 2021 09:52 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/14050 (The current URI for this page, for reference purposes)

University of Kent Author Information

  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.