摘要
为了求解车载能力有限的双区型仓库拣货路径优化问题,根据双区型仓库拣货作业的特点,以拣货路径距离最短为目标,建立了双区型仓库拣货路径模型,并根据双区型仓库构造,求解任意2个货位间最短距离,同时提出了贪心算法和遗传算法相结合的贪心遗传算法求解方法,并以双区型仓库为对象进行仿真验证和分析。仿真结果表明,本文提出的算法能有效地提高优化路径的全局最优性和稳定性,而且对不同规模大小的拣货点均可以取得很好的优化效果;利用本文算法求解双区型仓库中的最优拣货路径能极大的缩短拣货车辆行走距离,提高拣货作业工作效率。该研究对双区型仓库拣货路径的优化具有十分重要的意义。
In order to solve the route optimization problem of the Two-Block warehouse picking under limited vehicle capacity,the Two-Block warehouse picking routing model is established with the goal to find the shortest picking path based on the characteristics of the Two-Block warehouse picking.Then it works out the shortest distance of arbitrary two slotting,according to the structure of the Two-Block warehouse.And greedy algorithm and genetic algorithm genetic algorithm are combined in this paper＇s model.With the Two-Block warehouse as object to do simulation verification and analysis,the simulation results show that wonderful results are achieved in different scale of picking point through simulation,and the proposed algorithm can improve the global stability and optimality effectively.Results show that this algorithm can greatly shorten the path picking vehicle travel distance,which improves picking efficiency.The study has important significance for the optimization of Two-Block warehouse picking routing.
出处
《青岛大学学报（工程技术版）》
CAS
2014年第4期93-98,114,共7页
Journal of Qingdao University(Engineering & Technology Edition)
基金
国家自然科学基金项目资助(70671057)
山东省自然科学基金项目资助(ZR2010GM006)
关键词
拣货路径优化
遗传算法
贪心算法
车载限制
双区型仓库
order-picking route optimization
Genetic Algorithm
Greedy Algorithm
picking cart with limited capacity
Two-Block warehouse
作者简介
李栋栋（1990-）,男,山东新泰人,硕士研究生,主要研究方向为物流与供应链管理.
通讯作者：张纪会（1969-）,男,山东青岛人,教授,主要从事现代启发式算法与应用、智能生产计划与调度、物流与供应链管理等方面的研究工作.Email：zhangjihui@qdu.edu.cn
