| 约束装箱问题的混合遗传算法求解 |
| |
| 引用本文： | 陈迎春,吴晓平,宋业新.约束装箱问题的混合遗传算法求解[J].运筹与管理,2002,11(4):21-25. |
| |
| 作者姓名： | 陈迎春 吴晓平 宋业新 |
| |
| 作者单位： | 海军工程大学,基础部,湖北,武汉,430033 |
| |
| 摘 要： | 本将最佳适应法和遗传算法相结合，提出了一种新的启发式混合遗传算法对具有时间约束的装箱问题进行求解，给出了具体的算法步骤，试算结果表明基于启发式算法的混合遗传算法适合于求解各种约束条件下的大规模装箱问题。
|
| 关 键 词： | 混合遗传算法 装箱问题 约束条件 |
| 文章编号： | 1007-3221(2002)04-0021-05 |
| 修稿时间： | 2001年12月10 |
Hybrid Genetic Algorithm for Bin-packing Problem with Constraints |
| |
| CHEN Ying chun,WU Xiao ping,SONG Ye xin.Hybrid Genetic Algorithm for Bin-packing Problem with Constraints[J].Operations Research and Management Science,2002,11(4):21-25. |
| |
| Authors: | CHEN Ying chun WU Xiao ping SONG Ye xin |
| |
| Abstract: | Combined with best fit approximation algorithm and genetic algorithm, a new hybrid genetic algorithm is proposed in this paper for bin packing problems with time constraints. Its result shows that the hybrid genetic algorithm based on heuristic method is a good candidate for large scale bin packing problems with various constraints. |
| |
| Keywords: | hybrid genetic algorithm bin packing constraint |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
