A is in posi1on 1 in a and 2 in b so112 aso1a cadeb

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: tor (SO)= SO(1,2) //swap first visited city with the second visited city –  swap sequence (SS)=(SO(1,2,), SO(5,4), SO(5,1)) Par1cle Velocity Update •  v(t)=v(t ­1) α*(pbest ­x(t ­1)) β(gbest ­x(t ­1)) •  We need to define 2 operators: –  : Merge two swap sequences –   ­ : Subtract two permuta1ons •  Merging two Swap Sequences –  SS1 = (SO(1,2,), SO(5,4), SO(5,1)) –  SS2 = (SO(1,3,), SO(5,1), SO(2,1)) –  SS1 SS2 = (SO(1,2,), SO(5,4), SO(5,1), SO(1,3,), SO(5,1), SO(2,1)) //do not remove duplicates Par1cle Solu1on Update x(t) = x(t ­1) + v(t) •  + is the applica1on of swap operators to a...
View Full Document

This document was uploaded on 02/28/2014 for the course CS 6776 at Memorial University.

Ask a homework question - tutors are online