| 基于离散粒子群优化算法的含权旅行商问题新解法 |
| |
| 引用本文： | 钱真坤.基于离散粒子群优化算法的含权旅行商问题新解法[J].计算机应用与软件,2019,36(1):127-131. |
| |
| 作者姓名： | 钱真坤 |
| |
| 作者单位： | 四川文理学院后勤服务处 四川达州635000 |
| |
| 摘 要： | 考虑现有旅行商问题常忽略车辆载重对运输费用的影响,建立含权旅行商问题模型。在分析含权旅行商问题性质的基础上,提出离散粒子群优化算法求解含权旅行商问题。重新定义问题域的粒子速度、粒子位置等运算规则,引入惯性系数线性下降策略。实验表明,该算法可以有效用于含权旅行商问题的求解,并且对含权旅行商问题的求解性能优于遗传算法和模拟退火算法。
|
| 关 键 词： | 旅行商问题 离散粒子群算法 货物权重 路径规划 |
A NEW METHOD OF WEIGHTED TRAVELING SALESMAN PROBLEM BASED ON DISCRETE PARTICLE SWARM OPTIMIZATION |
| |
| Qian Zhenkun.A NEW METHOD OF WEIGHTED TRAVELING SALESMAN PROBLEM BASED ON DISCRETE PARTICLE SWARM OPTIMIZATION[J].Computer Applications and Software,2019,36(1):127-131. |
| |
| Authors: | Qian Zhenkun |
| |
| Affiliation: | (Logistics Service,Sichuan University of Arts and Science,Dazhou 635000,Sichuan,China) |
| |
| Abstract: | Considering that the existing traveling salesman problem often neglected the influence of vehicle load on transportation cost,this paper established a weighted traveling salesman problem model.Based on the analysis of the weighted traveling salesman problem,a discrete particle swarm optimization was proposed to solve this problem.We redefined the computing rules of particle velocity and particle position in the problem domain,and introduced the strategy of inertial coefficient linear decline.Experiments show that the discrete particle swarm optimization can effectively solve the weighted traveling salesman problem.And the performance of solving traveling salesman problem is better than that of genetic algorithm and simulated annealing algorithm. |
| |
| Keywords: | Traveling salesman problem Discrete particle swarm optimization Cargo weightPath planning |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
