机组最优化问题的改进遗传算法  

An Improved Genetic Algorithm of Unit Optimization Problem

作　　者：龚瑞昆[1] 王新泽[1] 

机构地区：[1]河北联合大学电气工程学院,河北唐山063009

出　　处：《河北联合大学学报（自然科学版）》2013年第1期51-55,共5页Journal of Hebei Polytechnic University:Social Science Edition

摘　　要：机组组合问题十分复杂,变量数和约束条件又很多,是一个高维数、非凸的、离散的、非线性的优化问题,很难找出理论上的最优解。提出了改进的遗传算法,即将ALOPEX算法和遗传算法结合起来从而解决复杂的机组组合问题。Unit combination problem is very complicated. There are a lot of variable number and constraint condition. It is a high dimension, non-convex, discrete and nonlinear optimization problem. It is difficult to find the opfimal solution in theory. This paper puts forward the improved genetic algorithm, that is combine the ALOPEX algorithm and genetic algorithm to solve the complex unit commitment problem.

关 键 词：机组优化组合 遗传算法 ALOPEX 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]