Question: Duestion o (15 marks) or the booth. He has requested the company to send all the materials to the shopping mall as oon as they

Duestion o (15 marks) or the booth. He has

Duestion o (15 marks) or the booth. He has requested the company to send all the materials to the shopping mall as oon as they could. a) Construct a network to show at least 10 areas/cities/landmarks/buildings that might pass from the company to the shopping mall. You may assume the shopping mall as located in Klang Valley such as Mid Valley and The Gardens Mall. (5 marks) b) Of all possible routes available at the areas/cities/landmarks/buildings you mentioned in part (a), find the shortest distance (in km ) to the shopping mall using ONE algorithm from each group. Compare their results and determine which algorithm is suitable for this problem. Group 1: (i) Transshipment modelling (ii) Dijkstra shortest path algorithm (iii) Bellman Ford algorithm Group 2: (iv) Prims algorithm (v) Kruskal algorithm (vi) Boruvka algorithm (10 marks) Duestion o (15 marks) or the booth. He has requested the company to send all the materials to the shopping mall as oon as they could. a) Construct a network to show at least 10 areas/cities/landmarks/buildings that might pass from the company to the shopping mall. You may assume the shopping mall as located in Klang Valley such as Mid Valley and The Gardens Mall. (5 marks) b) Of all possible routes available at the areas/cities/landmarks/buildings you mentioned in part (a), find the shortest distance (in km ) to the shopping mall using ONE algorithm from each group. Compare their results and determine which algorithm is suitable for this problem. Group 1: (i) Transshipment modelling (ii) Dijkstra shortest path algorithm (iii) Bellman Ford algorithm Group 2: (iv) Prims algorithm (v) Kruskal algorithm (vi) Boruvka algorithm (10 marks)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!