| 集装箱装入问题的研究 |
| |
| 引用本文： | 由颖,王静巍.集装箱装入问题的研究[J].数字社区&智能家居,2009(15). |
| |
| 作者姓名： | 由颖 王静巍 |
| |
| 作者单位： | 沈阳工业大学基础教育学院; |
| |
| 基金项目： | 辽宁省教育厅基金资助课题(20060620) |
| |
| 摘 要： | 集装箱装载问题是一种有广泛应用背景的组合优化问题,它属于NP-hard问题。禁忌搜索算法(TS)是求解组合问题的一种主要方法,有很强的全局搜索能力。集装箱装入属于有多种约束的空间资源优化问题。约束条件多,求解困难。根据同类型货物一次性装载的思想,提出了一种新的基于空间划分的启发式算法。
|
| 关 键 词： | 集装箱装载 禁忌搜索 组合 启发式 NP-hard问题 |
Study on Container Loading Problem |
| |
| YOU Ying,WANG Jing-wei.Study on Container Loading Problem[J].Digital Community & Smart Home,2009(15). |
| |
| Authors: | YOU Ying WANG Jing-wei |
| |
| Affiliation: | School of Fundamental Education;ShenYang University of Technology;Shenyang 110178;China |
| |
| Abstract: | The container loading problem with wide practical application is a combinatorial optimization problem,and is NP-hard problem. Tabu Search (TS) has the ability to search globally as an effective approach to solving the combinatorial problems.Container loading problem is a combinatorial optimization problem with a broad application background. It involves complicated constraints,therefore,it's difficult to obtain the solution. Accordance with the idea of The same type of goods in a one-time loading,put forwar... |
| |
| Keywords: | container loading tabu search combinatorial heuristic NP-hard problem |
| 本文献已被 CNKI 等数据库收录！ |
