基于改进的粒子群优化算法求解TSP问题
Solving Traveling Salesman Problem Based on Improved Particle Swarm Optimization Algorithm
粒子群优化算法是一种新型的优化算法，主要应用于连续优化问题，本文通过引入移动算子和移动序的概念，使粒子群优化算法能够处理离散问题。将改进算法与邻域相结合应用于旅行商问题的实验表明该算法在求解组合优化问题上的有效性。
PSO is a new optimization algorithm which is applied in continuous optimizations. This paper discusses the discrete problem by using PSO with the notion of mobile operators and mobile sequence. Combing the improved PSO and neighborhoods, the experiments of traveling salesman problem show the algorithm\'s effectiveness in solving the combinatorial optimization problem.
沐爱勤、张瑞平
计算技术、计算机技术
移动算子粒子群旅行商问题
mobile operatorsParticle Swarm Optimization(PSO)raveling Salesman Problem(TSP)
沐爱勤,张瑞平.基于改进的粒子群优化算法求解TSP问题[EB/OL].(2010-05-24)[2025-08-02].http://www.paper.edu.cn/releasepaper/content/201005-589.点此复制
评论