用粒子群优化算法求解旅行商问题综述

TSP是一个典型的NP-完全问题,由于其在许多领域内具有实际的应用价值,一直有众多学者对其进行研究。PSO是一种新的群智能算法,优势在于简单容易实现,又有深刻的智能背景。主要介绍了近几年来用PSO算法求解TSP的研究状况,并进行了分析和展望。

TSP is a typical NP-Complete Problem. As in many areas of practical value, there have been many scholars to study it. PSO is a new group intelligent algorithm. The advantage of it is simple and easy to achieve, profoundly intelligent background. Main introduced in recent years by the PSO algorithm for TSP research, and analysis and forecasts.