ahyeek at April 16th, 2006 12:09 — #1
groundkeeper at August 6th, 2006 16:06 — #2
Why would you use GA for shortest path problem. Unless you have some unknown twist to the definition of the problem shortest path is a O(n log m) problem?! And to my experience I would not suggest GA for this kind of problem due to the complexity issue. GA are simply got good with that kind of problems to my experience. It's always tempting to try! =)
reedbeta at August 6th, 2006 17:52 — #3
Uh, GroundKeeper, that post was from April and it's not even up at the original address anymore!!! :wallbash:
groundkeeper at September 3rd, 2006 13:09 — #4
Did not check the expiration date!
ahyeek at July 30th, 2008 06:51 — #5
Sorry for the late reply. I forgot I have posted the link here and I have changed the source over the time.
Yeah. This is a MASTER project given from University Of Malaya.
We try to research on the capabilities of GA in solving this type of problem.
This is a very good learning experience in getting into Genetic Algorithm and very suitable for University student in their research. The code and implementation details are also reviewed in the simulation system. You can try to download the enhanced program here to test out some features.
ahyeek at March 10th, 2009 22:44 — #6
Perhaps, new starter should look into more examples and scenario for GA to solve problem.
Take a look at: [www.geneticalgorithm.ahyeek.com](www.geneticalgorithm.ahyeek.com)
This site contain solution for GA in solving vehicle routing problem and multi variants optimization
problem. It's a very good examples to look into.
Hope this help.