检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:范继东 Fan Jidong(Nanjing Pharmaceutical Co.,Ltd.,Nanjing 210000,China)
机构地区:[1]南京医药股份有限公司
出 处:《物流技术》2019年第12期71-75,共5页Logistics Technology
摘 要:针对多层穿梭车系统中“货到人”拣选系统的订单拣选问题,设计了订单分批算法。以最小化货箱总出入库次数为目标,建立了考虑分批结果聚类程度的订单分批数学模型,并设计了基于k-means算法的细分批算法,实现可控聚类程度的订单分批;通过MATLAB对算法进行仿真,将传统FCFS算法、细分批算法进行对比分析,实验结果证明所提出的算法分批效果远强于传统FCFS算法。Targeting at the problem of order picking in the“goods to person”picking process of the multi-layer shuttle system,the paper designs an order batching algorithm.With the goal of minimizing the number of container inbound and outbound operation,it establishes an order batching mathematical model considering the clustering degree of the batching results,and designs a subdivision batching algorithm based on the k-means algorithm to realize order batching with controllable clustering degree.Then,it simulates the algorithm through MATLAB,and compares it with the traditional FCFS algorithm.The experimental results show that the proposed algorithm is far better than the traditional FCFS algorithm in terms of batching.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.145