改进有序组合树法在铁路普通零担货物拼箱配装中的应用  

Application of Improved Sequential Combination Tree Algorithm on the Arrangement of Railway General Less-than-carload Goods

作　　者：付永军[1] 安晨[1] 

机构地区：[1]兰州交通大学交通运输学院,甘肃兰州730070

出　　处：《铁道货运》2007年第9期12-14,共3页Railway Freight Transport

摘　　要：为优化铁路普通零担货物拼箱配装方案,以集装箱标记载重最大化为目标,建立0—1整数规划模型,利用改进的有序组合树算法对模型进行求解,得出最优拼箱配装方案。通过拼箱配装实例的计算,说明该算法解决零担拼箱配装问题具有一定的有效性和优越性。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.

关 键 词：零担货物 配装 0-1规划 有序组合树 

分 类 号：O221.4[理学—运筹学与控制论] U294.15[理学—数学]