自动化立体仓库中的动态储位分配问题  

Dynamic Relocation Problem in an Automated Storage/Retrieval System

作　　者：陈璐[1] LANGEVIN Andre RIOPEL Diane 

机构地区：[1]上海交通大学机械与动力工程学院,上海200240 [2]Department of Mathematics and Industrial Engineering, Ecole Polytechnique of Montreal and GERAD, Canada, H3C 3AT

出　　处：《上海交通大学学报》2011年第1期115-119,共5页Journal of Shanghai Jiaotong University

基　　金：国家自然科学基金项目(70802040,70771065);国家高技术研究发展计划(863)重点资助项目(2009AA043000)

摘　　要：提出了一种整数规划模型,用于自动化立体仓库中物料动态储位分配优化问题的建模,设计了一个两阶段的启发式算法,以求解初始解,利用禁忌搜索算法对初始解加以改进,并通过实例,对算法的效率和精度进行分析.结果表明,所提出的算法具有较好的鲁棒性和较高的求解效率,可以有效提高堆垛机的使用效率和仓库中的空间利用率.An integer linear programming model was formulated to address the optimization problem of relocation in an automated storage/retrieval system.A two-stage heuristic method was developed to generate an initial solution.A tabu search algorithm was proposed to improve the solution.Experimental tests were conducted to evaluate the performance of the proposed optimization algorithm based on various data settings.The experimental results show the effectiveness and the robustness of the algorithm.The efficiency of the handling machine and the utilization of the warehouse are improved by applying the algorithm.

关 键 词：自动化立体仓库 储位分配 再分配 禁忌搜索 

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