Proceedings of the Korea Inteligent Information System Society Conference (한국지능정보시스템학회:학술대회논문집)
- 2004.11a
- /
- Pages.171-178
- /
- 2004
Designing New Algorithms Using Genetic Programming
Abstract
This study suggests a general paradigm enhancing genetic mutability. Mutability among heterogeneous members in a genetic population has been a major problem in application of genetic programming to diverse business problems. This suggested paradigm is implemented to developing new methods from existing methods. Within the evolutionary approach taken to designing new methods, a general representation scheme of the genetic programming framework, called a kernel, is introduced. The kernel is derived from the literature of algorithms and heuristics for combinatorial optimization problems. The commonality and differences among these methods have been identified and again combined by following the genetic inheritance merging them. The kernel was tested for selected methods in combinatorial optimization. It not only duplicates the methods in the literature, it also confirms that each of the possible solutions from the genetic mutation is in a valid form, a running program. This evolutionary method suggests diverse hybrid methods in the form of complete programs through evolutionary processes. It finally summarizes its findings from genetic simulation with insight.
Keywords
- Genetic Simulation;
- Generalizing Paradigm;
- Kernel;
- Combinatorial Optimization Methods;
- New Methods Development