Revisiting Genetic Network Programming (GNP): Towards the Simplified Genetic Operators

Abstract

Genetic network programming (GNP) is a relatively new type of graph-based evolutionary algorithm, which designs a directed graph structure for its individual representation. A number of studies have demonstrated its expressive ability to model complicated problems/systems and explored it from the perspectives of methodologies and applications. However, the unique features of its directed graph are relatively unexplored, which cause unnecessary dilemma for the further usage and promotion. This paper is dedicated to uncover this issue systematically and theoretically. It is proved that the traditional GNP with uniform genetic operators does not consider the ``transition by necessity”feature of the directed graph, which brings the unnecessary difficulty of evolution to cause invalid/negative evolution problems. Consequently, simplified genetic operators are developed to address these problems. Experimental results on two benchmark testbeds of the agent control problems are carried out to demonstrate its superiority over the traditional GNP and the state-of-the-art algorithms in terms of fitness results, search speed, and computation time.

Keywords

• Directed graph
• evolutionary algorithms
• genetic network programming
• invalid/negative evolution
• transition by necessity