带修复操作整型编码遗传算法求解大规模机组组合问题  

Integer-coded genetic algorithm with novel repairing mechanism for large scale unit-commitment problem

作　　者：张伟[1] 赵进慧[2] 王宁[1] 

机构地区：[1]浙江大学智能系统与控制研究所,浙江杭州310027 [2]东北大学流程工业综合自动化国家重点实验室,辽宁沈阳110819

出　　处：《化工学报》2012年第9期2972-2979,共8页CIESC Journal

基　　金：国家博士后基金项目(2011M500567)~~

摘　　要：针对发电机组组合调度问题,提出了一种带修复操作的整型编码遗传算法(r-ICGA)。算法采用整数串的编码方式,有效减小了染色体的长度。同时引入一组新的修复操作来处理约束,将进化过程中产生的新个体修复成为可行个体。与罚函数约束处理方法相比,所提算法不引入惩罚项,避免了针对不可行解的经济负载分配子问题求解,节省了大量计算时间。将所提方法应用于六种不同规模的机组组合问题,仿真结果表明算法的搜索效率更高,求得的调度结果更好。随机组规模增大,算法所需执行时间近似线性地平缓增长,表明r-ICGA算法比其他方法更适合于求解大规模机组组合调度问题。An approach to solving large scale unit-commitment（UC）problem based on integer-coded genetic algorithm（GA）with novel repairing mechanism（r-ICGA）is presented.The GA chromosome consists of integer string,which has shorter length than binary string.Using the proposed repairing mechanism,new chromosomes produced in evolution process are repaired to comply with all constraints.As the alternative to penalty function method,the repairing mechanism turns solutions to feasible ones,and avoid coping with economic load dispatch（ELD）sub-problem for infeasible solutions.The algorithm is tested and validated in 6 cases with different scale up to 100 units.The solutions obtained by r-ICGA have lower operating costs,and the algorithm has approximate linear execution time versus unit number.These simulation results indicate that r-ICGA is more appropriate to large scale unit-commitment problem.

关 键 词：生产调度 机组组合 遗传算法 整型编码 修复操作 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]