Property | Value |
Name | NCL-TR-2007010 |
Description |
On The Extension of ECGA for Different Variable Types: Integers and Real Numbers
Abstract: Extended compact genetic algorithm (ECGA) is an algorithm that can solve hard problems in the binary domain. ECGA 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 (iECGA). 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. We also develop a new optimization framework that consists of the extended compact genetic algorithm (ECGA) and split-on-demand (SoD), an adaptive discretization technique, to tackle the characteristic determination problem for solid state devices. As most decision variables of characteristic determination problems are real numbers due to the modeling of physical phenomena, and ECGA is designed for handling discrete-type problems, a specific mechanism to transform the variable types of the two ends is in order. Therefore, in this study, we employ the proposed framework on three study cases to demonstrate that the technique proposed in the domain of evolutionary computation can provide not only the high quality optimization results but also the flexibility to handle problems of different formulations. |
Filename | NCL-TR-2007010.pdf |
Filesize | 992.46 kB |
Filetype | pdf (Mime Type: application/pdf) |
Creator | ypchen |
Created On: | 08/28/2007 14:29 |
Viewers | Everybody |
Maintained by | Publisher |
Hits | 3143 Hits |
Last updated on | 12/09/2010 14:32 |
Homepage |