| 8:11 4 + Alms.tu.edu.sa - 42 | Ims.tu.edu.sa/bbcswebdav/pid-19... Bb x B - (2) - 48... Kingdom of Saudi Arabia Ministry of Higher Education Taif University College of Engineering Industrial Engineering Program Dr. Wafik Hachicha for Male Section" Dr. Najeh Yousi for "Female section" Lab. Work 6 - Operations Research 2 College of Engineering # 8053203-3 1) Objectives Solving Shortest-route Problem (find the optimal solution and find the route corresponding to the obtained shortest path) using: using 0-1 ILP formulation and Branch and Bound (using Lingo Software), Branch and Bound using Tree Diagram, Dijkstra's algorithm, and Floyd's algorithm. Compare the obtained results 2) The problem data Network analysis is an essential tool used in transport sector, information sector and also for the flow of matter and energy. Thus, choosing efficient route is essential for businesses and industries which aid distribution of goods and services optimally. This Lab addresses the problem of Dominion Paints Nig. Ltd in transporting their products from their production plant to stores of sales by presenting analysis of the shortest path. The distance in kilometer (km) between each location in the graph was measured using Google maps location. Find the shortest distance from 1 to 8 on the network below and find the corresponding route. 7.2km 13.3 km 2m Arrival 4.8km 3.8km 2.6km 7.2km 8.3km 7.6km 7.Cam 11.6km 4.5km 6.3km Departur Solve this shortest-route Problem (with finding the corresponding route) using 1) Dijkstra's algorithm, 2) Branch and Bound using Tree Diagram, 3) 0-1 ILP formulation and Branch and Bound (Lingo Software), 4) Floyd's algorithm (optional) Compare the obtained results using the four methods 1 | 8:11 4 + Alms.tu.edu.sa - 42 | Ims.tu.edu.sa/bbcswebdav/pid-19... Bb x B - (2) - 48... Kingdom of Saudi Arabia Ministry of Higher Education Taif University College of Engineering Industrial Engineering Program Dr. Wafik Hachicha for Male Section" Dr. Najeh Yousi for "Female section" Lab. Work 6 - Operations Research 2 College of Engineering # 8053203-3 1) Objectives Solving Shortest-route Problem (find the optimal solution and find the route corresponding to the obtained shortest path) using: using 0-1 ILP formulation and Branch and Bound (using Lingo Software), Branch and Bound using Tree Diagram, Dijkstra's algorithm, and Floyd's algorithm. Compare the obtained results 2) The problem data Network analysis is an essential tool used in transport sector, information sector and also for the flow of matter and energy. Thus, choosing efficient route is essential for businesses and industries which aid distribution of goods and services optimally. This Lab addresses the problem of Dominion Paints Nig. Ltd in transporting their products from their production plant to stores of sales by presenting analysis of the shortest path. The distance in kilometer (km) between each location in the graph was measured using Google maps location. Find the shortest distance from 1 to 8 on the network below and find the corresponding route. 7.2km 13.3 km 2m Arrival 4.8km 3.8km 2.6km 7.2km 8.3km 7.6km 7.Cam 11.6km 4.5km 6.3km Departur Solve this shortest-route Problem (with finding the corresponding route) using 1) Dijkstra's algorithm, 2) Branch and Bound using Tree Diagram, 3) 0-1 ILP formulation and Branch and Bound (Lingo Software), 4) Floyd's algorithm (optional) Compare the obtained results using the four methods 1