一個(gè)基于啟發(fā)式經(jīng)驗(yàn)的立體布局進(jìn)化策略
AN EVOLUTION STRATEGY TO THE THREE DIMENTIONAL PACKING PROBLEMS BASED ON HEURISTIC EXPERIENCE
-
摘要: 目前求解布局問題只能求得近似解,三維布局則更加復(fù)雜。本文提出一種基于啟發(fā)式經(jīng)驗(yàn)、采用遺傳算法求解布局問題的新方法,此方法對(duì)任意維布局問題在求解策略上是一致的。實(shí)驗(yàn)表明,結(jié)合領(lǐng)域知識(shí)和遺傳算法對(duì)解決布局問題具有廣泛的前景。
-
關(guān)鍵詞:
- 布局問題; 啟發(fā)式經(jīng)驗(yàn); 遺傳算法
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 -
計(jì)量
- 文章訪問數(shù): 1987
- HTML全文瀏覽量: 105
- PDF下載量: 566
- 被引次數(shù): 0
下載:
