b) Datuk Hafiz Arif who is the Chief Minister of Melaka is needed to visit SIX (6) flood evacuation centers to ensure the facilities and human resources are well equipped and comfortable for the victims. However, he must complete his visits to all centers as fast as possible due to other work commitments. To solve this problem, Ant Colony Optimization (ACO) is used to ensure he will travel to all centers in one trip and finally return to the initial center. Table 2 shows the distance matrix of the SIX centers he needs to visit. The initial pheromone value is set to 0.5 for each path. Center A D F A 12 20 10 16 4 B 12 7 13 20 7 14 15 13 10 14 11 E 16 13 15 11 F 4 8 13 6 Table 2 i) Assume that in iteration 0, TWO ants are deployed at E and D as the initial centers. By using the NEXT-HOP DISTANCE PARAMETER ONLY, give the initial combination of centers' paths and the total distance travelled for each ant. ii) If the changing rate value for pheromone is 0.1, update Figure 1 below with the new pheromone values by labelling only the paths affected with increased pheromones. B F E D Figure 1 ii) For the next iteration, an ant is deployed at B as its initial center and use ONLY PHEROMONE parameter for the next center probable movement. state the combination of the centers' paths and its total distance.
b) Datuk Hafiz Arif who is the Chief Minister of Melaka is needed to visit SIX (6) flood evacuation centers to ensure the facilities and human resources are well equipped and comfortable for the victims. However, he must complete his visits to all centers as fast as possible due to other work commitments. To solve this problem, Ant Colony Optimization (ACO) is used to ensure he will travel to all centers in one trip and finally return to the initial center. Table 2 shows the distance matrix of the SIX centers he needs to visit. The initial pheromone value is set to 0.5 for each path. Center A D F A 12 20 10 16 4 B 12 7 13 20 7 14 15 13 10 14 11 E 16 13 15 11 F 4 8 13 6 Table 2 i) Assume that in iteration 0, TWO ants are deployed at E and D as the initial centers. By using the NEXT-HOP DISTANCE PARAMETER ONLY, give the initial combination of centers' paths and the total distance travelled for each ant. ii) If the changing rate value for pheromone is 0.1, update Figure 1 below with the new pheromone values by labelling only the paths affected with increased pheromones. B F E D Figure 1 ii) For the next iteration, an ant is deployed at B as its initial center and use ONLY PHEROMONE parameter for the next center probable movement. state the combination of the centers' paths and its total distance.
Management Of Information Security
6th Edition
ISBN:9781337405713
Author:WHITMAN, Michael.
Publisher:WHITMAN, Michael.
Chapter5: Developing The Security Program
Section: Chapter Questions
Problem 1EDM
Related questions
Question
Transcribed Image Text:b) Datuk Hafiz Arif who is the Chief Minister of Melaka is needed to visit SIX (6) flood evacuation
centers to ensure the facilities and human resources are well equipped and comfortable for
the victims. However, he must complete his visits to all centers as fast as possible due to other
work commitments. To solve this problem, Ant Colony Optimization (ACO) is used to ensure
he will travel to all centers in one trip and finally return to the initial center. Table 2 shows the
distance matrix of the SIX centers he needs to visit. The initial pheromone value is set to 0.5
for each path.
Center
A
в
C
D
E
12
20
10
16
4
12
7
13
8
20
7
14
15
13
10
14
11
E
16
13
15
11
8
13
Table 2
i) Assume that in iteration 0, TWO ants are deployed at E and D as the initial centers. By using
the NEXT-HOP DISTANCE PARAMETER ONLY, give the initial combination of centers'
paths and the total distance travelled for each ant.
ii) If the changing rate value for pheromone is 0.1, update Figure 1 below with the nev
pheromone values by labelling only the paths affected with increased pheromones.
new
A
F
C
E
Figure 1
iii) For the next iteration, an ant is deployed at B as its initial center and use ONLY PHEROMONE
parameter for the next center probable movement. state the combination of the centers' paths
and its total distance.
B.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 1 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Management Of Information Security
Computer Science
ISBN:
9781337405713
Author:
WHITMAN, Michael.
Publisher:
Cengage Learning,
Principles of Information Systems (MindTap Course…
Computer Science
ISBN:
9781305971776
Author:
Ralph Stair, George Reynolds
Publisher:
Cengage Learning
Fundamentals of Information Systems
Computer Science
ISBN:
9781337097536
Author:
Ralph Stair, George Reynolds
Publisher:
Cengage Learning
Management Of Information Security
Computer Science
ISBN:
9781337405713
Author:
WHITMAN, Michael.
Publisher:
Cengage Learning,
Principles of Information Systems (MindTap Course…
Computer Science
ISBN:
9781305971776
Author:
Ralph Stair, George Reynolds
Publisher:
Cengage Learning
Fundamentals of Information Systems
Computer Science
ISBN:
9781337097536
Author:
Ralph Stair, George Reynolds
Publisher:
Cengage Learning
Principles of Information Systems (MindTap Course…
Computer Science
ISBN:
9781285867168
Author:
Ralph Stair, George Reynolds
Publisher:
Cengage Learning