石家庄市卷烟配送中心自动化立体仓库出入库优化问题的研究

发布时间：2018-01-25 06:02

本文关键词： 卷烟自动化立体仓库货位分区拣选路径遗传算法　出处：《石家庄铁道大学》2014年硕士论文　论文类型：学位论文

【摘要】：随着市场经济的不断发展和改革开放进程的不断加快，烟草行业在提高效率、降低物流成本、服务质量上水平等方面面临着很大的挑战。面对日益复杂的内外部市场环境，如何降低其运营成本是亟待解决的问题。卷烟物流配送中心的操作环节主要包括卷烟的采购、入库、仓储、分拣、出库等环节，实现卷烟从工业企业到零售户，最终到消费者的空间转移。而这些环节大部分都是通过自动化立体仓库来完成的，因而，其运行效率的高低直接关系到烟草物流配送的经济效益，而立体仓库的货位存放与拣选路径正是影响立体仓库效率的重要指标，所以本论文也将这两个问题作为研究的重点。在对石家庄烟草物流企业实际情况的调研中发现，立体仓库的货位分配策略不尽合理，仓储系统在入库时仅仅是随机的将托盘卷烟存放在空置的货位存放架上，出库时堆垛机随机的根据系统命令随机寻找目标，然后将托盘取至出口平台进行分拣作业，这样既缺乏先进的科学依据，又不利于件烟的快速出、入库，且货品存放随意，库存面积利用率不高，库存周转效率较低，使得每件烟的物流成本增加了20%，严重影响了企业的生产组织和经济效益．同时对结构功能复杂的存取设备的消耗折旧也有很大的影响，因此对立体仓库出入库的优化问题进行研究具有很大的现实意义。针对上述存在的两个问题，首先根据优化目标建立了货位分配的优化数学模型，其次将多目标问题通过权重系数变化法转化为单目标问题，，然后运用遗传算法求解，为了验证算法的正确性，用MATLAB软件对优化结果进行仿真分析，把优化前后的数据用三维图形表现出来，从仿真结果可以看出，优化后的存取效率明显提高，验证了算法的实用性；将堆垛机拣选作业路径优化问题近似为旅行商问题来求解，求解旅行商问题属于NP难题，最优解的数量会随着访问城市数量成指数增长，因而堆垛机执行拣选任务时的行走路径也是如此。针对这一问题，建立最短路径数学模型，用遗传算法求出堆垛机拣选作业路径的最优解，仿真结果表明所提出的方法是有效的。
[Abstract]:With the continuous development of market economy and the process of reform and opening up, the tobacco industry is improving efficiency and reducing logistics costs. The level of service quality is facing great challenges. In the face of increasingly complex internal and external market environment. How to reduce its operating cost is an urgent problem. The operation of cigarette logistics distribution center mainly includes cigarette procurement, storage, warehousing, sorting, out of storage and other links, to achieve cigarettes from industrial enterprises to retail households. Finally, the space transfer to consumers. And most of these links are completed through automated three-dimensional warehouse, therefore, its operational efficiency is directly related to the economic benefits of tobacco logistics distribution. The storage and picking path of the warehouse is an important index to affect the efficiency of the warehouse, so this paper also focuses on these two issues. In the investigation of the actual situation of Shijiazhuang tobacco logistics enterprises, it is found that the allocation strategy of the three-dimensional warehouse is not reasonable. The storage system only stores the pallets of cigarettes at random on the empty storage rack, and the stacker randomly looks for the target according to the system order when leaving the warehouse. Then the pallet is taken to the export platform for sorting operation, which is not only lack of advanced scientific basis, but also not conducive to the rapid exit of cigarettes, storage, and goods stored at will, inventory area utilization rate is not high. The low efficiency of inventory turnover increased the logistics cost of each cigarette by 20%. It seriously affects the production organization and economic benefit of the enterprise, and also has a great influence on the depreciation of the consumption of the access equipment with complex structure and function. Therefore, it is of great practical significance to study the optimization of the storage in and out of the stereoscopic warehouse. In view of the above two problems, first of all, the optimal mathematical model of cargo space allocation is established according to the optimization objective, and secondly, the multi-objective problem is transformed into a single-objective problem by the weight coefficient change method. Then the genetic algorithm is used to solve the problem. In order to verify the correctness of the algorithm, the optimization results are simulated and analyzed by MATLAB software, and the data before and after optimization are represented by three-dimensional graphics. From the simulation results, we can see that the efficiency of the optimized access is improved obviously, and the practicability of the algorithm is verified. The route optimization problem of stacker picking job is approximately solved by traveling salesman problem. Solving the traveling salesman problem belongs to NP problem, and the number of optimal solution will increase exponentially with the number of visited cities. Therefore, the same is true of the walking path when the stacker performs the picking task. In view of this problem, a mathematical model of the shortest path is established, and the optimal solution of the picking operation path of the stacker is obtained by genetic algorithm. Simulation results show that the proposed method is effective.
【学位授予单位】：石家庄铁道大学
【学位级别】：硕士
【学位授予年份】：2014
【分类号】：TP18;F426.8;F252

【参考文献】