摘要
研究基于汽车出场物流实践而提出的类模式组合装箱问题。主要考虑组合装载及运力意向约束,并以最大化商品车装载数量、最大化商品车装载总紧急程度为主要目标。首先建立混合整数规划模型。其次设计基于分枝定界策略的精确算法。最后,通过基于ILOG CPLEX优化工具的数值实验以及案例分析,验证所提出模型和算法的有效性与高效性。
This paper studies class-pattern combinatorial bin packing problem on automotive outbound logistics.The objective of this problem is to maximize the total quantity of loaded items and the total emergency value of them.The main constraints involve loading combinations and transportation directions.Firstly,a mixed integer programing model is built.Secondly,an exact algorithm based on branch-and-bound is proposed.Finally,computational experiments with ILOG CPLEX are conducted to prove the effectiveness and efficiency of model and algorithm.
出处
《工业工程与管理》
CSSCI
北大核心
2015年第1期56-61,70,共7页
Industrial Engineering and Management
基金
国家自然科学基金资助项目(71272115)
关键词
组合装箱
混合整数规划
分枝定界算法
出厂物流
combinatorial bin packing problem
mixed integer programming
branch-and-bound method
outbound logistics
