检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李浩霖 谭哲一 汪小帆 镇璐[1] LI Hao-lin;TAN Zhe-yi;WANG Xiao-fan;ZHEN Lu(School of Management,Shanghai University,Shanghai 200444,China)
机构地区:[1]上海大学管理学院,上海200444
出 处:《工程管理科技前沿》2022年第2期41-48,共8页Frontiers of Science and Technology of Engineering Management
基 金:国家自然科学基金重点资助项目(71831008);国家杰出青年科学基金资助项目(72025103)。
摘 要:自动化立体仓库使用双工位穿梭车与升降机可实现两件料箱同时搬运的“一车双箱”存取模式。本文针对“一车双箱”存取模式下穿梭车立体仓库拣选作业订单分批与存取选择问题,建立数学规划模型,并设计了双层变邻域禁忌搜索算法求解问题。双层变邻域禁忌搜索算法中,外层变邻域禁忌搜索算法优化订单分批决策,内层启发式算法则可生成存取决策及时序安排。根据数值实验结果,该算法能在一定时间内得到满意解。与传统“一车单箱”存取模式相比,“一车双箱”存取模式可显著提高存取效率。The application of double-load shuttles and lifts in shuttle-based storage and retrieval systems makes it possible to retrieve or store two unit loads simultaneously,and introduces double-load storage and retrieval mode in warehouse operation.This paper investigates the operational problem of double-load mode in shuttle-based storage and retrieval systems,and proposes a mixed-integer linear programming model to jointly optimize the order batching and retrieving assignment.An efficient two-stage variable neighborhood tabu search algorithm is developed for problem solving.The upper level of the algorithm is a variable neighborhood tabu search algorithm developed for optimizing order batching assignment.The lower level of the algorithm is a heuristic algorithm for generating the retrieving plan and sequence.Numerical experiments show the efficiency of the proposed algorithm.Compared with traditional single-load storage and retrieval mode,the double-load storage and retrieval mode can significantly improve system efficiency.
关 键 词:穿梭车立体仓库 订单分批 存取选择 变邻域禁忌搜索算法
分 类 号:TP18[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.70