Browsing by Author "Hung, Ping-Chu"

Now showing 1 - 3 of 3

Characteristic Determination for Solid State Devices with Evolutionary Computation: A Case Study
(2007)
Hung, Ping-Chu
;
Chen, Ying-ping
;
Zan, Hsiao Wen
;
資訊工程學系
;
Department of Computer Science
In this paper, we develop a new optimization framework that consists of the extended compact genetic algorithm (ECGA) and split-on-demand (SoD) 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. In the proposed framework, ECGA is used as an optimization engine, and SoD is adopted as the interface between the engine and the problem. Moreover, instead of one mathematical model with various parameters. characteristic determination is in fact a set of problems of which the mathematical formulations may be very different. Therefore, in this study, we employ the proposed framework oil 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.
iECGA: Integer extended compact genetic algorithm
(2006-01-01)
Hung, Ping-Chu
;
Chen, Ying-Ping
;
資訊工程學系
;
Department of Computer Science
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.
iECGA: Integer extended compact genetic algorithm
(2006-01-01)
Hung, Ping-Chu
;
Chen, Ying-Ping
;
資訊工程學系
;
Department of Computer Science
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.