Description
I want a correct and complete solution for all paragraphs. I must adhere to the instructions. I don’t want plagiarism. I don’t want similarities. I don’t want a solution using artificial intelligence. I want a correct solution.
Put the solution inside the file. Include all requirements. Errors are not tolerated.
If you are confident in yourself and certain that you can solve the problem, accept the work.
Note: I have many projects. If your work is good, I will continue to cooperate with you.
Tutor-Marked Assignment (TMA) fall 25/26
Cut-Off Date: Based on the Published Deadline.
Total Marks: …. marks turned to 10 marks
Contents
Warnings and Declaration…………………………………….……………………………………1
Question 1 ……………….…………………………………. ……………………………………..2
Question 2 ………………………………………………………………………………….…..…..3
Question 3 ………………………………………………………………………………….…..…..4
Marking Criteria ……………..………………………………………………………….………..…5
Plagiarism Warning:
As per AOU rules and regulations, all students are required to submit their own TMA
work and avoid plagiarism. The AOU has implemented sophisticated techniques for
plagiarism detection. You must provide all references in case you use and quote
another person’s work in your TMA. You will be penalized for any act of plagiarism as
per the AOU’s rules and regulations.
Declaration of No Plagiarism by Student (to be signed and submitted by student
with TMA work):
I hereby declare that this submitted TMA work is a result of my own efforts and I have
not plagiarized any other person’s work. I have provided all references of information
that I have used and quoted in my TMA work.
Name of Student:……………………………..
Signature:……………………………………………
Date:…………………………………………………
TM366 / TMA (KSA)
Page 1 of 5
2025/2026 Fall
Question 1, [10 marks]
Develop an implementation for the PSO basic algorithm, and hence answer the following case:
Given the following particle positions in a PSO minimization optimization process:
X1 X2 X3 X4 X5
1
2
0
1
0
-1 1
1
1
1
1
1
0
0
-1
2
1
1
1
0
-1 0
2
-1 -1
and given that each particle’s attached velocity is:
V1 V2 V3 V4
V5
1.2 0.6 0.3 -1.6 -0.2
0.8 -0.0 0.6 -0.7 0.3
0.2 0.1 -0.1 1.1 0.4
-0.0 1.5 -1.0 -0.7 -0.5
1.5 0.5 0.4 0.3 -2.1
and given each particle’s local best as:
P1 P2 P3 P4 P5
1 0 1 -1 -1
-1 -1 2 0 0
2 -2 -1 0 -2
1 0 0 -1 1
-1 1 -1 -2 -1
assuming the global best is:[-1,0,0,-1,-2,]
Calculate the updated positions and velocities for the next 4 iterations
Assume Φ1=1.0 and Φ2=0.5
The function to be minimized is:6×11+4×23+1×35+3×46+5×57
add both the code and the answers to the answer file.
Question 2, [10 marks]
A. Given the following search graph, write the sequence of node numbers in the search agenda
across the search life-time and using A* search.
TM366 / TMA (KSA)
Page 2 of 5
2025/2026 Fall
Assume the following heuristic value per node:
Node ID Node Heuristic value
1
306
2
198
3
423
4
605
5
128
6
0
Assume distance between cities are as mentioned on the links
Apply A* algorithm showing intermediate values for the Agenda, g(n), h(n)
Source city is :C3
Destination city:C6
B. Given a road network where some roads have live traffic delays, how would you modify the
cost function of the A* algorithm to reflect real-time route optimization?
TM366 / TMA (KSA)
Page 3 of 5
2025/2026 Fall
Question 3, [10 marks]
A. In a TSP problem with 5 cities, cities are connected as shown in the figure:
the following table shows the distances between different cities
C0
C1
C2
C3
C4
C0
0.00
65.00
35.00
50.00
34.00
C1
65.00
0.00
93.00
62.00
99.00
C2
35.00
93.00
0.00
84.00
26.00
C3
50.00
62.00
84.00
0.00
72.00
C4
34.00
99.00
26.00
72.00
0.00
[Distance of 0 means distance is not applicable.
]The following table shows the pheromone in units between different cities
C0
C1
C2
C3
C4
C0
0.00
2.09
6.83
49.81
5.80
C1
2.09
0.00
14.99
0.00
12.54
C2
6.83
14.99
0.00
7.64
37.98
TM366 / TMA (KSA)
Page 4 of 5
2025/2026 Fall
C3
49.81
0.00
7.64
0.00
0.00
C4
5.80
12.54
37.98
0.00
0.00
Assume that an ant has followed the following route: [3,0,4,1,2,] and back to source
a. Calculate the total cost of the above route.
b. Calculate the ant’s switching probabilities for the first 5 steps in the above route assuming
pheromone exponent parameter α=0.95 and heuristic exponent parameter β=0.87.
c. Calculate the updated pheromone amounts after applying the ACO evaporation step
assuming ρ=0.39.
d. Calculate the updated pheromone amounts after applying the ACO depositing step
assuming Q=37.48.
B. For a small factory with 5 machines and 10 jobs, describe how ACO can optimize the
scheduling to minimize makespan. What challenges does ACO face in discrete domains?
End of TMA Questions
TM366 / TMA (KSA)
Page 5 of 5
2025/2026 Fall
Purchase answer to see full
attachment
