1 / 5

Exercise

Exercise. Apply the tabu-search technique starting out with the 2,1,4,3 as an initial sequence. Neighbourhood: all schedules that can be obtained through adjacent pairwise interchanges. (a) Keep the length of the tabu-list equal to 1. Apply the technique for four iterations.

graham-harding
Download Presentation

Exercise

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Exercise Apply the tabu-search technique starting out with the 2,1,4,3as an initial sequence. Neighbourhood: all schedules that can be obtained throughadjacent pairwise interchanges. (a) Keep the length of the tabu-list equal to 1. Apply the technique for four iterations. (b) Keep the length of the tabu-list equal to 3. Apply the technique for four iterations

  2. S1 = 2, 1, 4, 3 F(S1) = wjTj = 12·8 + 14·16 + 12·12 + 1 ·36 = 500 = F(Sbest) F(1, 2, 4, 3) = 480 F(2, 4, 1, 3) = 436 = F(Sbest) F(2, 1, 3, 4) = 652 Tabu-list: { (1, 4) } S2 = 2, 4, 1, 3, F(S2) = 436 F(4, 2, 1, 3) =460 F(2, 1, 4, 3) tabu! F(2, 4, 3, 1) = 608 Tabu-list: { (2, 4) } S3 = 4, 2, 1, 3, F(S3) = 460 F(2, 4, 1, 3) tabu! F(4, 1, 2, 3) = 440 F(4, 2, 3, 1) = 632 Tabu-list: { (2, 1)} (a)

  3. S4 = 4, 1, 2, 3, F(S4) = 440 F(1, 4, 2, 3) =408 = F(Sbest) F(4, 2, 1, 3) tabu! F(4, 1, 3, 2) = 586 Tabu-list: { (4, 1) } F(Sbest)= 408

  4. (b) S1 = 2, 1, 4, 3 F(S1) = 500 = F(Sbest) F(1, 2, 4, 3) = 480 F(2, 4, 1, 3) = 436 = F(Sbest) F(2, 1, 3, 4) = 652 Tabu-list: { (1, 4) } S2 = 2, 4, 1, 3, F(S2) = 436 F(4, 2, 1, 3) =460 F(2, 1, 4, 3) tabu! F(2, 4, 3, 1) = 608 Tabu-list: { (2, 4), (1, 4) }

  5. S3 = 4, 2, 1, 3, F(S3) = 460 F(2, 4, 1, 3) tabu! F(4, 1, 2, 3) = 440 F(4, 2, 3, 1) = 632 Tabu-list: { (2, 1), (2, 4), (1, 4) } S4 = 4, 1, 2, 3, F(S4) = 440 F(1, 4, 2, 3) tabu F(4, 2, 1, 3) tabu! F(4, 1, 3, 2) = 586 Tabu-list: { (2, 3), (2, 1), (2, 4) } F(Sbest)= 436not optimal !

More Related