Efficient-Genetic Algorithm for Engineering and Management Applications

• Main Authors: Zong-Yao Chen, 陳宗堯
• Other Authors: Chih-Fong Tsai
• Format: Others
• Language: zh-TW
• Published: 2014
• Online Access: http://ndltd.ncl.edu.tw/handle/18628492578549405968

博士 === 國立中央大學 === 資訊管理學系 === 103 === Evolutionary computations have been widely used in many real word problems. In particular, evolutionary algorithms can be considered as the global optimization methods with a met heuristic or stochastic optimization character and they are widely applied for black box problems (no derivatives known) and non-deterministic polynomial-time hard problems (NP-hard), often in the context of expensive optimization. However, their computational complexities are very high leading to the major limitation in practice. In this dissertation, we introduce a novel Efficient-Genetic Algorithm (EGA), which fits “biological evolution” into the evolutionary process. In other words, after long-term evolution, individuals find the most efficient way to allocate resources and evolve. There are two experiments to validate the EGA. The first experimental study is based on a scheduling problem, and two state-of-the-art algorithms including Genetic algorithm (GA) and Immunity algorithm (IA) are compared with EGA. The second one focuses on the data reduction problem where four very high dimensional datasets are used. In addition, four state-of-the-art algorithms including IB3, DROP3, ICF, and GA are compared with EGA.