Comparison on Solving TSP via Intelligent Algorithm
Wei Geng · Computer Engineering and Applications Journal · 2009
There are various kinds of methods with different corresponding models to solve the Traveling Salesman Problem(TSP),among which this paper focuses on those intelligent algorithms and divides them into three types,namely evolutionary al-gorithm,Hopfield network and self-organizing map.Their principles,performances,advantages and disadvantages are discussed re-spectively.Experiments with different scales demonstrate that the one combines evolutionary algorithm and local search outweighed others,which suggests that the future research should be concentrated on finding better local research methods.