| A型变尺寸装箱问题之模型及算法研究 |
 点此下载全文 |
| 引用本文：王晨,杨曙.A型变尺寸装箱问题之模型及算法研究[J].计算技术与自动化,2010,(3):62-65 |
| 摘要点击次数: 2213 |
| 全文下载次数: 260 |
|
|
| 中文摘要:作为对经典一维装箱问题的推广，提出一种A型变尺寸装箱问题（A-shaped Variable-sized Bin Packing Problem，简称A SVBP），即在物品的装箱过程中，每样物品有高度和横截面积两个参数，并且箱子的大小不一。该问题在文件系统管理和日常生活中的运输等问题中有着广泛的应用背景。把装箱问题的经典算法以及遗传算法推广到A型变尺寸装箱问题，实验结果表明：按照本文提出的求解模式，离线情况下求解A型变尺寸装箱问题最终结果的质量取决于预先求解其退化为经典装箱问题时的算法，求解物品装箱序列时用首次适应混合遗传算法比用Next Fit算法、First Fit算法、Best Fit算法最终得到的结果要好。 |
| 中文关键词:组合优化问题 装箱问题 近似算法 遗传算法 |
| |
| A-shaped Variable-sized Bin Packing Problem：Models and Analysis of Heuristics |
|
|
| Abstract:As the extension of bin packing problem, A-shaped variable-sized bin packing problem(ASVBP) is proposed in this paper, in which each item has two parameters, height and diameter. The problem has many applications such as file system management and real-world transportation. The classic algorithms for the bin packing problem and genetic algorithms were extended to the ASVBP. Experiments indicate that the final data's Pros of solving ASVBP on offline lies on its Pros of solving Bin Packing Problem regressive from ASVBP. And the Fist Fit Hybrid genetic algorithm is the best algorithms relative to other algorithms researched in this paper to solve ASVBP. |
| keywords:combinational optimization bin packing problem approximation algorithm genetic algorithms |
| 查看全文 查看/发表评论 下载pdf阅读器 |
位访问者,今日访问