Rank: 23 based on 1096 downloads (last 30 days) and 34 files submitted
photo

Joseph Kirk

E-mail

Personal Profile:
Professional Interests:

 

Watch this Author's files

 

Files Posted by Joseph View all
Updated   File Tags Downloads
(last 30 days)
Comments Rating
12 Sep 2012 Screenshot Count Loops in a Graph Calculates the number of loops in a graph consisting of nodes and edges Author: Joseph Kirk graphs, networks, cycles, loops, nodes, edges 33 6
  • 5.0
5.0 | 3 ratings
09 Dec 2011 Screenshot Vivid Colormap creates a personalized, vivid colormap Author: Joseph Kirk colormap, map, vivid, intensity, color, customization 42 10
  • 5.0
5.0 | 9 ratings
07 Nov 2011 Screenshot Traveling Salesman Problem - Genetic Algorithm Finds a near-optimal solution to a TSP using a GA Author: Joseph Kirk optimization, genetic algorithm, tsp, traveling salesman pr..., ga, potw 265 63
  • 4.47368
4.5 | 43 ratings
07 Nov 2011 Screenshot Open Traveling Salesman Problem - Genetic Algorithm Finds a near-optimal solution to a "open" variation of the TSP using a GA Author: Joseph Kirk optimization, traveling salesman pr..., open variation, genetic algorithm 73 1
  • 4.5
4.5 | 2 ratings
07 Nov 2011 Screenshot Fixed Endpoints Open Traveling Salesman Problem - Genetic Algorithm Finds a near-optimal solution to a "open" variation of the TSP with fixed endpoints using a GA Author: Joseph Kirk optimization, traveling salesman pr..., tsp, open variation, fixed endpoints 25 0
Comments and Ratings by Joseph View all
Updated File Comments Rating
24 May 2013 Traveling Salesman Problem - Genetic Algorithm Finds a near-optimal solution to a TSP using a GA Author: Joseph Kirk

Victor, the population size is part of the GA configuration - it has nothing to do with the TSP in general...

22 May 2013 Traveling Salesman Problem - Genetic Algorithm Finds a near-optimal solution to a TSP using a GA Author: Joseph Kirk

Fredrik, the "showResult" flag does precisely that.

13 May 2013 Traveling Salesman Problem - Genetic Algorithm Finds a near-optimal solution to a TSP using a GA Author: Joseph Kirk

Fredrik,
In the standard formulation of the TSP, the optimal solution can start at any city. If you want to force the solution to start at a specific city, you can manipulate the output as follows:

Supposing that you have requested "optRoute" as an output and that you want the solution to start at the first city, you can type the following into the Command Window:

>> index = find(optRoute == 1);
>> finalRoute = optRoute([index:end 1:index-1])

26 Feb 2013 Traveling Salesman Problem - Genetic Algorithm Finds a near-optimal solution to a TSP using a GA Author: Joseph Kirk

Yuan, try this one:
http://www.mathworks.com/matlabcentral/fileexchange/21198

17 Jan 2013 Traveling Salesman Problem - Genetic Algorithm Finds a near-optimal solution to a TSP using a GA Author: Joseph Kirk

Newmat, that is because the code is a function. The stuff that happens inside is essentially a black box as far as the stuff outside is concerned. Certain variables are passed as output if you request them (see examples) but if you really need the internal variables, I suggest adding a line at the end of the function that saves the variables to a .mat file. [i.e. add the line: "save('TSPvariables.mat')" without the quotes after the last line of code in the function]

Comments and Ratings on Joseph's Files View all
Updated File Comment by Comments Rating
25 May 2013 Traveling Salesman Problem - Genetic Algorithm Finds a near-optimal solution to a TSP using a GA Author: Joseph Kirk Fredrik

Hi Mr. Kirk, I was wondering if you have any documentation (i.e scientific report/article) on your work demonstrated here. I have successfully implemented part of your code in my masters thesis project, involving cognitive control of quadrocopters, and would like to refer to your work as much as possible.

24 May 2013 Traveling Salesman Problem - Genetic Algorithm Finds a near-optimal solution to a TSP using a GA Author: Joseph Kirk Victor

24 May 2013 Traveling Salesman Problem - Genetic Algorithm Finds a near-optimal solution to a TSP using a GA Author: Joseph Kirk Kirk, Joseph

Victor, the population size is part of the GA configuration - it has nothing to do with the TSP in general...

24 May 2013 Traveling Salesman Problem - Genetic Algorithm Finds a near-optimal solution to a TSP using a GA Author: Joseph Kirk Victor

Hello Joseph.

I am missing something. Could you please explain, what is the relationship between popSize variable and the TSP problem?

22 May 2013 Traveling Salesman Problem - Genetic Algorithm Finds a near-optimal solution to a TSP using a GA Author: Joseph Kirk Kirk, Joseph

Fredrik, the "showResult" flag does precisely that.

Top Tags Applied by Joseph
optimization, graph, multiple traveling salesmen problem, tsp, open variation
Files Tagged by Joseph View all
Updated   File Tags Downloads
(last 30 days)
Comments Rating
12 Sep 2012 Screenshot Count Loops in a Graph Calculates the number of loops in a graph consisting of nodes and edges Author: Joseph Kirk graphs, networks, cycles, loops, nodes, edges 33 6
  • 5.0
5.0 | 3 ratings
09 Dec 2011 Screenshot Vivid Colormap creates a personalized, vivid colormap Author: Joseph Kirk colormap, map, vivid, intensity, color, customization 42 10
  • 5.0
5.0 | 9 ratings
07 Nov 2011 Screenshot Traveling Salesman Problem - Genetic Algorithm Finds a near-optimal solution to a TSP using a GA Author: Joseph Kirk optimization, genetic algorithm, tsp, traveling salesman pr..., ga, potw 265 63
  • 4.47368
4.5 | 43 ratings
07 Nov 2011 Screenshot Open Traveling Salesman Problem - Genetic Algorithm Finds a near-optimal solution to a "open" variation of the TSP using a GA Author: Joseph Kirk optimization, traveling salesman pr..., open variation, genetic algorithm 73 1
  • 4.5
4.5 | 2 ratings
07 Nov 2011 Screenshot Fixed Endpoints Open Traveling Salesman Problem - Genetic Algorithm Finds a near-optimal solution to a "open" variation of the TSP with fixed endpoints using a GA Author: Joseph Kirk optimization, traveling salesman pr..., tsp, open variation, fixed endpoints 25 0

Contact us