| 整箱货物的混合装箱问题的遗传解法 |
| |
| 引用本文： | 黄娟,胡大伟.整箱货物的混合装箱问题的遗传解法[J].中国科技信息,2007(22):327-329. |
| |
| 作者姓名： | 黄娟 胡大伟 |
| |
| 作者单位： | 1. 集美大学航海学院,361021
2. 长安大学汽车学院,710064 |
| |
| 摘 要： | 整箱货物的混合装箱问题在采用传统的算法时,当货物种类规模较大,通常会出现计算时间的"维数灾难"。而遗传算法在搜索过程中不容易陷于局部最优,并能以很大的概率找到整体最优解,具有较快的全局最优解的求解能力。本文以一实例说明了遗传算法在求解混合装箱问题的适用性。
|
| 关 键 词： | 混合装箱 遗传算法 容积利用率 |
Solving mix packing problem in entire box goods by genetic algorithm |
| |
| Huang Juan,Hu Dawei.Solving mix packing problem in entire box goods by genetic algorithm[J].CHINA SCIENCE AND TECHNOLOGY INFORMATION,2007(22):327-329. |
| |
| Authors: | Huang Juan Hu Dawei |
| |
| Abstract: | When adopt the tradition algorithm to solve the problem of mix packing the entire box goods,the "dimension disaster" will appear on calculation time if the cargo type scale is bigger.The genetic algorithm is no easy to land itself in partially most superior,and can find most optimum solution overall with a very big probability.This paper will explain the genetic algorithm in solution mix packing question serviceability with one example. |
| |
| Keywords: | mix packing genetic algorithm Volume utilization ratio |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
