退火遗传算法及其在一维切割问题上的应用  

Annealing Genetic Algorithm and Its Application in One-dimensional Cutting Stock Problem

作　　者：张滨燕[1] 郝艳莉[1] 

机构地区：[1]河南职业技术学院信息工程系,郑州450046

出　　处：《新乡学院学报》2009年第2期63-65,共3页Journal of Xinxiang University

摘　　要：针对标准遗传算法在解决优化问题中存在的问题,提出了改进标准遗传算法的退火遗传算法,并把该算法应用于一维最优切割问题上。通过与标准遗传算法求解一维切割问题的比较,验证了退火遗传算法的有效性。Directed at the problems of canonical genetic algorithm in optimization, an improved approach called annealing genetic algorithm is proposed, which combined canonical genetic algorithm and simulated annealing in this paper. The improved approach is applied in solving one-dimensional cutting stock problem and the results show that it is more effective than canonical genetic algorithm.

关 键 词：遗传算法 模拟退火算法 切割问题 矩阵编码 交叉和变异算子 

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