An application of genetic programming to the 4-op problem using map-trees

Tevfik Aytekin, E. Erkan Korkmaz, H. Altay Güvenir

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)

Abstract

In Genetic programming (GP)'applications the programs are expressed as parse trees. A node of a parse tree is an element either from the function-set or terminal-set, and an element of a terminal set can be used in a parse tree more than once. However, when we attempt to use the elements in the terminal set at most once, we encounter problems in creating the initial random population and in crossover and mutation operations. 4-Op problem is an example for such a situation. We developed a technique called map-trees to overcome these anomalies. Experimental results on 4-Op using map-trees are presented.

Original languageEnglish
Title of host publicationProgress in Evolutionary Computation - AI 1993 and AI 1994 Workshops on Evolutionary Computation, Selected Papers
EditorsXin Yao
PublisherSpringer Verlag
Pages28-40
Number of pages13
ISBN (Print)3540601546, 9783540601548
DOIs
Publication statusPublished - 1995
Externally publishedYes
EventWorkshops on Evolutionary Computation, AI 1993 and held with Workshops on Evolutionary Computation, AI 1994 - Armidale, Australia
Duration: 21 Nov 199422 Nov 1994

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume956
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceWorkshops on Evolutionary Computation, AI 1993 and held with Workshops on Evolutionary Computation, AI 1994
Country/TerritoryAustralia
CityArmidale
Period21/11/9422/11/94

Fingerprint

Dive into the research topics of 'An application of genetic programming to the 4-op problem using map-trees'. Together they form a unique fingerprint.

Cite this