跳出局部最优的方法(国外英文).docVIP

跳出局部最优的方法(国外英文资料) No. Volume 16 1 stage engineering mathematics V o L. 16, No..1 2000 February JOURNALOFMATHEMATICSFORTECHNOLOGY Feb. 2000 Several strategies to get rid of local minimum in combinatorial optimization Tian Yu Zhao Jianghan Petroleum Institute Jingzhou 434102) [Abstract Local search algorithm is a very effective algorithm to solve combinatorial optimization problems It is versatile, flexible and so on But. Yes, due to the complexity of the search space and the objective function The objective function has many local minimum points in the search space Make algorithms work in these bureaus At the minimum point Stuck Greatly affect the algorithms effect For this problem The author has consulted a great deal of documents Combine your own research practice , summarizes several escape local Minina strategy Use these strategies It is expected to make the algorithm more perfect In solving combinatorial optimization problems In the course of the problem, it can play a more important role . [keyword Local search Local minimum Strategy [CLC number [O 224 [document identification code ]A [article number 1007] 4120 (2000) 01 0067 06 1 Introduction In Management Science Computer science There are a lot of combinatorial optimization problems in the field of VLSI design and Electronic Engineering The traditional algorithm for solving these problems is the local search algorithm It is simple, flexible and so on It can solve many combinatorial optimization problems That is A very efficient algorithm for combinatorial optimization problems Yet Local search algorithm has its disadvantages too For example The final solution is locally optimal The final solution depends too much on the initial solution Because of the complexity of exploring space The objective function has many local minimum points in the search space Bureau. The most fatal weakness of the partial search algorithm is that it is easy to get stuck at these local minima in the search process Can not get rid of