| 求解装箱问题的遗传算法 |
| |
| 引用本文： | 方平,李娟.求解装箱问题的遗传算法[J].南昌航空工业学院学报,1998(2):21-24. |
| |
| 作者姓名： | 方平 李娟 |
| |
| 作者单位： | 南昌航空工业学院(方平)，西北工业大学(李娟) |
| |
| 摘 要： | 本文提出了两种求解装箱问题（ＢｉｎＰａｃｋｉｎｇ）的遗传算法。一种是简单遗传算法，它采用等长度字符代码编码方法，使用常规的遗传操作算子。另一种是混合遗传算法，它综合运用解装箱问题的ＦＦＤ（ＦｉｒｓｔＦｉｔＤｅ－ｃｒｅａｓｉｎｇ）近似算法和简单遗传算法。试算结果表明，由这两种遗传算法所得到的装箱方案较一些近似算法所得到的装箱方案都要好。
|
| 关 键 词： | 遗传算法 装箱问题 组合 优化 |
Genetic Algorithms For Bin Packing |
| |
| Fang Ping,Nanchang Institute of Aeronautical Technology Li Juan.Genetic Algorithms For Bin Packing[J].Journal of Nanchang Institute of Aeronautical Technology(Natural Science Edition),1998(2):21-24. |
| |
| Authors: | Fang Ping Nanchang Institute of Aeronautical Technology Li Juan |
| |
| Institution: | Northwestern Polytechnical University |
| |
| Abstract: | Two genetic algorithms have been developted for bin packing.One belongs to simple genetic algorithm,which adopts character coding method and uses ordinary genetic operators.Another belongs to hybrid genetic algorithm,which is a hybrid of First Fit Decreasing approximation algorithms and simple genetic algorithms.The calculating result shows that the genetic algorithms can obtain better bin packing plan than the plan obtianed by approximation algorithms. |
| |
| Keywords: | genetic algorithms bin packing assembly optimization |
| 本文献已被 CNKI 维普 等数据库收录！ |
