The Cuckoo Search Based On Simulated Annealing Application In Combinatorial Optimization Problems

Optimization problems can be divided into two categories,one is the continuous function optimization problem,and the other is the discrete variable optimization problem which is combinatorial optimization problem.This paper focus on traveling salesman problem and job scheduling problem which both them are discrete variables optimization problems.Cuckoo algorithm as a new heuristic group intelligent optimization algorithm in recent years,its parameters are less easy to set up,and the structure is simple that easy to understand and combined local search with global search that make the algorithm performance better than only use a single search Group Intelligent Optimization Algorithm.The original cuckoo algorithm cuckoo was put forward to solve the optimization problem of continuous function,and it shows good performance and efficiency on search.In recent years,many experts and scholars have tried to apply cuckoo algorithm to solve discrete variables,and has made some progress.In this paper,a discrete cuckoo optimization algorithm for traveling salesman problem and job-shop scheduling problem is designed by learning the previous design ideas and my own understanding and research.Firstly,the traveling salesman problem and the job shop scheduling problem are introduced.Secondly,the principle of cuckoo optimization algorithm and simulated annealing algorithm is introduced.And then select the suitable coding and decoding method for traveling salesman problem and job-shop scheduling problem,use the greedy algorithm to generate the initial population according to the characteristics of the problem,design a global optimization operator and local optimization operator for the population of iteration.lastly,use the hybrid computing framework which combined with the annealing algorithm and cuckoo algorithm to prevent the population into local optima and makes the algorithm evolve steadily.The experimental data comes from instances of job-shop scheduling problem,such as TSPLIB of TSP and FT.The experimental show that the proposed algorithm has better running efficiency and accuracy.