基于弧集合的离散粒子群算法解决旅行商优化问题我要分享

Discrete particle swarm optimization based on arc set for traveling salesman problem

关注次数: 167

下载次数: 0

文件大小: 10.04 kB

代码分类: 其他

开发平台: matlab

下载需要积分: 2积分

版权声明:如果侵犯了您的权益请与我们联系,我们将在24小时内删除。

代码描述

中文说明:基于对网络图的节点和连线的表示,建立了以弧集为基础的粒子群算法,用来解决旅行商最短路程优化问题,程序中网络图每次生成皆为随机


English Description:

Based on the representation of nodes and lines in network graph, a particle swarm optimization algorithm based on arc set is established to solve the shortest route optimization problem of traveling salesman. Every generation of network graph in the program is random


代码预览

相关推荐