Research On Job Shop Scheduling Problem Based On Chaos Improved Marine Predator Algorithm

The job shop scheduling problem is one of the most typical and challenging problems in discrete manufacturing systems.It is a combinatorial optimization problem and an NP-hard problem,and it is also a representative model for many optimization tasks in the real world.This paper focuses on the use of chaos-improved ocean predator algorithm to solve the workshop scheduling problem;the chaos-improved ocean predator algorithm is proposed,and compared with the whale optimization algorithm and the gray wolf optimization algorithm.Experimental results show that the chaos-improved marine predator algorithm has higher convergence accuracy and faster convergence speed.The main content and results of this research include the following aspects:(1)Research on chaotic algorithm.In order to enhance the global search ability of the ocean predator algorithm and improve its convergence accuracy,a chaotic mapping function is introduced,and a chaotic ocean predator algorithm is proposed.Aiming at the problem of not being able to determine the best chaotic mapping function and improved operator suitable for the ocean predator algorithm,three improved operator schemes were designed for the original ocean predator algorithm,and each scheme used 10 different chaotic mapping functions Then,numerical experiments were carried out on the benchmark function,and the results showed that the combined operator scheme using the Sinusoidal chaotic map had the best effect on improving the accuracy of the original algorithm.foundation for further research.(2)Research on the improvement of the algorithm.In order to further improve the Chaotic Ocean Predator Algorithm,this paper proposes a Chaotic Improved Ocean Predator Algorithm: firstly,the Sobol sequence is used to initialize the population to improve the quality of the initial solution;The step size strategy balances and improves the algorithm’s global exploration and local development capabilities.Finally,numerical experiments are carried out on the benchmark function.The results show that the improved algorithm of chaos ocean predator is significantly better than the original algorithm in terms of solution accuracy and convergence speed,which verifies the effectiveness of the improved scheme.(3)Verification of the workshop scheduling algorithm.Aiming at the fact that the algorithm cannot be applied to the discrete job shop scheduling problem,this paper adopts a position sorting method based on size,so that the algorithm suitable for solving the real number field is applied to the job shop scheduling problem;then the chaos is improved by the ocean predator algorithm It is tested on 43 standard examples of job shop scheduling problems and the results are compared with other algorithms.The experimental results show that the proposed algorithm has better solution accuracy and convergence performance than the whale optimization algorithm and the gray wolf optimization algorithm;then the Gantt chart is drawn to verify the effectiveness and feasibility of the algorithm for solving the job shop scheduling problem.