一个基于启发式经验的立体布局进化策略
AN EVOLUTION STRATEGY TO THE THREE DIMENTIONAL PACKING PROBLEMS BASED ON HEURISTIC EXPERIENCE
-
摘要: 目前求解布局问题只能求得近似解,三维布局则更加复杂。本文提出一种基于启发式经验、采用遗传算法求解布局问题的新方法,此方法对任意维布局问题在求解策略上是一致的。实验表明,结合领域知识和遗传算法对解决布局问题具有广泛的前景。
-
关键词:
- 布局问题; 启发式经验; 遗传算法
Abstract: It is very hard to solve the packing problem especially for the three dimensional packing problem. A new evolution strategy is presented in this paper which combines heuristic experience with genetic algerithms, its evalutionary thought is common to whatever dimensional packing problems. Finally, an experiment is given proving the strategy is better. -
Dowsland K A et al. Packing problems[J].Euro. J. of Operational Research.1992, 56(4):2-14[2]Galletly J. An overview of genetic algorithms[J].Kybernetes.1992, 21(6):26-30[3]Coffman E G et al. Average-case analysis of cutting and packing in two dimensions. Euro. J. of[4]Oprational Research, 1990, 44: 134-144.[5]Chee-kit Looi. Neural networks methods in combinatorial optimization[J].Computers Operations Res.1992, 19(3/4):191-208 -
计量
- 文章访问数: 1968
- HTML全文浏览量: 98
- PDF下载量: 563
- 被引次数: 0
下载:
