Search Comments and Ratings
Comments and Ratings
|
||||
|---|---|---|---|---|
| Date | File | Comment by | Comment | Rating |
| 30 Oct 2009 | Traveling Salesman Problem - Genetic Algorithm Finds a near-optimal solution to a TSP using a GA | Kirk, Joseph | Alex, my code is a slight deviation from the "standard" genetic algorithm, but it has all the essential components of a GA (abstract representation of possible solutions, individual fitness evaluation, a population of potential solutions, and a method of propagating good solutions and forming new, potentially better, solutions). There IS selection AND elitism, actually, but you are right about crossover. I don't think it is necessarily an essential component of a GA. I have implemented a handful of different versions of the GA (with various mutation/crossover operator combinations) to solve the TSP, and what I have found is that the crossover operator tends to be quite destructive (it makes large changes to a given route) and therefore rarely improves a decent solution. So my code uses 3 different mutation operators with the intent to make modifications that are more likely to improve the best solutions. (I randomly group 4 citizens at a time, take the best one of those four, and pass it on to the next generation. I then perform the 3 mutations on that best-of-four citizen and pass the mutated versions on to the next generation). |
|
| 29 Oct 2009 | Traveling Salesman Problem - Genetic Algorithm Finds a near-optimal solution to a TSP using a GA | Ter-Sarkissov, Alex | Great implementation, fast and furious, but...where is a genetic algorithm? There's no crossover, no selection, no elitism. It's more of a population-based hill climbing/simulated annealing, I guess. |
|
| 29 Sep 2009 | Dijkstra's Shortest Path Algorithm calculates the shortest path and distance between two nodes on a map | Knight, Benjamin | Great code, well documented and easy to apply. Note that I needed to transpose A and C matrices to get a result from this function. |
|
| 03 Jun 2009 | Graph GUI create/edit graphs of vertices and edges | Michael | just what I was looking for |
|
| 02 Jun 2009 | Traveling Salesman Problem - Genetic Algorithm Finds a near-optimal solution to a TSP using a GA | Dalon, Thierry | How about making a TSP Toolbox with all your TSP contributions? (around 15)! |
|
| 28 May 2009 | Dijkstra's Shortest Path Algorithm calculates the shortest path and distance between two nodes on a map | rfdgsdf, abdullah | Perfect >> thank u man ... go head |
|
| 04 May 2009 | Dijkstra's Shortest Path Algorithm calculates the shortest path and distance between two nodes on a map | Ashby, Michael | Very useful code for finding the distances from a given node to all the others.
|
|
| 22 Apr 2009 | Cold Colormap Creates a COLD colormap that complements the built-in HOT colormap | D'Errico, John | You might add a see also for cool, an existing colormap with a slightly different shape in terms of colors. Regardless, this adds another colormap option. As always, the help is what I'd expect. |
|
| 07 Apr 2009 | Traveling Salesman Problem - Genetic Algorithm Finds a near-optimal solution to a TSP using a GA | yuzseksen, dokuzyuzseksen | thankss.. |
|
| 21 Mar 2009 | Count Loops in a Graph Calculates the number of loops in a graph consisting of nodes and edges | Petschel, Ben | Nice code and very well documented. Another idea uses the theory of cycle subspaces (e.g. chapter 5 of Wallis's book on graph theory) - use a spanning tree to construct the (e-v+1) fundamental cycles and then check all 2^(e-v+1) combinations to eliminate disjoint unions and figure-8's. Does this algorithm compare favourably with your tree method? |
|
| 20 Mar 2009 | Advanced Dijkstra's Minimum Path Algorithm calculates the shortest (least cost) path along edges of a graph using Dijkstra's Algorithm | peng, sun | Clear interface and detailed description. Good job! Very helpful! |
|
| 04 Mar 2009 | Traveling Salesman Problem - Genetic Algorithm Finds a near-optimal solution to a TSP using a GA | jinpeng, xu | very good!
|
|
| 25 Feb 2009 | Stopwatch Displays elapsed time from keyboard or button inputs | Ensalzado, Ruben | Very useful.. i'm working in an image acquisition gui, and i was about finish.. then i realized, that some people in the lab may need to know when the study is over or the elapsed time of the test.. Thanks to your gui, i can use some of your programming to finish my work on time!! Thank you very much Joseph! |
|
| 18 Jan 2009 | Traveling Salesman Problem - Nearest Neighbor Finds a near-optimal solution to a TSP using Nearest Neighbor (NN) | Vijay, Sandip | ||
| 09 Jan 2009 | Drag Patches Demo shows how to create patches that can be clicked and dragged around | Foxgrover, Paul | Very helpful! Thanks you very much! |
|
| 26 Dec 2008 | Traveling Salesman Problem - Genetic Algorithm Finds a near-optimal solution to a TSP using a GA | A.I, shaima | so good ..
thanks so much |
|
| 01 Dec 2008 | Dijkstra's Shortest Path Algorithm calculates the shortest path and distance between two nodes on a map | Yin, Weihao | ||
| 14 Nov 2008 | Traveling Salesman Problem - Genetic Algorithm Finds a near-optimal solution to a TSP using a GA | Mahdieh | this was awesome, nice job
|
|
| 13 Nov 2008 | Advanced Dijkstra's Minimum Path Algorithm calculates the shortest (least cost) path along edges of a graph using Dijkstra's Algorithm | Sal | Hello Kirk...is there a way I can email you a question? |
|
| 03 Nov 2008 | Traveling Salesman Problem - Genetic Algorithm Finds a near-optimal solution to a TSP using a GA | ira, hudmem | thanks nice written |
|
| 26 Oct 2008 | Advanced Dijkstra's Minimum Path Algorithm calculates the shortest (least cost) path along edges of a graph using Dijkstra's Algorithm | Sal | Thank you I applied to a large graph and it handled it in record time...Good Job... |
|
| 16 Oct 2008 | Traveling Salesman Problem - Nearest Neighbor Finds a near-optimal solution to a TSP using Nearest Neighbor (NN) | Goju, Kururunfa | Very nice. It could benefit from the fact of working with TSPLIB files... |
|
| 03 Oct 2008 | Multiple Traveling Salesmen Problem - Genetic Algorithm Finds a near-optimal solution to a M-TSP using a GA | rachakonda, venugopal | good |
|
| 01 Oct 2008 | 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, The | Update: The SINGLES parameter has been replaced with a more generalized MIN_TOUR. |
|
| 01 Oct 2008 | Open Multiple Traveling Salesmen Problem - Genetic Algorithm Finds a near-optimal solution to a "open" variation of the M-TSP using a GA | Author, The | Update: The SINGLES parameter has been replaced with a more generalized MIN_TOUR. |
|
| 01 Oct 2008 | 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, The | Update: The SINGLES parameter has been replaced with a more generalized MIN_TOUR. |
|
| 01 Oct 2008 | Multiple Variable Traveling Salesmen Problem - Genetic Algorithm Finds a near-optimal solution to a variation of the MTSP with variable number of salesmen using a GA | Author, The | Update: The SINGLES parameter has been replaced with a more generalized MIN_TOUR. |
|
| 01 Oct 2008 | 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, The | Update: The SINGLES parameter has been replaced with a more generalized MIN_TOUR. |
|
| 01 Oct 2008 | Multiple Traveling Salesmen Problem - Genetic Algorithm Finds a near-optimal solution to a M-TSP using a GA | Author, The | Update: The SINGLES parameter has been replaced with a more generalized MIN_TOUR. |
|
| 26 Sep 2008 | Traveling Salesman Problem - Genetic Algorithm Finds a near-optimal solution to a TSP using a GA | Kolla, Naresh | This would be better if it is extended by taking some more conditions |
|
| 25 Sep 2008 | Multiple Traveling Salesmen Problem - Genetic Algorithm Finds a near-optimal solution to a M-TSP using a GA | Author, The | João, I'm not using a binary string/word to represent the various possible solutions, if that's what you mean, but that doesn't exclude it from being a GA. GAs can take many forms, but they have (1) an abstract way of representing possible solutions (2) a method for evaluating the fitness or cost of a candidate solution (3) a population of candidate solutions (4) and a method of propagating good solutions while forming new (potentially better) solutions. This file has all of those. |
|
| 25 Sep 2008 | Multiple Traveling Salesmen Problem - Genetic Algorithm Finds a near-optimal solution to a M-TSP using a GA | Silva, João | As far as I know, this is not a GA, at least not a classical one. But it is very useful as a trying tool with an evolutionary algorithm. |
|
| 25 Sep 2008 | Traveling Salesman Problem - Genetic Algorithm Finds a near-optimal solution to a TSP using a GA | Vijay, Sandip | ||
| 24 Sep 2008 | Multiple Traveling Salesmen Problem - Genetic Algorithm Finds a near-optimal solution to a M-TSP using a GA | Rojas, Erick | good tool but very simple and dont new approach |
|
| 18 Sep 2008 | Binary Clock Displays the clock time in binary representation | Bertalan, George | Bryliant |
|
| 18 Sep 2008 | Traveling Salesman Problem - Genetic Algorithm Finds a near-optimal solution to a TSP using a GA | Padilla, Felipe | ||
| 15 Sep 2008 | 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 | yak, barki | Thanks alot, it works superb! but could you please tell me how i can edit the number of points that a salesman visit at least? its "2" in your work but i couldnt manage to increase that number |
|
| 08 Sep 2008 | Stopwatch Displays elapsed time from keyboard or button inputs | banan, rafau | Gut |
|
| 18 Aug 2008 | Memory (a.k.a. Concentration) Play the classic game of Memory | Blaheta, Petr | only if there would by option for picture. But ... I realy enjoy this game :-) |
|
| 18 Aug 2008 | Multiple Traveling Salesmen Problem - Genetic Algorithm Finds a near-optimal solution to a M-TSP using a GA | Srinivasan, Sumana | Neat tool. Easy to use. |
|
| 03 Aug 2008 | Traveling Salesman Problem - Genetic Algorithm Finds a near-optimal solution to a TSP using a GA | ghanbari, reza | good |
|
| 27 Jul 2008 | Vivid Colormap creates a personalized, vivid colormap | zhao, jichao | it is great work!!! And thanks for sharing with us.
|
|
| 25 Jul 2008 | Vivid Colormap creates a personalized, vivid colormap | Stevens, Andrew | Whoops- forgot to rate in my previous review. |
|
| 25 Jul 2008 | Vivid Colormap creates a personalized, vivid colormap | Stevens, Andrew | Nicely done. Works well and I already received compliments from a colleague on the colormap generated with this code that I used for a figure. |
|
| 30 Jun 2008 | Count Loops in a Graph Calculates the number of loops in a graph consisting of nodes and edges | shahbazi, zahra | it is awesome! |
|
| 30 Jun 2008 | Advanced Dijkstra's Minimum Path Algorithm calculates the shortest (least cost) path along edges of a graph using Dijkstra's Algorithm | vu, thang | Thanks you, i apply it for an arborescent graph. It works perfectly. |
|
| 23 Jun 2008 | Multiple Traveling Salesmen Problem - Genetic Algorithm Finds a near-optimal solution to a M-TSP using a GA | Simon, Stefan | ||
| 22 Jun 2008 | Stopwatch Displays elapsed time from keyboard or button inputs | Powar, Arun | I added some useful coding into program.. working nice.. |
|
| 19 Jun 2008 | Stopwatch Displays elapsed time from keyboard or button inputs | beyaz, emre | i love it |
|
| 18 Jun 2008 | Dijkstra's Shortest Path Algorithm calculates the shortest path and distance between two nodes on a map | Wu, Kuba | ||
|
||||
MATLAB Central Terms of Use
NOTICE: Any content you submit to MATLAB Central, including personal information, is not subject to the protections which may be afforded information collected under other sections of The MathWorks, Inc. Web site. You are entirely responsible for all content that you upload, post, e-mail, transmit or otherwise make available via MATLAB Central. The MathWorks does not control the content posted by visitors to MATLAB Central and, does not guarantee the accuracy, integrity, or quality of such content. Under no circumstances will The MathWorks be liable in any way for any content not authored by The MathWorks, or any loss or damage of any kind incurred as a result of the use of any content posted, e-mailed, transmitted or otherwise made available via MATLAB Central. Read the complete Terms prior to use.
Contact us at files@mathworks.com