| 一种求解装箱问题的混合算法 |
| |
| 引用本文： | 李静,吴耀华,肖际伟. 一种求解装箱问题的混合算法[J]. 物流科技, 2008, 31(12): 29-31 |
| |
| 作者姓名： | 李静 吴耀华 肖际伟 |
| |
| 作者单位： | 山东大学现代物流研究中心,山东,济南,250061 |
| |
| 摘 要： | 针对一维装箱问题，在考虑遗传算法早熟收敛问题和禁忌搜索算法自适应优点的基础上，将遗传算法和禁忌搜索法结合起来，提出了基于遗传和禁忌搜索的装箱优化算法，与简单遗传算法相比，该算法具有更好的收敛性能。最后通过实例验证了算法的有效性。
|
| 关 键 词： | 装箱问题 遗传算法 禁忌搜索 混合算法 |
A New Hybrid Algorithm For Bin Packing Problem |
| |
| LI Jing,WU Yao-hua,XIAO Ji-wei. A New Hybrid Algorithm For Bin Packing Problem[J]. Logistics Management, 2008, 31(12): 29-31 |
| |
| Authors: | LI Jing WU Yao-hua XIAO Ji-wei |
| |
| Affiliation: | (The Logistics Institute, Shandong University, Jinan 250061, China) |
| |
| Abstract: | This paper presents a new hybrid algorithm based on genetic algorithm and tabu search for bin packing problem.It combines the advantage of global search ability of genetic algorithm with the adaptability of tabu search and has better convergence performance than simple genetic algorithm.At last,an practical example is applied to prove the efficiency of this algorithm. |
| |
| Keywords: | bin packing problem genetic algorithm tabu search hybrid algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
