不同订单分配和算法下的拣货路径优化组合  

Optimized Combination of Picking Path in Different Distributions and Algorithms

作　　者：孟鑫 杨琴[1,4] 郝婷婷 张洁 曹策俊 MENG Xin;YANG Qin;HAO Tingting;ZHANG Jie;CAO Cejun(School of Business,Sichuan Normal University,Chengdu 610101,China;School of Economics and Management,Chang’an University,Xi’an 710054,China;School of Business Planning,Chongqing Technology and Business University,Chongqing 400067,China;School of Economics Management,Sichuan Technology and Business University,Chengdu 611745,China)

机构地区：[1]四川师范大学商学院,成都610101 [2]长安大学经济与管理学院,西安710054 [3]重庆工商大学商务策划学院,重庆400067 [4]四川工商学院经济管理学院,成都611745

出　　处：《计算机工程与应用》2020年第23期229-236,共8页Computer Engineering and Applications

基　　金：国家自然科学基金(No.71904021);成都市哲学社会科学2020年新冠肺炎疫情防控专项课题项目成果(No.2020ZXB10);四川师范大学校级专项项目(No.SNU19J4Z2019-11);国家级大学生创新创业训练计划(No.S201910636358)。

摘　　要：针对仓库拣货作业效率低与成本高等问题,运用调度理论和启发式算法展开研究。考虑两种拣取方式下的订单分配情况,分析了京东典型的双区型仓库中存在的问题;运用三元组α/β/γ方法对拣货路径规划问题进行描述,建立最小化总路径的拣货路径规划模型,设计与模型相适应的S型启发算法和遗传算法;进行算例仿真,比较与分析两种拣取方式下的仿真结果。结果显示,将订单分批策略与遗传算法下的路径规划相结合能得到较合理的拣货作业规划。Aiming at the problems of low efficiency and high cost of warehouse picking operations,the scheduling theory and heuristic algorithms are adapted.Firstly,it analyzes the problems existing in JD’s typical two-block warehouse,and considers the order distribution under the two picking methods.Then the triple methodα/β/γis used to describe the problem of picking path planning,to establish the picking path planning model to minimize the total path,and to design the S-type heuristic algorithm and genetic algorithm suitable for model matching.Finally,the simulation of the example is carried out,and the simulation results of the two picking methods are compared and analyzed.The results show that the combination of the order batching strategy with the path planning under the genetic algorithm can obtain a more reasonable picking operation plan.

关 键 词：拣货作业 双区型仓库 路径规划 启发式算法 

分 类 号：F252[经济管理—国民经济] TP391.9[自动化与计算机技术—计算机应用技术]