基于智能机器人的“货到人”系统订单排序优化  

Order sequence optimization for parts-to-picker intelligent robot system

作　　者：夏德龙 吴耀华[1] 王艳艳[1] 邹霞[2,3] XIA Delong;WU Yaohua;WANG Yanyan;ZOU Xia(School of Control Science and Engineering,Shandong University,Jinan 250061,Shandong Province,P.R.China;School of Management,Shandong University,Jinan 250100,Shandong Province,P.R.China;School of Management Science and Engineering,Shandong University of Finance and Economics,Jinan 250014,Shandong Province,P.R.China)

机构地区：[1]山东大学控制科学与工程学院,山东济南250061 [2]山东大学管理学院,山东济南250100 [3]山东财经大学管理科学与工程学院,山东济南250014

出　　处：《深圳大学学报（理工版）》2019年第6期696-701,共6页Journal of Shenzhen University(Science and Engineering)

基　　金：山东省重点研发计划资助项目(2017GGX60103);山东大学基本科研业务费专项资金资助项目(2018JC035)~~

摘　　要：提出一种适用于“货到人”智能机器人系统的订单排序模型,通过优化订单拣选顺序,增加拣选台内相邻订单和拣选台之间订单的共用货架数量,减少货架的搬运次数,提高货架的出入库效率.把订单的排序看作旅行商问题(travelling salesman problem,TSP),并用改进K-Means聚类算法求解该订单排序模型.选取3组不同批次订单进行仿真验证,优化后系统货架搬运次数平均减少35.63%.In this paper,we propose an order sorting model for the parts-to-picker intelligent robot system.By optimizing the sequence for order picking,the model increases the number of shared racks for orders within adjacent orders and picking stations,reduces the number of transportation times of the racks,thereby improving the efficiency of the warehouse system.Considering the order sequencing as the travelling salesman problem(TSP),we solve the order sorting model by the improved K-Means algorithm.Three sets of different batch orders are selected for simulation verification.After optimization,the transportation times of the system racks are reduced by 35.63%on average.

关 键 词：物流工程 “货到人”系统 改进K-MEANS算法 订单分拣 智能机器人 订单排序 仿真 

分 类 号：TP11[自动化与计算机技术—控制理论与控制工程]