ppt课件-c o m p8620 lecture5-6（c o m p8620 lecture5-6）.pptVIP

COMP8620 Lecture 5-6 Neighbourhood Methods, and Local Search (with special emphasis on TSP) Assignment .au/~pjk/teaching “Project 1” Neighbourhood For each solution S ? S, N(S) ? S is a neighbourhood In some sense each T ? N(S) is in some sense “close” to S Defined in terms of some operation Very like the “action” in search Neighbourhood Exchange neighbourhood:Exchange k things in a sequence or partition Examples: Knapsack problem: exchange k1 things inside the bag with k2 not in. (for ki, k2 = {0, 1, 2, 3}) Matching problem: exchange one marriage for another 2-opt Exchange 2-opt E