Improving the Tartarus problem as a benchmark in genetic programming

Thomas D. Griffiths*, Anikó Ekárt

*Corresponding author for this work

Research output: Chapter in Book/Published conference outputConference publication


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.

Original languageEnglish
Title of host publicationGenetic programming
Subtitle of host publication20th European Conference, EuroGP 2017, Amsterdam, The Netherlands, April 19-21, 2017, proceedings
EditorsJames McDermott, Mauro Castelli, Lukas Sekanina, et al
Place of PublicationCham (CH)
Number of pages16
ISBN (Electronic)978-3-319-55696-3
ISBN (Print)978-3-319-55695-6
Publication statusE-pub ahead of print - 15 Mar 2017
Event20th European Conference on Genetic Programming, EuroGP 2017 - Amsterdam, Netherlands
Duration: 19 Apr 201721 Apr 2017

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference20th European Conference on Genetic Programming, EuroGP 2017
City Amsterdam


  • benchmark
  • genetic programming
  • tartarus


Dive into the research topics of 'Improving the Tartarus problem as a benchmark in genetic programming'. Together they form a unique fingerprint.

Cite this