Scene 1

Scene 2

Khairul Nisha binti Khairul Anuar 201932747

Scene 3

A tree of notification in Kuala Muda, Kedah w ill be designed to notify five residential areas about the flood. The notification is done by one person and he has to travel by car from Pejabat Daerah Kuala Muda to the five residential areas using the highway and federal roads. The goal is to notify all residential areas with the shortest route and the cheapest cost possible. This will ensure the quickest notification with the cheapest cost of all residential areas in the district.

Scene 4

LIST OF RESIDENTIAL AREAS ADJACENCY MATRIX LIST OF ASSUMPTIONS LIST OF ROUTES RESULTS

Scene 5

Scene 6

Using the Travelling Salesman Problem (TSP) The starting point is  Pejabat  Daerah Kuala Muda Using  Perodua   Myvi  1.5 Auto Using petroleum RON95 as fuel worth RM 1.84 Assume 20 kilometers per liter of fuel       36 liters to fill the tank Do not have toll Have at least 1 route and maximum 2 routes between two residential areas The route will be selected based on the shortest route and the cheapest cost A calculation to determine the fuel cost as follows: Fuel Cost = (Distance/20) x RM 1.84 Formulation to calculate the Total Cost is Total Cost = Fuel Cost

Scene 7

Route Fuel RM
1
2
048
2
1
2
1
084
2
czs
1
czg
1
1
1
1
1
1
2
Total cost RM
075
Total Dista

Scene 8

TOTAL DISTANCE (M)
4300
8600
4500
3900
4700
4300
7500
5800
6900
6600
8600
7500
8500
11000
11000
4500
5800
8500
9000
3900
6900
11000
3700
8200
4700
6600
11000
8200

Scene 9

Total Distance (km) = 34.9 km Total Cost (RM) = RM 3.2108 Suggested path : A-E-D-C-B-F-A

PROJECT MAT668 (Slide) 15 JAN.pptx

Page 1 (0s)

Page 2 (7s)

Page 3 (21s)

Page 4 (49s)

Page 5 (59s)

Page 6 (1m 17s)

Page 7 (1m 50s)

Page 8 (1m 58s)

Page 9 (2m 6s)

Page 10 (2m 18s)