Improving the Tartarus problem as a benchmark in genetic programming


For empirical research on computer algorithms, it is essential to have a set of benchmark problems on which the relative performance of different methods and their applicability can be assessed. In the majority of computational research fields there are established sets of benchmark problems; however, the field of genetic programming lacks a similarly rigorously defined set of benchmarks. There is a strong interest within the genetic programming community to develop a suite of benchmarks. Following recent surveys [7], the desirable characteristics of a benchmark problem are now better defined. In this paper the Tartarus problem is proposed as a tunably difficult benchmark problem for use in Genetic Programming. The justification for this proposal is presented, together with guidance on its usage as a benchmark.

Publication DOI:
Divisions: ?? 50811700Jl ??
College of Engineering & Physical Sciences > Systems analytics research institute (SARI)
College of Engineering & Physical Sciences
Event Title: 20th European Conference on Genetic Programming, EuroGP 2017
Event Type: Other
Event Dates: 2017-04-19 - 2017-04-21
Uncontrolled Keywords: benchmark,genetic programming,tartarus,Theoretical Computer Science,Computer Science(all)
ISBN: 978-3-319-55695-6, 978-3-319-55696-3
Last Modified: 19 Feb 2024 08:44
Date Deposited: 06 Apr 2017 10:05
Full Text Link:
Related URLs: http://www.scop ... tnerID=8YFLogxK (Scopus URL)
PURE Output Type: Conference contribution
Published Date: 2017-03-15
Published Online Date: 2017-03-15
Accepted Date: 2017-03-15
Authors: Griffiths, Thomas D.
Ekárt, Anikó (ORCID Profile 0000-0001-6967-5397)



Version: Accepted Version

| Preview

Export / Share Citation


Additional statistics for this record