Combinatorial optimization problem is an important embranchment of operational research. The mathematical methods can be used to search optimization arrange, grouping, sequence or ridding of the discrete events.These problems belong to the Non-polynomial-complete(NPC)questions, which can't be solved in polynomial time. With the enlargement of the scale of question, the question space makes the characteristic of exploding up, is unlikely solved with general methods.As a NPC problem, Traveling Salesman Problem(TSP)is a classical combinatorial optimization question, which now can only be solved by meta-heuristics to get the approximate solution.Since creating bionics in middle period of 1950's, people are being inspired from the mechanism of the biological evolution constantly. Many new methods had been applied to solve the complicated optimization problems are proposed. Such as neural network, genetic algorithm, simulated annealing, and evolution computation. These new methods had been successfully applied to solve the practice problems. Ant colony... |