addressalign-toparrow-leftarrow-rightbackbellblockcalendarcameraccwchatcheckchevron-downchevron-leftchevron-rightchevron-small-downchevron-small-leftchevron-small-rightchevron-small-upchevron-upcircle-with-crosscrosseditemptyheartfacebookfolderfullheartglobegmailgoogleimagesinstagramlinklocation-pinmagnifying-glassmailminusmoremuplabelShape 3 + Rectangle 1outlookpersonplusprice-ribbonImported LayersImported LayersImported Layersshieldstartrashtriangle-downtriangle-uptwitteruseryahoo

Let's explore recombination and mutation for GA in TSP (AIMA ch. 4)

Applying genetic algorithms to TSP is non-trivial, since careless recombination and mutation will result in inviable offspring; the Larrañaga paper talks about some different methods for recombining parents and mutating offspring that result in valid tours.

Each of the recombination operators has slightly different properties:

  1. Partially-mapped crossover
  2. Order-crossover
  3. Position-based crossover
  4. Edge-recombination crossover
  5. &c.

and likewise with the mutation operators:

  1. Displacement mutation
  2. Exchange mutation
  3. Insertion mutation
  4. &c.

The goal this week is to implement and compare as many of the recombination and mutation operators as possible.

Join or login to comment.

4 went

People in this
Meetup are also in:

Sign up

Meetup members, Log in

By clicking "Sign up" or "Sign up using Facebook", you confirm that you accept our Terms of Service & Privacy Policy