A Design of Genetic Programming Scheme with VLIW Concepts

Genetic programming (GP) is inspired by the popular genetic algorithm (GA). The searching result of GP is a program that includes both opera-tors and operands. The operators are the obstacle to the crossover and mutation process because invalid programs would be generated. In this paper, the concepts of VLIW is incorporated in the design of a GP scheme. A program in the proposed scheme is represented using only operands. The simulation results show that this approach is feasible and the performance could be increased by the instruction-level parallelism of the VLIW structure.