Scheduling Method Research Based On Hybrid Differential Evolution And Application In Chemical Workshop

With the continuous expansion of economic scale, bigger production scale and a higher complexity requirements, putting forward higher requirements on management and monitoring of large-scale production processes. The study of production scheduling problem has underwent more than ten years of history and a large number of scheduling methods has been put forward, but still no systematic theory and method has been formed. Differential evolution algorithm as a novel intelligent algorithm first proposed by Storn K, and Price P made in 1995. Later it's found that the differential evolution algorithm is an effective way to solve polynomial problems. But the basic differential evolution algorithm itself is flawed, for it's prone to premature convergence into local optimum. In this paper, the basic differential evolution algorithm made some improvements in order to better solve the scheduling problem. This study should include:(1) An improved of differential evolution algorithm. Proposing a hybrid differential evolution algorithm (Hybrid Differential Evolution Algorithm, HDE). Through the simulation results of standard benchmark problems, the improved algorithm has fast convergence capability and excellent global convergence capability.(2) The permutation of flow shop scheduling problem. Through the simulation results about the standard FSP scheduling problem and the actual chemical scheduling problem, the hybrid differential evolution algorithm is effective and superior in solving the scheduling problem on a single and multiple objectives.(3) Job-shop scheduling problem. At present, differential evolution algorithm has not been widely applied to JSP scheduling problems. Through the simulation results about multi-objective and single- objective JSP scheduling problems, HDE is proved to be feasibility and effectiveness in resolving the JSP scheduling problem.(4) The resolution of lizimo workshop scheduling problem based on HDE. Based on time discretion, this scheduling scheme is a unified approach to meet a number of constraints and to establish a scheduling model with the scheduling objective of the value of maximum benefit. By analyzing the simulation results in using DE and the HDE algorithm, it verifies that the HDE has advantages in settling the practical scheduling problem.Finally, this paper ends with a summary and the work of the future outlook.