基于帝国竞争算法的自动化立体仓库订单调度研究

发布时间：2017-12-30 21:19

本文关键词：基于帝国竞争算法的自动化立体仓库订单调度研究　出处：《华南理工大学》2015年硕士论文　论文类型：学位论文

【摘要】：随着科技的进步和电子商务的发展,激烈的竞争带来了新的市场格局,制造企业正面临着内外的多重压力,作为客户服务主要构成部分的物流服务已成为企业提升竞争力的关键要素之一。自动化立体仓库是物流系统的重要组成部分,其调度质量直接影响着企业的物流服务质量,因此,对仓库开展订单调度方面的研究具有重要的理论意义和实用价值。本文以P制造企业的自动化立体仓库为背景,对该企业仓库的订单调度开展了研究工作。通过分析该仓库订单调度的关键决策点设计出权重优先则,建立了出库订单优先调度和复合订单调度两种对比流程,并引入离散型帝国竞争算法对调度流程进行求解,为自动化立体仓库的订单调度提出了合理的建议。本文主要研究内容包括:(1)概述了国内外自动化立体仓库订单调度问题和求解算法的研究现状,指出了目前研究中存在的不足,提出了本文的研究内容和目标。(2)通过分析仓库的特性确立订单调度的关键决策点及出入库调度的优先则,结合订单操作流程确立了在关键决策点采取基于订单数量、交付时间及顾客重要度的权重优先则,并构建了出库订单优先调度流程及复合订单调度流程。(3)研究了帝国竞争算法的思想及流程,在连续型帝国竞争算法的基础上构造了离散型帝国竞争算法的同化过程,并引入“汉明距离”对算法的同化效果进行检验。通过文献参考及数据仿真探究了算法主要参数对算法求解结果的影响,确定求解本文订单调度问题的最佳算法参数组合。(4)采用离散型帝国竞争算法对出库订单优先调度流程及复合订单调度流程进行求解。结果表明,相对于出库订单优先调度流程,复合订单调度流程可以从整体上节省订单执行时间和缩短出库订单拖期,提高仓库设备的利用率。在求解质量上,帝国竞争算法优于遗传算法,特别在解决复杂的复合订单调度问题上体现出较大的优势;在收敛速度上,帝国竞争算法比遗传算法稍慢。
[Abstract]:With the progress of science and technology and the development of electronic commerce, fierce competition has brought about a new market pattern. Manufacturing enterprises are facing multiple pressures both inside and outside. As the main component of customer service, logistics service has become one of the key elements to enhance the competitiveness of enterprises. Automated three-dimensional warehouse is an important part of logistics system. Its scheduling quality directly affects the logistics service quality of enterprises, therefore. The research on order scheduling of warehouse has important theoretical significance and practical value. This paper takes the automated warehouse of P manufacturing enterprise as the background. By analyzing the key decision points of order scheduling in the warehouse, the weight priority principle is designed, and the two comparative processes of order priority scheduling out of warehouse and composite order scheduling are established. And the discrete Imperial Competition algorithm is introduced to solve the scheduling process. This paper gives some reasonable suggestions for the order scheduling of automated stereoscopic warehouse. The main research contents of this paper include: 1) the research status of order scheduling problem and solving algorithm of automated warehouse at home and abroad are summarized. This paper points out the shortcomings of the present research, and puts forward the research contents and objectives of this paper. By analyzing the characteristics of the warehouse, it establishes the key decision point of order scheduling and the priority rule of incoming and outgoing scheduling. Combined with the order operation process, the weight priority rule based on order quantity, delivery time and customer importance is established at the key decision point. And construct the order priority scheduling process and the complex order scheduling process. 3) study the idea and process of the imperial competition algorithm. The assimilation process of discrete imperial competition algorithm is constructed on the basis of continuous imperial competition algorithm. The assimilation effect of the algorithm is tested by "hamming distance", and the influence of the main parameters of the algorithm on the result of the algorithm is explored through literature reference and data simulation. The optimal algorithm parameters for solving the order scheduling problem in this paper are determined. The discrete imperial competition algorithm is used to solve the priority scheduling process and the composite order scheduling process. The results show that. Compared with the outbound order priority scheduling process, the composite order scheduling process can save the order execution time and shorten the delivery order delay, improve the utilization of warehouse equipment, and improve the quality of the solution. The imperial competition algorithm is superior to the genetic algorithm, especially in solving the complex complex order scheduling problem. In the convergence speed, the imperial competition algorithm is slower than the genetic algorithm.
【学位授予单位】：华南理工大学
【学位级别】：硕士
【学位授予年份】：2015
【分类号】：F425;F252

【参考文献】