| 改进有序组合树法在铁路普通零担货物拼箱配装中的应用 |
| |
| 引用本文： | 付永军,安晨.改进有序组合树法在铁路普通零担货物拼箱配装中的应用[J].铁道货运,2007(9):12-14. |
| |
| 作者姓名： | 付永军 安晨 |
| |
| 作者单位： | 兰州交通大学,交通运输学院,甘肃,兰州,730070 |
| |
| 摘 要： | 为优化铁路普通零担货物拼箱配装方案,以集装箱标记载重最大化为目标,建立0—1整数规划模型,利用改进的有序组合树算法对模型进行求解,得出最优拼箱配装方案。通过拼箱配装实例的计算,说明该算法解决零担拼箱配装问题具有一定的有效性和优越性。
|
| 关 键 词： | 零担货物 配装 0-1规划 有序组合树 |
| 文章编号： | 1004-2024（2007）09-0010-03 |
| 修稿时间： | 2007-05-28 |
Application of Improved Sequential Combination Tree Algorithm on the Arrangement of Railway General Less-than-carload Goods |
| |
| FU Yong-jun,AN Chen.Application of Improved Sequential Combination Tree Algorithm on the Arrangement of Railway General Less-than-carload Goods[J].Railway Freight Transport,2007(9):12-14. |
| |
| Authors: | FU Yong-jun AN Chen |
| |
| Abstract: | In order to optimize the consolidation and loading plan of railway general less-than-carload goods, and with the goal of realizing maximum container marked loading capacity, the 0-1 integer programming model is established. The improved sequential combination tree algorithm is applied for solving the model and getting the optimized container consolidation and loading plan. Through calculating the example, the paper illuminates the algorithm has validity and advantages on solving the container consolidation problems of less-than-carload goods. |
| |
| Keywords: | Less-than-carload Goods Consolidation 0-1 Programming Sequential Combination Tree Algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
