Location:
Search - multiple TSP
Search list
Description: 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 cities TSP problems
3)support Multi-objects fitness in VEGA, more MO methods in future s version
now, SGALAB can support multiple :
1)parameters
2)constraints
3)objects
There are 2 demos:
1) 13 TSP
2) Sheffer F2 Multiple Objects example
just , run SGA__.._demo.m
-run the SGALAB_MO_VEGA_demo.m in command windows. to get beta3 version here : http : / / www.mathworks.com / matlabcentral / fileex change / loadFile.do objectId What = s new 5882 : 1) fixed a critical bug in operation two selection ) update the 13 cities TSP problems 3) support Mu LTI-objects fitness in VEGA, more MO methods in future s version now, SGALAB can support multiple : 1) parameters 2) constraints 3) objects There a re two demos : 1) 13 2 TSP) Sheffer example F2 Multiple Objects just, run SGA__ .. _demo.m
Platform: |
Size: 163290 |
Author: 戴朝华 |
Hits:
Description: 多目标遗传算法程序
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
Truncation
tornament
stochastic
4) mutation methods
binary single point
int/real single point
5) encoding/decoding methods
binary
integer/real
messy
gray
DNA
permuation
to fix the plot bugs for 4001 , download this file and replace old files.
Platform: |
Size: 80294 |
Author: 馨竹 |
Hits:
Description: % 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 travel from the start location to individual cities % and back to the original starting place)
Platform: |
Size: 4058 |
Author: 5501018333@qq.com |
Hits:
Description: 是一个应用matlab来实现基本的管理应用问题的源码!改进后可以实现多种功能!-Matlab is an application to achieve the basic management application source code! Improvements could achieve multiple function!
Platform: |
Size: 476160 |
Author: 3q2eqe |
Hits:
Description: 多目标遗传算法程序
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
Truncation
tornament
stochastic
4) mutation methods
binary single point
int/real single point
5) encoding/decoding methods
binary
integer/real
messy
gray
DNA
permuation
to fix the plot bugs for 4001 , download this file and replace old files.
-Multi-objective genetic algorithm program to run Demo files, is to run SGALAB_demo_*. m what s new: 1) Multiple-Objective GAsVEGANSGANPGAMOGA2) More TSP mutation and Crossover methodsPMXOXCX EAXBoolmatrix3) More selection methodsTruncationtornamentstochastic4) mutation methodsbinary single pointint/real single point5) encoding/decoding methodsbinaryinteger/realmessygrayDNA permuationto fix the plot bugs for 4001, download this file and replace old files.
Platform: |
Size: 79872 |
Author: 馨竹 |
Hits:
Description: 多旅行商问题(Multiple Traveling Salesperson Problem ,简称MTSP) 讨论的是如何安排m( > 1 ) 位旅行商访问n( >
m ) 座城市,要求每个城市只允许被访问一次时,求解所有旅行商花费的费用和是最小(或最大) 的问题。MTSP 问题其实与单
旅行商问题(Traveling Salesperson Problem ,简称TSP) 相似,但是由于添加了任何城市只要被某一旅行商访问到即可这个附加条
件,因而增加了问题复杂度。在以前使用遗传算法(GA) 研究解决MTSP 问题时,通常采用标准的TSP 染色体和处理方法。现
为解决MTSP 问题给出了一种新的染色体设计和相关的处理方法,并与以往的理论设计和计算性能进行比较。计算测试显
示,新的方法能够获得较小的查找空间,在许多方面,新的方法产生的解空间更好。-Multi-Traveling Salesman Problem (Multiple Traveling Salesperson Problem, referred to as MTSP) discussed the arrangements for the m (> 1)-bit traveling salesman visits n (>
m) cities to require each city to allow only visited once, the solution of traveling salesman to spend all the costs and the smallest (or largest) problems. In fact, with the single issue of MTSP
TSP (Traveling Salesperson Problem, referred to as TSP) is similar to, but added any city as long as the visit by a traveling salesman to be attached to the
Pieces, thus increasing the complexity of the problem. The use of genetic algorithms in the past (GA) to study and solve the issue of MTSP, usually a standard chromosome and the TSP approach. Is
MTSP problem to solve is given a new design and associated chromosome approach and the theory of the previous design and to compare performance. Calculation of the test significantly
Show that the new method can find a smaller space, in many respects, the new met
Platform: |
Size: 247808 |
Author: liqiubin |
Hits:
Description: 基于遗传算法的多旅行商问题求解，有过程变化图-MTSPF_GA Fixed Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA)
Platform: |
Size: 4096 |
Author: 彭巍 |
Hits:
Description: 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 once and return to their starting locations)
Platform: |
Size: 4096 |
Author: gao |
Hits:
Description: 旅行商问题，起点与终点为同一点，求最短路径，-MTSPF_GA Fixed Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA)
Platform: |
Size: 4096 |
Author: gai |
Hits:
Description: 旅行商问题（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 as the starting point. This function determines the Nearest Neighbor routes for multiple starting points and returns the best of those routes
Platform: |
Size: 3072 |
Author: fuwalinzi |
Hits:
Description: mtsp解决方案的matlab求解，可以很好的解决多旅行商的tsp问题-mstp solution matlab solving Can solve the multiple traveling salesman tsp
Platform: |
Size: 5120 |
Author: 盛健 |
Hits:
Description: Genetic algorithm with multiple operators to solve TSP
Platform: |
Size: 1803264 |
Author: mu yu |
Hits:
Description: 详细讲述模拟退火算法的理论原理。并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 c, Matlab and Delphi.
Platform: |
Size: 25600 |
Author: guli |
Hits:
Description: 多种群蚁群算法解决pst问题的matlab代码，很有借鉴意义-Multiple ant colony system optimization algorithm for sovling TSP problem
Platform: |
Size: 12288 |
Author: zongxinlu |
Hits:
Description: 用matlab实现遗传算法求解多旅行商问题-solve multiple TSP in Matlab
Platform: |
Size: 3072 |
Author: |
Hits:
Description: Wireless broadband systems based on Orthogonal Frequency Division Multiplexing (OFDM)
are being introduced to meet demands for high data transfer rates. In multiple users systems,
the available bandwidth has to be shared efficiently by several users.
Platform: |
Size: 990208 |
Author: Nirupa |
Hits:
Description: 描述
Traveling Salesman Problem
市场上有很多种商品，旅行商Shrek做短期买卖赚取差价。他从一个城市购买一件商品，到达下一个相邻的城市就卖掉。如果这一次买卖无利可图，那么他就不会这么走。凭着自己和同伴多年的经验，他已经对地图上n个城市之间的差价了如指掌。两城市间可能有多种商品可赚取差价，此时Shrek只好倒卖利润最大的一件商品。
现在请你帮Shrek规划一条路线，使他能赚最多的钱。
输入
第一行两个整数n、m。表示有n个城市，编号1~n
接下来有m行，每行三个整数a、b、price，表示从城市a到城市b可赚取差价price。
输出
若干Tab分隔的整数，连成一条赚钱最多的路线。若有多条，输出字典序最小的那条路线（编号小的城市靠前的路线优先输出）-description
Traveling Salesman Problem
There are a variety of goods on the market, short-term trading TSP Shrek do make the difference. He bought a piece of merchandise the city, arriving at a neighboring city to sell. If this is a profitable business, then he would not just leave. With their years of experience and his companions, he was well aware of the difference between n cities on the map. There may be a variety of goods between the two cities can make the difference, when Shrek had the biggest profit reselling a commodity.
Now you help Shrek planning a route, so that he can earn the most money.
enter
The first line of two integers n, m. He expressed n cities, numbered 1 ~ n
Then there are m rows, each row of three integers a, b, price, expressed a city to city b can make the difference price.
Export
Several Tab separated integers, and even into a most profitable routes. If multiple output lexicographically smallest that route (a small number of priority urban
Platform: |
Size: 5120 |
Author: baof |
Hits:
Description: 多旅行商matlab实验源码实现了三种多旅行商问题,使用了遗传算法，可以在matlab2010a以上版本运行-MTSPOF_GA Fixed Open Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA)
Platform: |
Size: 13312 |
Author: 张驰程 |
Hits:
Description: 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 once and return to their starting locations)(Multiple Traveling Salesmen Problem - Genetic Algorithm)
Platform: |
Size: 6144 |
Author: mokangxin |
Hits:
Description: TSP问题实现多目标点的路径规划，使其路径最短(The TSP problem realizes the path planning of multiple target points, making the shortest path.)
Platform: |
Size: 5120 |
Author: 曾经的王 |
Hits: