带装载组合约束的汽车出厂物流组合装箱问题的模型和分支定界算法研究  

Research on Models and Algorithms of Bin Packing Problem With Pattern Constraints on Outbound Logistics

作　　者：蔡其琛 陈峰[1] 

机构地区：[1]上海交通大学工业工程与管理系,上海200240

出　　处：《工业工程与管理》2017年第6期57-62,共6页Industrial Engineering and Management

基　　金：国家自然科学基金资助项目(71272115;71672115;70972070);上海市浦江人才计划资助项目(14PJC062)

摘　　要：研究带装载组合约束的出厂物流装箱问题的精确算法和启发式算法,问题的优化目标是最大化装载商品车数量的同时最小化使用承运车数量,其中装载组合约束是指每辆承运车所能装载商品车的类型和数量是给定的。数值实验和案例分析表明,设计的分支定界算法都能够有效提高求解效率并应用于实际情况。The exact algorithm and heuristics were studied to solve the bin packing problem with pattern constraints on outbound logistics. Given several types of vehicles, the pattern constraints represent that each truck has a given capacity of loading each type of vehicles. The objective of this problem is to maximize the profit of loaded vehicles and to minimize the cost of used trucks. The results of computational experiment and case study show that the branch and bound algorithm is effective and efficient.

关 键 词：汽车物流 出厂物流 装载组合约束 分支定界算法 启发式算法 

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