Pakistan Railway has hired you for the task of repair of its rail networks of province SINDH, the cost of the repair of track between the different cities are presented in the given Table. For instance, the entry (KHI,HYD)= 10 in the table tells us the cost of building a rail connection between these two cities is 10 (in million rupees) You are required to develop a rail network that connects all the cities by at least one path with the smallest cost by avoiding multiple paths to the same city. Hence the problem becomes the finding of Minimum spanning tree in a graph. Your job is as follows; a) Translate the given information in the form of Graph (Vertices & edges) b) Use Greedy Algorithms (Kruskal’s , if the S5 is odd & Prim’s technique , if S5 is even) to build rail connections in this scenario. Apply this algorithm and show all steps up to the final routes. c) What is the cost of repairing of resulting rail network?

Pakistan Railway has hired you for the task of repair of its rail networks of province SINDH, the cost of the repair of track between the different cities are presented in the given Table. For instance, the entry (KHI,HYD)= 10 in the table tells us the cost of building a rail connection between these two cities is 10 (in million rupees) You are required to develop a rail network that connects all the cities by at least one path with the smallest cost by avoiding multiple paths to the same city. Hence the problem becomes the finding of Minimum spanning tree in a graph. Your job is as follows; a) Translate the given information in the form of Graph (Vertices & edges) b) Use Greedy Algorithms (Kruskal’s , if the S5 is odd & Prim’s technique , if S5 is even) to build rail connections in this scenario. Apply this algorithm and show all steps up to the final routes. c) What is the cost of repairing of resulting rail network?

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter3: Introduction To Linear Programming

Section: Chapter Questions

Problem 57RP

See similar textbooks

Similar questions

Tyrael hired a lawn mower man to cut off the grass around his house. He was informed by the agency that the laborer should be paid depending on the number of hourse in trimming the grass and this costs 350.00/hr. Upon the assessment of the laborer to the lawn, the laborer mentioned that it takes 15 minutes per sqm to do the trimming. Tyrael's rectangular house is situated on a rectangular lot. Your task is to design a program that calculates the amount of time to trim the grass and the cost of the service. To do the calculations, the program should ask inputs for the length and width of the house and the lot. Language: JAVA
Frieda Millstone and her family live in Roanoke, Virginia, and they are planning an auto vacation across Virginia, their ultimate destination being Washington, DC. The family has developed the following network of possible routes and cities to visit on their trip:The time, in hours, between cities (which is affected by the type of road and the number of intermediate towns) is shown along each branch. Determine the shortest route that the Millstone family can travel from Roanoke to Washington, DC.
Mr. Cook is the manager of Code cinemas and after a long break the theatres are open to the public again. To compensate for the loss of revenue due to Covid-19, Mr. Chef wants to maximise profits from each show from now on, while following the guidelines set by the government. The instructions are: If two people are sitting in the same row, there must be at least one free seat between them. If two people are sitting in different rows, there must be at least one completely empty row between them. This means that if there are people sitting in rows i and j where i
A town wishes to build a trail between city A, city B, city C, city D, and city E. The distances, in miles, between any two of the destinations are given in the table. Use the table to answer parts (a) and (b) below. A B C D E A * 154 134 216 129 B 154 * 195 51 243 C 134 195 * 225 220 D 216 51 225 * 308 E 129 243 220 308 * a) Use Kruskal's algorithm to determine the minimum-cost spanning tree that would link each location to create the least expensive trail. Choose the correct graph below. A. ABCD154216225E129 B. ABCD15419551E129 C. ABCD15413451E129 D. ABCD154134216E129 b) If the cost of building such a trail is $3700 per mile, what is the cost of building the trail determined in part (a)? The cost is:
Using excel: A telecom company needs to build a set of cell towers to provide signal coverage for the inhabitants of a given city. A number of potential locations where the towers could be built have been identified. The towers have a fixed range, and due to budget constraints only a limited number of them can be built. Given these restrictions, the company wishes to provide coverage to the largest percentage of the population possible. To simplify the problem, the company has split the area it wishes to cover into a set of regions, each of which has a known population. The goal is then to choose which of the potential regions the company should build cell towers on in order to provide coverage to as many people as possible. The table below shows which of the regions are covered when a tower is build in that region. Note "-" means the tower build cannot serve the region. Region 0 Region 1 Region 2 Region 3 Region 4 Region 5 Region 0 1 1 - - - 1…
10. You've been asked to determine the shortest distance from each house to the pump before lay pipes. The committee also suggested that it would be better to have one common pipeline which covers each house in the Zone. 11. Redraw the diagram and draw the shortest path they could use to lay pipes. 12. Starting at the pipe, determine the minimum length of pipe needed. *Complete Solution and Drawing
Figure 1 shows the power curve of a single turbine that is used in the Block Island Wind Farm. There are five turbines in this wind farm. 6 Power Curve (MW) 3 To 3 ↑ Wind Speed The wind speed at hub height of the turbine in 24 hours are as follows: 20 ✓rated 7.5 12 Figure 1 - Power Curve of a Turbine in the Block Island Wind Farm Cut in \\\ 30 10 25 2 cut out 4 8 12 16 20 24 Figure 2- Wind Speed Histogram
You are tasked with shipping a number n of goods g; E {1, ... , n} to a target location t;. In your very rural area, the roads are in bad shape and often blocked by trees and the like, and also, there are only three cargo companies you can use for the transport of any good g;. You have to order one truck for each good, and know the companies' routes Pi,1, Pi2 and Pi3 they would take to all specific locations, where each route consists of a sequence of road segments that it uses. Now since you are aware of the frequent road blockages, and you want not too many of your transports to be obstructed, your aim is to pick the paths Pij for each good in such a way that max{E.EP. 1|e e E} is as small as possible. (a) Formulate the problem as an ILP, and relax to an according LP. (b) Give a rounding algorithm to compute a feasible solution starting from the LP optimum that guarantees a 3- approximation to the optimal solution, and prove its approximation guarantee.
Maps Remaining Time: 58 minutes, 28 seconds. Question Completion Status: QUESTION 11 Rs 120 2 Vs 20 V RL The source in Figure 2 has an internal resistance of 120 Ohm. Determine the load power for each of the following values of the variable load resistance (a) 00 O a. 330 mW O b.0 mW O c. 450 mW O d. 500 mW
An Uni has n students who are regular competitive programmers. According to the ACM ICPC rules, each person can participate in the regional championship at most 5 times. The head of the Uni ACM Chapter is recently gathering teams to participate in this championship. Each team must consist of exactly three people, at that, any person cannot be a member of two or more teams. What maximum number of teams can the head make if he wants each team to participate in the world championship with the same members at least k times? The first line of input contains two integers, n and k. The next line contains n integers: y1, y2, ..., yn (0 ≤ yi ≤ 5), where yi shows the number of times the i-thperson participated in the ACM ICPC Regional . Write a python program that prints how many teams can be formed according to the above problem statement. Sample Input 1 52 04510 Sample Input 2 64 012345 Sample Input 3 65 000000 Sample Output 1 1 Sample Output 2 0 Sample Output 3 2
A company manufactures two types of trucks. Each truck must go through the painting shop and the assembly shop. If the painting shop were completely devoted to painting type 1 trucks, 800 per day could be painted, whereas if the painting shop were completely devoted to painting type 2 trucks, 700 per day could be painted. If the assembly shop were completely devoted to assembling truck 1 engines, 1500 per day could be assembled, whereas if the assembly shop were completely devoted to assembling truck 2 engines, 1200 per day could be assembled. It is possible, however, to paint both types of trucks in the painting shop. Similarly, it is possible to assemble both types in the assembly shop. Each type 1 truck contributes $1000 to profit; each type 2 truck contributes $1500. Use Solver to maximize the company’s profit
Shamira Laundry has designed a new calculation system for their shop. The price for each type is as follows: 10 Туре Price Clothes RM 15 for 1 kilogram blankets / towels RM 6 for 1 kilogram RM 10 for 1 kilogram comforter Only one type can be washed at a time. This laundry shop also provides discounts to its customers as follow: Total price >= RM30 Discount 10% from total price >= RM20 dan = RM15 dan