Rank: 37 based on 962 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
06 May 2014 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 30 3
  • 4.5
4.5 | 2 ratings
06 May 2014 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
06 May 2014 Screenshot Traveling Salesman Problem - Genetic Algorithm Finds a near-optimal solution to a TSP using a GA Author: Joseph Kirk optimization, traveling salesman pr..., tsp, genetic algorithm, ga, potw 130 76
  • 4.5
4.5 | 50 ratings
06 May 2014 Screenshot Multiple Traveling Salesmen Problem - Genetic Algorithm Finds a near-optimal solution to a M-TSP using a GA Author: Joseph Kirk multiple traveling sa..., mtsp, tsp, genetic algorithm, ga, optimization 42 18
  • 4.38462
4.4 | 13 ratings
06 May 2014 Screenshot Traveling Salesman Problem - Nearest Neighbor Finds a near-optimal solution to a TSP using Nearest Neighbor (NN) Author: Joseph Kirk optimization, traveling salesman pr..., tsp, nearest neighbor, nn 29 6
  • 4.8
4.8 | 5 ratings
Comments and Ratings by Joseph View all
Updated File Comments Rating
26 May 2014 Traveling Salesman Problem - Genetic Algorithm Finds a near-optimal solution to a TSP using a GA Author: Joseph Kirk

@Binayak, look in the help notes for examples and input/output options.

30 Apr 2014 Traveling Salesman Problem - Genetic Algorithm Finds a near-optimal solution to a TSP using a GA Author: Joseph Kirk

@Sven, thanks for the suggestions. I'll look into overhauling the interface.

27 Apr 2014 Traveling Salesman Problem - Genetic Algorithm Finds a near-optimal solution to a TSP using a GA Author: Joseph Kirk

@Larry, the XY coordinates are only randomly created if no inputs are provided to the function. If you pass a set of XY points, the function will use them.

You can also pass in a distance matrix of point-to-point distances. If you do not provide one, my function computes the pairwise Euclidean distances. However, for latitude and longitude points, this is probably not desirable. You should create a distance matrix in the units you desire and pass that in as the second input.

31 Mar 2014 Dijkstra's Shortest Path Algorithm calculates the shortest path and distance between two nodes on a map Author: Joseph Kirk

@Tyler, my other version can:
http://www.mathworks.com/matlabcentral/fileexchange/20025-advanced-dijkstras-minimum-path-algorithm

19 Feb 2014 Fixed Start/End Point Multiple Traveling Salesmen Problem - Genetic Algorithm Finds a near-optimal solution to a variation of the M-TSP with fixed endpoints using a GA Author: Joseph Kirk

@sukanya, why don't you just download the file? And a rating of 1 when you apparently haven't even used the code seems a little premature, no?

Comments and Ratings on Joseph's Files View all
Updated File Comment by Comments Rating
16 Jul 2014 Advanced Dijkstra's Minimum Path Algorithm calculates the shortest (least cost) path along edges of a graph using Dijkstra's Algorithm Author: Joseph Kirk Pablo

This function works fine.
I call it many times as dijkstra(A,C,1) into an optimization function.
Nevertheless, the Matlab profiler halt me with warnings about the use of sparse functions, and indexing sparse matrices.

16 Jul 2014 Fixed Start Open Multiple Traveling Salesmen Problem - Genetic Algorithm Finds a near-optimal solution to a "open" variation of the M-TSP with fixed start points using a GA Author: Joseph Kirk Tom

Joseph,

This is excellent and very close to the exact problem I would like to solve. My problem involves cable laying and cable routes I wanted to ask how hard / how would you implement the following two things?
1. In my problem the routes cannot cross paths. Each route must start from one city and go to the other cities but must not cross the path of any other route.
2. In my problem the cost of each leg of the route is slightly different. So for example the first leg of the route may cost 100% of the value in dmax but the second costs 125% and the third 150% etc. I don’t think I can implement this into the dmax input as I don’t know which distance / cost will be the first / second leg.

Any feedback on this would be much appreciated!

Thanks

Tom

11 Jul 2014 Fixed Endpoints Open Multiple Traveling Salesmen Problem - Genetic Algorithm Finds a near-optimal solution to a "open" variation of the M-TSP with fixed endpoints using a GA Author: Joseph Kirk Tom

In addition to the previous, is it also possible to include planitairity in the optimization. This means no crossing of the lines. And a third question is if it is possible to include a third dimension, such as a bathymetry to calculate the shortest routes

03 Jul 2014 Traveling Salesman Problem - Genetic Algorithm Finds a near-optimal solution to a TSP using a GA Author: Joseph Kirk chengzhi

31 May 2014 Dijkstra's Shortest Path Algorithm calculates the shortest path and distance between two nodes on a map Author: Joseph Kirk Puffeltje

I have a database with nodes en segments but the segments must be calculated before they can be added to the algorithm. I have a query wich calculates all the posible segments from one specific node to other nodes.

Is it possible to calculate the needed segments during the algorithm? In that case i don't have to calculate all the possible segments for the whole database (16,000 nodes with about 2,450,000 segments)

Puffeltje

Contact us