Evolution of Search Algorithms Using Graph Structured Program Evolution

Authors:
Shinichi Shirakawa;Tomoharu Nagao
Affiliations:
Graduate School of Environment and Information Sciences, Yokohama National University, Yokohama, Japan 240-8501;Graduate School of Environment and Information Sciences, Yokohama National University, Yokohama, Japan 240-8501
Venue:
EuroGP '09 Proceedings of the 12th European Conference on Genetic Programming
Year:
2009

Citing 11
Cited 0

Genetic programming: on the programming of computers by means of natural selection

Genetic programming: on the programming of computers by means of natural selection
A computationally efficient evolutionary algorithm for real-parameter optimization

Evolutionary Computation
Cartesian Genetic Programming

Proceedings of the European Conference on Genetic Programming
Evolving Evolutionary Algorithms Using Linear Genetic Programming

Evolutionary Computation
Graph structured program evolution

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Evolution of hyperheuristics for the biobjective 0/1 knapsack problem by multiobjective genetic programming

Proceedings of the 10th annual conference on Genetic and evolutionary computation
A genetic programming approach to the generation of hyper-heuristics for the uncapacitated examination timetabling problem

EPIA'07 Proceedings of the aritficial intelligence 13th Portuguese conference on Progress in artificial intelligence
Evolving bin packing heuristics with genetic programming

PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Evolving crossover operators for function optimization

EuroGP'06 Proceedings of the 9th European conference on Genetic Programming
Evolving the structure of the particle swarm optimization algorithms

EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
No free lunch theorems for optimization

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Numerous evolutionary computation (EC) techniques and related improvements showing effectiveness in various problem domains have been proposed in recent studies. However, it is difficult to design effective search algorithms for given target problems. It is therefore essential to construct effective search algorithms automatically. In this paper, we propose a method for evolving search algorithms using Graph Structured Program Evolution (GRAPE), which has a graph structure and is one of the automatic programming techniques developed recently. We apply the proposed method to construct search algorithms for benchmark function optimization and template matching problems. Numerical experiments show that the constructed search algorithms are effective for utilized search spaces and also for several other search spaces.