Traveling salesman SA vs GA

Loading...

Sign in or sign up now!
Alert icon
Upgrade to the latest Flash Player for improved playback performance. Upgrade now or more info.
4,264
Loading...
Alert icon
Sign in or sign up now!
Alert icon

Uploaded by on Sep 10, 2009

Traveling salesman solved with a genetic algorithm (left) and simulated annealing (right).
See http://gfoidl.spaces.live.com/blog/cns!36D34E66505CE4AF!239.entry for more information.

Category:

Science & Technology

Tags:

License:

Standard YouTube License

  • likes, 2 dislikes

Link to this comment:

Share to:

Uploader Comments (gfoidlkorporal)

  • SA...Simulated Annealing is another meta-heuristic approach.

  • Population size = 1000

    Crossover rate = 0.25

    Mutation rate = 0.1

    Selection is done by tournament selection with a tournament size of 4.

    For crossover each gene is cut at randomly chosen two cutting points.

    In the blog article (follow the link) I pointed out some possible reason why the GA is not so fast - watch on iterations/generations it's still fast.

see all

All Comments (5)

Sign In or Sign Up now to post a comment!
  • what about the time taken for both algorithms to solve the task?

  • Genetic algorithms are greedy.

  • Umm... Whats an sa?

  • What about crossover/mutation type

    and crossover/mutation rate you use. it look so not efficiency GA

    sorry for bad english

Loading...

Alert icon
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more