7. Exercise C.3 on page 462. Of the 30 ordered neighborhood pairs (i.e., demonstrating the relationship...

Transcribed Image Text:

7. Exercise C.3 on page 462. Of the 30 ordered neighborhood pairs (i.e., demonstrating the relationship of neighborhood X to neighborhood Y may be different from the relationship of Y to X), we discussed five: "API is a special case of any of the other neighborhoods." That leaves 25 ordered neighborhood pairs for consideration. Consider at most six ordered neighborhood pairs and discuss/illustrate the relationship for each pairing. This problem is extra credit. C.3. Consider the following basic mutations that can be applied to a sequence: (i) An insertion (a job is selected and put elsewhere in the sequence). (ii) A pairwise interchange of two adjacent jobs. (iii) A pairwise interchange of two nonadjacent jobs. (iv) A sequence interchange of two adjacent subsequences of jobs. (v) A sequence interchange of two nonadjacent subsequences of jobs. (vi) A reversal of a subsequence of jobs. Some of these mutations are special cases of others and some mutations can be achieved through repeated applications of others. Taking this into account explain how these six types of mutations are related to one another. 7. Exercise C.3 on page 462. Of the 30 ordered neighborhood pairs (i.e., demonstrating the relationship of neighborhood X to neighborhood Y may be different from the relationship of Y to X), we discussed five: "API is a special case of any of the other neighborhoods." That leaves 25 ordered neighborhood pairs for consideration. Consider at most six ordered neighborhood pairs and discuss/illustrate the relationship for each pairing. This problem is extra credit. C.3. Consider the following basic mutations that can be applied to a sequence: (i) An insertion (a job is selected and put elsewhere in the sequence). (ii) A pairwise interchange of two adjacent jobs. (iii) A pairwise interchange of two nonadjacent jobs. (iv) A sequence interchange of two adjacent subsequences of jobs. (v) A sequence interchange of two nonadjacent subsequences of jobs. (vi) A reversal of a subsequence of jobs. Some of these mutations are special cases of others and some mutations can be achieved through repeated applications of others. Taking this into account explain how these six types of mutations are related to one another.