Monte carlo random vector to chromosomes

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 1 Mutation Mutation operator introduces spontaneous variability (as in random search algorithms) Mutation generally makes only small changes to solution Bit-based coding and real (floating point) coding require different type of mutation Bit-based mutation generally involves “flipping” bit(s) Real-based mutation often involves adding small (Monte Carlo) random vector to chromosomes TSP Example: 30 Cities 120 100 y 80 60 40 20 0 0 10 20 30 40 50 x 60 70 80 90 100 Solution i (Distance = 941) TSP30 (Performance = 941) 120 100 y 80 60 40 20 0 0 10 20 30 40 50 x 60 70 80 90 100 Solution j(Distance = 800) TSP30 (Performance = 800) 120 100 80 y 44 62 69 67 78 64 62 54 42 50 40 40 38 21 35 67 60 60 40 42 50 99 60 40 20 0 0 10 20 30 40 50 x 60 70 80 90 100 Solution k(Distance = 652) TSP30 (Performance = 652) 120 100 y 80 60 40 20 0 0 10 20 30 40 50 x 60 70 80 90 100 Best Solution (Distance = 420) TSP30 Solution (Performance = 420) 120 100 80 y 42 38 35 26 21 35 32 7 38 46 44 58 60 69 76 78 71 69 67 62 84 94 60 40 20 0 0 10 20 30 40 50 x 6...
View Full Document

This note was uploaded on 04/05/2010 for the course CS 723 taught by Professor Sc during the Spring '10 term at Jaypee University IT.

Ask a homework question - tutors are online