Galván López, Edgar (2008) Efficient graph-based genetic programming representation with multiple outputs. International Journal of Automation and Computing, 5 (1). pp. 81-89. ISSN 1751-8520
|
Download (482kB)
| Preview
|
Abstract
In this work, we explore and study the implication of having more than one output on a genetic programming (GP) graph-representation. This approach, called multiple interactive outputs in a single tree (MIOST), is based on two ideas. First, we defined an approach, called interactivity within an individual (IWI), which is based on a graph-GP representation. Second, we add to the individuals created with the IWI approach multiple outputs in their structures and as a result of this, we have MIOST. As a first step, we analyze the effects of IWI by using only mutations and analyze its implications (i.e., presence of neutrality). Then, we continue testing the effectiveness of IWI by allowing mutations and the standard GP crossover in the evolutionary process. Finally, we tested the effectiveness of MIOST by using mutations and crossover and conducted extensive empirical results on different evolvable problems of different complexity taken from the literature. The results reported in this paper indicate that the proposed approach has a better overall performance in terms of consistency reaching feasible solutions.
| Item Type: | Article |
|---|---|
| Keywords: | Interactivity within an individual (IWI); multiple interactive outputs in a single tree (MIOST); neutrality; evolvable hardware; genetic programming (GP); |
| Academic Unit: | Faculty of Science and Engineering > Computer Science Faculty of Science and Engineering > Research Institutes > Hamilton Institute |
| Item ID: | 12338 |
| Identification Number: | https://doi.org/10.1007/s11633-008-0081-4 |
| Depositing User: | Edgar Galvan |
| Date Deposited: | 31 Jan 2020 12:19 |
| Journal or Publication Title: | International Journal of Automation and Computing |
| Publisher: | Springer |
| Refereed: | Yes |
| URI: | |
| Use Licence: | This item is available under a Creative Commons Attribution Non Commercial Share Alike Licence (CC BY-NC-SA). Details of this licence are available here |
Repository Staff Only(login required)
 |
Item control page |
Downloads
Downloads per month over past year
