標題: iECGA: Integer extended compact genetic algorithm
作者: Hung, Ping-Chu
Chen, Ying-Ping
資訊工程學系
Department of Computer Science
關鍵字: extended compact genetic algorithms;integer representations;genetic linkage;building blocks
公開日期: 1-Jan-2006
摘要: Extended compact genetic algorithm (ECCA) is an algorithm that can solve hard problems in the binary domain. ECCA is reliable and accurate because of the capability of detecting building blocks, but certain difficulties are encountered when we directly apply ECGA to problems in the integer domain. In this paper, we propose a new algorithm that extends ECGA, called integer extended compact genetic algorithm (iECCA). iECGA uses a modified probability model and inherits the capability of detecting building blocks from ECGA. iECGA is specifically designed for problems in the integer domain and can avoid the difficulties that ECGA encounters. With the experimental results, we show the performance comparisons between ECCA, iECGA, and a simple GA. The results indicate that iECGA has good performance on problems in the integer domain.
URI: http://hdl.handle.net/11536/151035
期刊: GECCO 2006: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOL 1 AND 2
起始頁: 1415
Appears in Collections:Conferences Paper