Cao Xianbin, Zhuang Zhenquan. AN EVOLUTION STRATEGY TO THE THREE DIMENTIONAL PACKING PROBLEMS BASED ON HEURISTIC EXPERIENCE[J]. Journal of Electronics & Information Technology, 1998, 20(3): 404-408.
Citation:
Cao Xianbin, Zhuang Zhenquan. AN EVOLUTION STRATEGY TO THE THREE DIMENTIONAL PACKING PROBLEMS BASED ON HEURISTIC EXPERIENCE[J]. Journal of Electronics & Information Technology, 1998, 20(3): 404-408.
Cao Xianbin, Zhuang Zhenquan. AN EVOLUTION STRATEGY TO THE THREE DIMENTIONAL PACKING PROBLEMS BASED ON HEURISTIC EXPERIENCE[J]. Journal of Electronics & Information Technology, 1998, 20(3): 404-408.
Citation:
Cao Xianbin, Zhuang Zhenquan. AN EVOLUTION STRATEGY TO THE THREE DIMENTIONAL PACKING PROBLEMS BASED ON HEURISTIC EXPERIENCE[J]. Journal of Electronics & Information Technology, 1998, 20(3): 404-408.
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
DownLoad: