摘要
在订单陆续到达的背景下,针对fishbone仓储布局设计了一种实时订单分配与路径规划算法,对多个拣货员进行订单分配与路径规划。根据订单中的货物位置和拣货员当前位置,实时将订单分配到各拣货员,再采用穿越型策略(S-shape)和返回策略对各拣货员进行路径规划;设计实验参数,在不同订单规模和订单到达率下,与时间窗分批在单个订单服务时间和总服务时间进行两方面对比。结果表明该算法的单个订单服务时间在94%的情形下都小于时间窗分批算法,随着订单到达率的提高,该算法在总服务时间上体现出来的优势越明显。相较于时间窗分批,该算法不依赖于订单到达率以确定批次大小,在实际应用中更具可行性。
In the case of orders arrive one after another,a real-time order assignment and routing algorithm was designed for fishbone warehouse layout,which was used for order as-signment and route planning for multiple pickers.According to the position of goods in the order and the current position of the picker,the orders were assigned to pickers in real time,and then the route for each picker was carried out by using S-shape and return strategies.Experimental parameters were designed to compare the service time of a single order and the total service time in batches with the time window under different order batch sizes and order arrival rates.The experimental results showed that the single order service time of this algorithm was less than that of the time-window batch algorithm in most cases(94%).With the increasing of order arrival rate,the advantage of this algorithm in the total service time become more and more obvious.Compared with time-window batch algorithm,this algorithm did not depend on order arrival rate to determine batch size,so it was more feasible in practical application.
作者
刘建胜
叶世鹏
LIU Jiansheng;YE Shipeng(School of Mechatronics Engineering,Nanchang University,Nanchang 330031,China)
出处
《南昌大学学报(工科版)》
CAS
2021年第2期165-171,177,共8页
Journal of Nanchang University(Engineering & Technology)
基金
国家自然科学基金资助项目(51565036)。