| 用遗传算法解决下料问题 |
| |
| 引用本文： | 张文俊.用遗传算法解决下料问题[J].科技情报开发与经济,2006,16(16):178-179. |
| |
| 作者姓名： | 张文俊 |
| |
| 作者单位： | 黑龙江科技学院经济与管理学院,黑龙江,哈尔滨,150027 |
| |
| 摘 要： | “下料问题”在工程技术和工业生产中有着重要和广泛的应用。解决此问题的经典方法需要很大的计算量,为了减少计算量,提出基于块组合的树形表示和一种很好被采用的遗传算法,即在使用树形表示切割方式的同时也结合别的不同的切割方式,并通过组合交叉、变异算子来实现混合切割。最后提出了这种方法的实现形式。
|
| 关 键 词： | 遗传算法 交叉 变异 下料问题 |
| 文章编号： | 1005-6033（2006）16-0178-02 |
| 收稿时间： | 2006-03-02 |
| 修稿时间： | 2006年3月2日 |
Solving the Cutting Stock Problem by Using the Genetic Algorithm |
| |
| ZHANG Wen-jun.Solving the Cutting Stock Problem by Using the Genetic Algorithm[J].Sci-Tech Information Development & Economy,2006,16(16):178-179. |
| |
| Authors: | ZHANG Wen-jun |
| |
| Institution: | ZHANG Wen-jun |
| |
| Abstract: | The cutting stock problem possesses important and widespread application in the engineering techniques and the industrial production.The classical methods for solving this problem need mass calculation.In order to reduce the computational load,this paper puts forward the tree representation based on the block combination and the genetic algorithm.This method uses a tree representation of the cutting pattern,and combines different patterns in order to achieve patterns with higher performance.The combination of the cutting patterns is realized by a combined crossover-mutation operator.An application of the proposed method is presented briefly in the end of the paper. |
| |
| Keywords: | genetic algorithm crossover mutation cutting stock problem |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
