基于变邻域模拟退火算法的储位分配研究  

Research on Storage Location Assignment Based on Variable Neighborhood Simulated Annealing Algorithm

作　　者：杨健[1] 曹孟 Yang Jian;Cao Meng(School of Economics and Management,Anhui University of Science and Technology,Huaian City,Anhui Province 232001)

机构地区：[1]安徽理工大学经济与管理学院,安徽淮南232001

出　　处：《黄河科技学院学报》2023年第5期19-25,共7页Journal of Huanghe S&T College

摘　　要：为提高“货到人”拣选系统的订单拣选效率,降低订单拣选过程中的成本,提升订单服务水平,研究基于变邻域模拟退火算法的储位分配问题。基于自动化无人仓库中AGV在服务过程中搬运整个货架的特点,以货架上商品之间关联度之和最大为目标,建立混合整数规划模型,设计求解模型的变邻域模拟退火算法,有机利用变邻域搜索与模拟退火算法两者的优点,利用计算机进行3种规模算例的实验。结果显示,所提算法相较于随机分配策略在3种规模算例中都可以使目标函数值提升60%左右,并且在时间上较为快速,证明与随机分配策略相比,所提算法具有很大优越性,可以较大提升订单拣选速度。In order to improve the order picking efficiency of the“goods to person”picking system,reduce the cost in the order picking process,and improve the order service level,the storage location allocation problem based on the variable neighborhood simulated annealing algorithm was studied.Based on the characteristics of agv handling the whole shelf in the service process of automated unmanned warehouse,a mixed integer programming model was established with the goal of maximizing the sum of the correlation degrees between goods on the shelf,and a variable neighborhood simulated annealing algorithm was designed to solve the model.The advantages of both variable neighborhood search and simulated annealing algorithms were organically used to carry out experiments on three scale numerical examples with computers,The results show that compared with the random allocation strategy,the algorithm proposed in this paper can increase the objective function value by about 60%in three scale examples,and is relatively fast in time.It proves that the algorithm proposed in this paper has great advantages compared with the random allocation strategy,and can greatly improve the order picking speed.

关 键 词：储位分配 变邻域搜索 模拟退火算法 自动化仓库 

分 类 号：F251.2[经济管理—国民经济]