检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李明[1,2] 吴耀华[1] 吴颖颖[1] 陈宁宁[3]
机构地区:[1]山东大学控制科学与工程学院,济南250061 [2]山东建筑大学信息与电气工程学院,济南250101 [3]济南大学经济学院,济南250022
出 处:《机械工程学报》2015年第10期197-204,共8页Journal of Mechanical Engineering
基 金:国家自然科学基金(61403234);山东大学自主创新基金(31400073614023)资助项目
摘 要:以A字机为代表的自动化分拣系统因分拣效率快、准确度高、人力成本低,在需要快速处理大量拆零拣选订单的配送中心得到广泛应用。在实际中,对于给定货物品项如何从成本节省角度评定其适用人工分拣或自动化分拣,以及如何在人工和自动化双分拣区中进行合理的品项分配是配送中心设计中的关键问题。对配送中心人工分拣区和自动化分拣区的人工成本进行全面分析;以总节省人工成本最大为目标函数建立设备通道配比优化数学模型,设计贪婪算法得出自动化分拣区内设备通道合理配比方案;在此基础上,将该问题推广到人工和自动化双分拣区系统品项分配中,归结为一类特殊的背包问题,并给出启发式算法。通过某医药配送中心实例仿真证明了算法的有效性。Automated picking system such as A-frame has been used widely for the distribution center to quickly fulfill a lot of broken-case orders because of its high efficiency, high accuracy and low labor costs. While in practice, it is a key problem in the distribution center design to how to choose an order fulfillment strategy for the given item between manual picking and automated picking from a cost perspective, and how to assign items between manual picking zone and automated picking zone. By analyzing labor costs in these two zones, a math model for the allocations of equipment channels is established. The objective function is the sum of total labor savings. A greedy algorithm is proposed to solve how many channels are allocated to each item in the automated picking zone. Based on this, the problem is generalized into the items assignment for double picking zones with manual picking and automated picking system. It can be classified as a type of special knapsack problem, and a heuristic algorithm is adopted to solve it. The example simulation for the pharmaceutical distribution center proves the effectiveness of the algorithms.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.36