Rank: 23 based on 1104 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 43 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 271 60
  • 4.45946
4.5 | 41 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 26 0
Comments and Ratings by Joseph View all
Updated File Comments Rating
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]

27 Sep 2012 Advanced Dijkstra's Minimum Path Algorithm calculates the shortest (least cost) path along edges of a graph using Dijkstra's Algorithm Author: Joseph Kirk

Denny, could you email me with the specific inputs you used?

Comments and Ratings on Joseph's Files View all
Updated File Comment by Comments Rating
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.

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

Is there any easy way of displaying ONLY the best solution as output, after the iterations are done, instead of the changing optRoute?

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

Thanks a lot Joseph, I have also managed to implement your script with some modifications in simulink, where I get a set of waypoints as input =)

16 May 2013 Fixed Start Open Traveling Salesman Problem - Genetic Algorithm Finds a near-optimal solution to a "open" variation of the TSP with fixed start points using a GA Author: Joseph Kirk B, SL

User friendly. Used in batch processing type program and only slight modifications were necessary. Saved me a lot of time.

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

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])

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 43 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 271 60
  • 4.45946
4.5 | 41 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 26 0

Contact us