- author = "Tuan-Hao Hoang and Nguyen Xuan Hoai and Nguyen Thi Hien and R I McKay and Daryl Essam",
- title = "{ORDERTREE}: a new test problem for genetic programming",
- booktitle = "{GECCO 2006:} Proceedings of the 8th annual conference on Genetic and evolutionary computation",
- year = "2006",
- editor = "Maarten Keijzer and Mike Cattolico and Dirk Arnold and Vladan Babovic and Christian Blum and Peter Bosman and Martin V. Butz and Carlos {Coello Coello} and Dipankar Dasgupta and Sevan G. Ficici and James Foster and Arturo Hernandez-Aguirre and Greg Hornby and Hod Lipson and Phil McMinn and Jason Moore and Guenther Raidl and Franz Rothlauf and Conor Ryan and Dirk Thierens",
- volume = "1",
- ISBN = "1-59593-186-4",
- pages = "807--814",
- address = "Seattle, Washington, USA",
-
URL = "
http://gpbib.cs.ucl.ac.uk/gecco2006/docs/p807.pdf",
-
DOI = "
10.1145/1143997.1144141",
- publisher = "ACM Press",
- publisher_address = "New York, NY, 10286-1405, USA",
- month = "8-12 " # jul,
- organisation = "ACM SIGEVO (formerly ISGEC)",
- keywords = "genetic algorithms, genetic programming, benchmark problems, graph and tree search strategies, languages, problem difficulty, theory",
- acmid = "1144141",
- size = "8 pages",
- abstract = "In this paper, we describe a new test problem for genetic programming (GP), ORDERTREE. We argue that it is a natural analogue of ONEMAX, a popular GA test problem, and that it also avoids some of the known weaknesses of other benchmark problems for Genetic Programming. Through experiments, we show that the difficulty of the problem can be tuned not only by increasing the size of the problem, but also by increasing the non-linearity in the fitness structure.",
-
notes = "GECCO-2006 A joint meeting of the fifteenth
international conference on genetic algorithms
(ICGA-2006) and the eleventh annual genetic programming
conference (GP-2006).
ACM Order Number 910060",
