Linear genetic programming

"Linear genetic programming" is unrelated to "<a href="/facts/Linear_programming/GduXFQxT">linear programming</a>".
Linear genetic programming (LGP) is a particular method of <a href="/facts/Genetic_programming/kGa2jr0w">genetic programming</a> wherein <a href="/facts/Computer_programs/e38jH9N9">computer programs</a> in a population are represented as a sequence of <a href="/facts/Instruction_(computer_science)/8p8vwUeE">register-based instructions</a> from an <a href="/facts/Imperative_programming/6b5dUnE1">imperative programming language</a> or <a href="/facts/Machine_code/bgdQ1Fxf">machine language</a>. The adjective "linear" stems from the fact that each LGP program is a sequence of instructions and the sequence of instructions is normally executed sequentially. Like in other programs, the data flow in LGP can be modeled as a graph that will visualize the potential multiple usage of <a href="/facts/Processor_register/32RvbUdz">register</a> contents and the existence of structurally noneffective code (<a href="/facts/Introns/LS6YdBEK">introns</a>) which are two main differences of this <a href="/facts/Genetic_representation/Ph0A2E0R">genetic representation</a> from the more common tree-based <a href="/facts/Genetic_programming/kGa2jr0w">genetic programming</a> (TGP) variant.

Like other Genetic Programming methods, Linear genetic programming requires the input of data to run the program population on. Then, the output of the program (its behaviour) is judged against some target behaviour, using a fitness function. However, LGP is generally more efficient than tree genetic programming due to its two main differences mentioned above: Intermediate results (stored in registers) can be reused and a simple intron removal algorithm exists that can be executed to remove all non-effective code prior to programs being run on the intended data. These two differences often result in compact solutions and substantial computational savings compared to the highly constrained data flow in trees and the common method of executing all tree nodes in TGP. Furthermore, LGP naturally has multiple outputs by defining multiple output registers and easily cooperates with <a href="/facts/Control_flow/2XTDfErC">control flow operations</a>.
Linear genetic programming has been applied in many domains, including system modeling and system control with considerable success.
Linear genetic programming should not be confused with linear tree programs in tree genetic programming, program composed of a variable number of unary functions and a single <a href="/facts/Leaf_node/RcXz9noF">terminal</a>. Note that linear tree GP differs from bit string <a href="/facts/Genetic_algorithms/WP2AFWuW">genetic algorithms</a> since a population may contain programs of different lengths and there may be more than two types of functions or more than two types of terminals.

Linear genetic programming open-in-new

Linear genetic programming