搜索资源列表
SGALAB1003beta3withdoc
- run the SGALAB_MO_VEGA_demo.m in command windows. to get beta3 version here: http://www.mathworks.com/matlabcentral/fileexchange/loadFile.do?objectId=5882 What s new: 1)fixed a critical bug in selection operation 2)update the 13 c
SGALABbugfix
- 多目标遗传算法程序 to run Demo files, is to run SGALAB_demo_*.m what s new: 1) Multiple-Objective GAs VEGA NSGA NPGA MOGA 2) More TSP mutation and Crossover methods PMX OX CX EAX Boolmatrix 3) More selection methods
旅行商问题
- % MTSPF_GA Fixed Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA) % Finds a (near) optimal solution to a variation of the M-TSP by setting % up a GA to search for the shortest route (least distance needed for % each salesman to trav
mtspf_ga
- 基于遗传算法的多旅行商问题求解，有过程变化图-MTSPF_GA Fixed Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA)
mtsp_ga
- MTSP_GA Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA) Finds a (near) optimal solution to the M-TSP by setting up a GA to search for the shortest route (least distance needed for the salesmen to travel to each city exactly o
mtspo_ga
- 旅行商问题，起点与终点为同一点，求最短路径，-MTSPF_GA Fixed Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA)
tsp_nn
- 旅行商问题（TSP）的最近邻（NN）算法 近邻算法产生不同的结果，取决于选择哪个城市作为起点。此功能决定近邻路线为多个出发点，并返回这些航线的最佳。 -TSP_NN Traveling Salesman Problem (TSP) Nearest Neighbor (NN) Algorithm The Nearest Neighbor algorithm produces different results depending on which city is selected a
MTSP
- mtsp解决方案的matlab求解，可以很好的解决多旅行商的tsp问题-mstp solution matlab solving Can solve the multiple traveling salesman tsp
a1
- Genetic algorithm with multiple operators to solve TSP
Sttspvrpi
- 详细讲述模拟退火算法的理论原理。并TSP问题为例进行讲解，，并各处多种语言的源代码，包括c，matlab和delphi。 -Describe in detail the theoretical principles of the simulated annealing algorithm. And the TSP as an example to explain, and throughout the source code in multiple languages, including
Parallel-genetic-algorithm
- 经典遗传算法利用单一种群对种群个体进行交叉、变异和选择操作，在进化过程中的超级个体易产生过早收敛现象，粗粒度并行遗传算法利用多个子种群进行进化计算，各子群体分别独立进行遗传操作，相互交换最优个体后继续进化。该文证明了该算法的搜索过程是一个有限时齐遍历马尔柯夫链，给出粗粒度并行遗传算法全局最优收敛性证明。对于旅行商问题TSP利用粗粒度并行遗传算法进行了求解，以解决经典遗传算法的收敛到局部最优值问题。仿真结果表明，算法的收敛性能优于经典遗传算法。-Classic genetic algorithm
mtsp_ga
- MTSP_GA Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA)
GA
- MTSP_GA Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA)
mtsp_Genetic-Algorithm
- MTSP_GA Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA)
Multi-ACO-for-TSP
- 多种群蚁群算法解决pst问题的matlab代码，很有借鉴意义-Multiple ant colony system optimization algorithm for sovling TSP problem
mutiply_TSP
- 用matlab实现遗传算法求解多旅行商问题-solve multiple TSP in Matlab
TSP
- 描述 Traveling Salesman Problem 市场上有很多种商品，旅行商Shrek做短期买卖赚取差价。他从一个城市购买一件商品，到达下一个相邻的城市就卖掉。如果这一次买卖无利可图，那么他就不会这么走。凭着自己和同伴多年的经验，他已经对地图上n个城市之间的差价了如指掌。两城市间可能有多种商品可赚取差价，此时Shrek只好倒卖利润最大的一件商品。 现在请你帮Shrek规划一条路线，使他能赚最多的钱。 输入 第一行两个整数n、m。表示
Multiple-Traveling-Salesmen-Problem
- 多旅行商matlab实验源码实现了三种多旅行商问题,使用了遗传算法，可以在matlab2010a以上版本运行-MTSPOF_GA Fixed Open Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA)
Multiple Traveling Salesmen Problem
- MTSP_GA Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA) Finds a (near) optimal solution to the M-TSP by setting up a GA to search for the shortest route (least distance needed for the salesmen to travel to each city exa
TSP路径规划
- TSP问题实现多目标点的路径规划，使其路径最短(The TSP problem realizes the path planning of multiple target points, making the shortest path.)