한국지능시스템학회:학술대회논문집 (Proceedings of the Korean Institute of Intelligent Systems Conference)
- 한국퍼지및지능시스템학회 2000년도 춘계학술대회 학술발표 논문집
- /
- Pages.232-235
- /
- 2000
개체 분포의 다양성을 유지시키는 GA를 위한 스키마 추출 기법
The Schema Extraction Method for GA Preserving Diversity of the Distributions in Population
- Jo, Yong-Gun (School of Electrical & Electronics Engineering, College of Engineering, Chung-Ang University) ;
- Jang, Sung-Hwan (School of Electrical & Electronics Engineering, College of Engineering, Chung-Ang University) ;
- Hoon Kang (School of Electrical & Electronics Engineering, College of Engineering, Chung-Ang University)
- 발행 : 2000.05.01
초록
In this paper, we introduce a new genetic reordering operator based on the concept of schema to solve the Traveling Salesman Problem(TSP). Because TSP is a well-known combinatorial optimization problem and belongs to a NP-complete problem, there is a huge solution space to be searched. For robustness to local minima, the operator separates selected strings into two parts to reduce the destructive probability of good building blocks. And it applies inversion to the schema part to prevent the premature convergence. At the same time, it searches new spaces of solutions. In addition, we have the non-schema part to be applied to inversion as well as for robustness to local minima. By doing so, we can preserve diversity of the distributions in population and make GA be adaptive to the dynamic environment.
키워드