Adaptive genetic network programming

Xianneng Li, Wen He, Kotaro Hirasawa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Genetic Network Programming (GNP) is derived from Genetic Algorithm (GA) and Genetic Programming (GP), which applies evolution theory to evolve a population of directed graph to model complex systems. It has been shown that GNP can solve typical control problems, as well as many real-world problems. However, studying GNP is mainly focused on the specific aspect, while the fundamental characteristics that ensure the success of GNP are rarely investigated in the previous research. This paper reveals an important feature of GNP - reusability of nodes - to efficiently identify and formulate the building blocks of evolution. Accordingly, adaptive GNP is developed which self-adapts both crossover and mutation probabilities of each search variable to circumstances. The adaptation allows the automatic adjustment of evolution bias toward the frequently reused nodes in high-quality individuals. The adaptive GNP is compared with traditional GNP in a benchmark control testbed to evaluate its superiority.

Original languageEnglish
Title of host publicationProceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1808-1815
Number of pages8
ISBN (Print)9781479914883
DOIs
Publication statusPublished - 2014 Sep 16
Event2014 IEEE Congress on Evolutionary Computation, CEC 2014 - Beijing
Duration: 2014 Jul 62014 Jul 11

Other

Other2014 IEEE Congress on Evolutionary Computation, CEC 2014
CityBeijing
Period14/7/614/7/11

Fingerprint

Network Programming
Genetic Network
Genetic Programming
Genetic programming
Directed graphs
Reusability
Testbeds
Large scale systems
Genetic algorithms
Vertex of a graph
Testbed
Directed Graph
Building Blocks
Crossover
Control Problem
Complex Systems
Adjustment
Mutation
Genetic Algorithm
Benchmark

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computational Theory and Mathematics
  • Theoretical Computer Science

Cite this

Li, X., He, W., & Hirasawa, K. (2014). Adaptive genetic network programming. In Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014 (pp. 1808-1815). [6900290] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/CEC.2014.6900290

Adaptive genetic network programming. / Li, Xianneng; He, Wen; Hirasawa, Kotaro.

Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014. Institute of Electrical and Electronics Engineers Inc., 2014. p. 1808-1815 6900290.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Li, X, He, W & Hirasawa, K 2014, Adaptive genetic network programming. in Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014., 6900290, Institute of Electrical and Electronics Engineers Inc., pp. 1808-1815, 2014 IEEE Congress on Evolutionary Computation, CEC 2014, Beijing, 14/7/6. https://doi.org/10.1109/CEC.2014.6900290
Li X, He W, Hirasawa K. Adaptive genetic network programming. In Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014. Institute of Electrical and Electronics Engineers Inc. 2014. p. 1808-1815. 6900290 https://doi.org/10.1109/CEC.2014.6900290
Li, Xianneng ; He, Wen ; Hirasawa, Kotaro. / Adaptive genetic network programming. Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014. Institute of Electrical and Electronics Engineers Inc., 2014. pp. 1808-1815
@inproceedings{c5098543838d40b0b6a060571f44e3f5,
title = "Adaptive genetic network programming",
abstract = "Genetic Network Programming (GNP) is derived from Genetic Algorithm (GA) and Genetic Programming (GP), which applies evolution theory to evolve a population of directed graph to model complex systems. It has been shown that GNP can solve typical control problems, as well as many real-world problems. However, studying GNP is mainly focused on the specific aspect, while the fundamental characteristics that ensure the success of GNP are rarely investigated in the previous research. This paper reveals an important feature of GNP - reusability of nodes - to efficiently identify and formulate the building blocks of evolution. Accordingly, adaptive GNP is developed which self-adapts both crossover and mutation probabilities of each search variable to circumstances. The adaptation allows the automatic adjustment of evolution bias toward the frequently reused nodes in high-quality individuals. The adaptive GNP is compared with traditional GNP in a benchmark control testbed to evaluate its superiority.",
author = "Xianneng Li and Wen He and Kotaro Hirasawa",
year = "2014",
month = "9",
day = "16",
doi = "10.1109/CEC.2014.6900290",
language = "English",
isbn = "9781479914883",
pages = "1808--1815",
booktitle = "Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Adaptive genetic network programming

AU - Li, Xianneng

AU - He, Wen

AU - Hirasawa, Kotaro

PY - 2014/9/16

Y1 - 2014/9/16

N2 - Genetic Network Programming (GNP) is derived from Genetic Algorithm (GA) and Genetic Programming (GP), which applies evolution theory to evolve a population of directed graph to model complex systems. It has been shown that GNP can solve typical control problems, as well as many real-world problems. However, studying GNP is mainly focused on the specific aspect, while the fundamental characteristics that ensure the success of GNP are rarely investigated in the previous research. This paper reveals an important feature of GNP - reusability of nodes - to efficiently identify and formulate the building blocks of evolution. Accordingly, adaptive GNP is developed which self-adapts both crossover and mutation probabilities of each search variable to circumstances. The adaptation allows the automatic adjustment of evolution bias toward the frequently reused nodes in high-quality individuals. The adaptive GNP is compared with traditional GNP in a benchmark control testbed to evaluate its superiority.

AB - Genetic Network Programming (GNP) is derived from Genetic Algorithm (GA) and Genetic Programming (GP), which applies evolution theory to evolve a population of directed graph to model complex systems. It has been shown that GNP can solve typical control problems, as well as many real-world problems. However, studying GNP is mainly focused on the specific aspect, while the fundamental characteristics that ensure the success of GNP are rarely investigated in the previous research. This paper reveals an important feature of GNP - reusability of nodes - to efficiently identify and formulate the building blocks of evolution. Accordingly, adaptive GNP is developed which self-adapts both crossover and mutation probabilities of each search variable to circumstances. The adaptation allows the automatic adjustment of evolution bias toward the frequently reused nodes in high-quality individuals. The adaptive GNP is compared with traditional GNP in a benchmark control testbed to evaluate its superiority.

UR - http://www.scopus.com/inward/record.url?scp=84908569839&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84908569839&partnerID=8YFLogxK

U2 - 10.1109/CEC.2014.6900290

DO - 10.1109/CEC.2014.6900290

M3 - Conference contribution

SN - 9781479914883

SP - 1808

EP - 1815

BT - Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014

PB - Institute of Electrical and Electronics Engineers Inc.

ER -