A fast evolutionary algorithm for combinatorial optimization problems
In this paper we proposed a new algorithm based on inver-over operator, for combinatorial optimization problems. Inver-over is based on simple inversion; however, knowledge taken from other individuals in the population influences its action. In the new algorithm we use some new strategies including selection operator, replace operator and some new control strategy, which have been proved to be very efficient to accelerate the converge speed. Through the experiment, the new algorithm shows great efficiency in solving TSP with the problem scale under 300.