混合整数规划与匈牙利法的自动化立体仓库货位优化研究  

Research on Space Optimization in Automated Warehouse Based on Integer Programming and Hungarian Method

作　　者：宋紫浩 张水旺 鲍蔷 SONG Zihao;ZHANG Shuiwang;BAO Qiang(School of Management Science and Engineering,Anhui University of Technology,Ma’anshan Anhui 243032)

机构地区：[1]安徽工业大学管理科学与工程学院,安徽马鞍山243032

出　　处：《河南科技》2020年第28期51-54,共4页Henan Science and Technology

基　　金：安徽省“六卓越、一拔尖”卓越人才培养创新项目(2018zygc087);安徽工业大学质量工程项目(20184900004);安徽工业大学教育教学研究项目(2018jy19)。

摘　　要：针对自动化立体仓库货位优化问题,在常规存储策略的基础上,依据周转效率最高原则建立了合适的货位优化数学模型,同时将0~1整数规划原理引入模型求解过程,据此建立整数规划模型,并利用实例数据进行计算。结果表明,在模型求解过程中引入0~1整数规划思想,再利用匈牙利法求解使得原模型求解大大简化,结果也是全局最优,是解决货位优化问题的优良方法。Aiming at the problem of space optimization in automatic three-dimensional warehouse,on the basis of conventional storage strategy and according to the principle of maximum turnover efficiency,an appropriate mathe⁃matical model of space optimization was established,and the principle of 0~1 integer programming was introduced in⁃to the process of model solving.Based on this,the integer programming model was established,and the calculation was carried out with the example data.The results show that the introduction of 0~1 integer programming in the pro⁃cess of solving the model and then using Hungarian method to solve the original model greatly simplifies the solution of the original model,and the result is also global optimal,which is an excellent method to solve the problem of freight location optimization.

关 键 词：自动化立体仓库 货位优化 整数规划 匈牙利法 

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