An Enhancing Permutation Algorithm For Laser Antimissile Strategy Optimization

摘要

This paper deals with a dynamical laser antimissileproblem. The laser antimissile system can destroy many targetsin a short time, the attacking sequence plays an important rolein practical implement. This laser antimissile problem can beseen as a dynamical traveling salesman problem. This paperintroduces an enhancing algorithm to solve this problem basedon three exchange strategies - the near exchange, the symmetricexchange and the near block exchange. The near exchangestrategy searches for a local optimal sequence amongst itsneighbors, obtaining a local optimal solution fast. The symmetricexchange will search in a larger region so as to jump out fromthe local optimal solution. The near block exchange expands thesearch region. The combination of the three exchange strategiesincreases the probability of finding the global optimal solution.We consider a case where there are eight attacking targets. Theresults show that the convergence is very fast and the localoptimal solution is, indeed, quite close to the global one.