A New Hybrid Ant Colony Optimization Algorithm To Solve The Flow Shop Scheduling Problem

With the continuous development of social economy,industrial production is gradually come to be a state such as automation intelligent control,in some companies the scheduling control is becoming solve some project as multi-objective or large-scale production plan by Intelligent Optimal Regulation Algorithm and it is different from relying on the person's experience to estimate the production decision before.If the workshop production is scientific and reasonable,it can help reducing not only the workers' operation time and also the cast time of management control,even more,improving the production efficiency of enterprise production or the utilization rate of resources,reducing the enterprise's off work time,shortening the three wastes output and so on.In the Flow-shop Scheduling problem,one of them is a typical NP-hard problem in combinatorial optimization problems which is the flow shop scheduling,according to different target,it is a difficult problem to get an optimal solutionFlow shop scheduling problem is one of the main goals of finding an optimal scheduling scheme,which makes the maximum completion time value to be minimize of the production workshop so as to improve the efficiency of the enterprise production.As a typical case in production scheduling problem,Flow shop scheduling problem cause the attention of academic researchers domestic and overseas,and it has been a breakthrough with continuous research and development of computational science,operational research,artificial intelligence and so onAs one of the Swarm Intelligence Algorithms,Ant colony optimization attracted the attention of the researchers in various fields,when it was come up,and it is more appropriated for solving large-scale,target the more complex combination optimization problem because of its robustness,self-organizing and parallelism algorithm,etc.however it come from the ants when they find foods with optimization in biology that make Ant colony optimization joint scheduling behavior of flow shop scheduling problem more,which is widely used in the workshop scheduling problem.Meanwhile Ant colony optimization is not only be applied in the workshop scheduling problem,but also be used to assignment problem,network routing,the single machine scheduling,fault identification,continuous function optimization,system recognition,data mining,image processing,geotechnical engineering,the spectral analysis,research in the field of geometric constraints,etcThis article main research content is the flow shop scheduling problem.Combined with ant colony algorithm optimization algorithm principle and thought,at the same time adds theNEH algorithm optimization mechanism,as well as the improvement of MMAS algorithm,put forward to solve the flow shop scheduling problem of the new hybrid ant colony algorithm,and the algorithm is optimized operation,to solve the optimization problem in the actual flow shop scheduling problem.Explains the concept of flow shop scheduling problem,the characteristic,the main algorithm to solve the problem of flow shop scheduling,etc.Introduce the basic principle of ant colony algorithm,the implementation process,complexity analysis and the main characteristics.NEH algorithm and ant colony algorithm with the combination of algorithm process.The introduction of the initial solution of MMAS access method,node selection method,local search and information update method,etc.Arouse BM-MMAS algorithm flow shop scheduling problem in the process of initial solution,node selection and local search,pheromones change methods.Finally through the concrete experimental analysis of the algorithm is practical application significance.