Design and usage of a new benchmark problem for genetic programming

Date

2003-01-01

Author

KORKMAZ, EMİN ERKAN
Üçoluk, Göktürk

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

17
views

0
downloads

Not so many benchmark problems have been proposed in the area of Genetic Programming (GP). In this study, a new artificial benchmark problem is designed for GP. The different parameters that can be used to tune the difficulty of the problem are analyzed. Also, the initial experimental results obtained on different instances of the problem are presented.

Subject Keywords

Benchmark problem, Computer Engineer Department, Terminal element, Full binary tree, Real world domain

URI

https://hdl.handle.net/11511/53809

Journal

COMPUTER AND INFORMATION SCIENCES - ISCIS 2003

Collections

Department of Computer Engineering, Article

Citation Formats

E. E. KORKMAZ and G. Üçoluk, “Design and usage of a new benchmark problem for genetic programming,” COMPUTER AND INFORMATION SCIENCES - ISCIS 2003, vol. 2869, pp. 561–567, 2003, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/53809.