带装载组合约束的一维装车问题算法研究  

One-dimensional Packing Problem with Loading Combination Constraints

作　　者：张江静[1] 陈峰[2] 

机构地区：[1]上海交通大学中美物流研究院,上海200240 [2]上海交通大学工业工程与物流工程系,上海200240

出　　处：《工业工程与管理》2012年第3期90-96,共7页Industrial Engineering and Management

基　　金：国家自然科学基金资助项目(70771063)

摘　　要：提出带装载组合约束的一维装车问题,有n个属于l种类型的相同(单位)尺寸的物品。有w辆车,每辆车对这l种类型的物品有几种装载组合,不同车辆的装载组合不同,每辆车选择一种装载组合并严格按照物品组合进行装载,优化目标是在满载的情况下装载最多的物品。首先建立线性混合整数规划模型。其次,提出基于贪婪技术的启发式算法。最后,利用ILOG Cplex进行数值实验和参数的敏感性分析。This paper introduces the one-dimensional packing problem with loading combination constraints. There are n items which belong to l types of the same （unit） size. There are w vehicles, each has several loading combinations for these l types, different vehicles having different load combinations, each vehicle chooses a combination and loads items in strict accordance with the combination of loading. Optimization goal is to maximize the loaded items on condition that each vehicle is fully loaded. Firstly, a linear mixed integer programming model is built. Secondly, a heuristics algorithm based on greed technology is proposed. Finally, numerical experiments using ILOG Cplex and parameter sensitivity analysis are conducted.

关 键 词：一维装车问题 装载组合 混合整数线性规划 启发式算法 敏感性分析 

分 类 号：F253[经济管理—国民经济]