搜索资源列表
旅行商程序及其结构说明
- 旅行商问题,我们数学竞赛自己编的,最优问题-traveling salesman problem, we Mathematics Olympiad own series, optimal problems
模拟退火算法实现旅行商算法
- 采用的是康力山等人确定的实验参数。 对于n个城市的旅行商问题,其参数如下: 初始温度:t0=280, 每一个温度下采用固定的迭代次数L=100n, 温度的衰减系数alpha=0.92 算法停止的准则是当相邻两个温度得到的解变化很小时算法停止。-used the Stanozolol Hill were determined by the experimental parameters. N cities for the travel
traverller
- 产生式系统中旅行商问题的求解-Production System Traveling Salesman Problem Solving
TSPGA
- 用C#编的用遗传算法求解旅行商(TSP)问题的源代码。-with C# Part of the Genetic Algorithm for TSP (TSP) of the source code.
演化法
- 首先介绍了当前求解TSP问题最好的演化算法之一:GT算法。文中重点设计了在NOW上求解旅行商问题GT算法的并行算法,详细描述了设计思路,设计策略。还给出了相当详细的并行算法描述。文中设计的并行算法已经在NOW上的PVM平台上实现。关键词NOW,演化计算,旅行商问题,并行计算-first briefed on the current TSP evolutionary algorithm best one : GT algorithm. T
旅行商问题
- 基于遗传算法求解旅行商问题,程序中随机设置了城市点出现的情况。(Genetic algorithm based travel salesman problem, the program randomly set up the city point of view.)
连续Hopfield神经网络的优化—旅行商问题优化计算
- 连续Hopfield神经网络的优化 旅行商问题优化计算(Traveler problem optimization calculation)
蚁群算法TSP问题
- 典型的matlab求运行商问题,可以看到进化曲线和线路计算过程。(The typical matlab asks the operator problem, and you can see the evolution curve and the line calculation process.)
TSP_Ant
- 通过蚁群算法,建立数学模型,从而解决旅行商问题(Through the ant colony algorithm, a mathematical model is established to solve the traveling salesman problem)
TspGA源码
- TSP(旅行商问题)遗传算法实现源代码。(TSP (travel salesman problem) genetic algorithm to achieve the source code.)
MATLAB 路径规划
- 利用matlab对旅行商问题进行求解,31座城市坐标最短路径规划(The traveling salesman problem is solved by using MATLAB, and the shortest path planning of 31 urban coordinates is given)
7旅行售货员
- 上传的这个程序是使用C语言编写的旅行商问题。(Upload this program is written in C language, it is to solve the traveling salesman problem)
蚁群算法的优化计算——旅行商问题(TSP)优化
- 蚁群算法的优化计算——旅行商问题(TSP)优化(Optimization calculation of ant colony algorithm)
tsp_ga
- GA求解旅行商问题,不仅有动态路径,还有距离变化分析(GA to solve the traveling salesman problem)
gaTSP
- 旅行商问题,以10个、30个城市为例,文件为TSP代码。(Traveling salesman problem, take 10, 30 cities for example, the document is TSP code.)
tsp_ga
- 适用于TSP问题。旅行商问题,即TSP问题(Traveling Salesman Problem)又译为旅行推销员问题、货郎担问题,是数学领域中著名问题之一。(Apply to the TSP problem. The traveling salesman problem is one of the famous problems in the field of mathematics.)
tsp
- 遗传算法,旅行商问题的python代码(The Python code of the genetic algorithm, the traveling salesman problem)
22蚁群算法的优化计算——旅行商问题(TSP)优化
- 这是完整的基于MATLAB的遗传算法的程序,是关于旅行商问题的求解(This is a complete procedure of genetic algorithm based on MATLAB, which is about solving traveling salesman problem.)
多旅行商
- 都是一些关于多旅行商方面的论文,包含配送物流的路径选择问题,值得一读(Are some papers about multi - travelers, including the routing problem of distribution logistics, is worth reading)
1.1
- 差分进化解决旅行商问题,很快捷,很实用,恩恩(Differential Evolution Solves Traveling Salesman Problem)