A truck must travel from New York to Los Angeles. As shown in the network below, several routes areavailable.FromToGas GallonsNew YorkCleveland400New YorkSt. Louis950New YorkNashville800ClevelandPhoenix18009001100600ClevelandDallasSt. LouisSt. LouisPhoenixDallasNashvilleDallas600Salt Lake CityLos AngelesPhoenixSalt Lake CityLos AngelesLos AngelesNashville1200Phoenix400Dallas900DallasDallas10001300Salt Lake City600A) Draw the network diagram showing all nodes, arcs, and costs associated with this model.

Using the shortest path method, Node 1 is designated as the current node. Node 2, 3 and 4 can be…

A truck must travel from New York to Los Angeles. As shown in the network below, several routes are available. From To Gas Gallons New York Cleveland 400 New York St. Louis 950 Nashville Phoenix New York 800 Cleveland 1800 Cleveland Dallas 900 St. Louis Phoenix 1100 St. Louis Dallas 600 Nashville Dallas 600 Salt Lake City Los Angeles Nashville 1200 Phoenix 400 Dallas Phoenix 900 Salt Lake City Los Angeles Los Angeles 1000 1300 Dallas Dallas Salt Lake City 600 Draw the network diagram showing all nodes, arcs, and costs associated with this model.

A truck must travel from New York to Los Angeles. As shown in the network below, several routes are available. From To Gas Gallons New York Cleveland 400 New York St. Louis 950 Nashville Phoenix New York 800 Cleveland 1800 Cleveland Dallas 900 St. Louis Phoenix 1100 St. Louis Dallas 600 Nashville Dallas 600 Salt Lake City Los Angeles Nashville 1200 Phoenix 400 Dallas Phoenix 900 Salt Lake City Los Angeles Los Angeles 1000 1300 Dallas Dallas Salt Lake City 600 Draw the network diagram showing all nodes, arcs, and costs associated with this model.

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter2: Introduction To Spreadsheet Modeling

Section: Chapter Questions

Problem 20P: Julie James is opening a lemonade stand. She believes the fixed cost per week of running the stand...

See similar textbooks

Similar questions

Travelling Salesman Problem (TSP); Given the following distance matrix, use the nearest neighbor (NN) heuristic to find a route that starts from the warehouse (W), visits each customer only once, and finishes at the warehouse to minimize the distance traveled. What is the route and the corresponding distance? Distances W 1 2 3 4 in miles 18 57 27 50 18 0 65 29 61 57 65 0 36 99 3 27 29 36 0 76 4 50 61 99 76 Route=W-1-3-2-4, Distance=182 miles Route=W-3-1-2-4-W, Distance=270 miles Route = W-3-1-2-4, Distance=220 miles Route=W-1-3-2-4-W, Distance=232 miles Route=W-1-3-4-2, Distance=272 miles 1, 2.
a. A farmers' cooperative association plans to build a new sugar mill in Georgetown. The primary objective of the mill is to provide the farmers with a place to take their crop for processing that will reduce their transportation costs. The members of the co-op believe that the center-of-gravity method is appropriate for this objective. While there are over 200 sugar cane farms in the region, they are tightly clustered around six villages. Using the data below, use the center-of-gravity method to calculate the coordinates of the best location for this mill. All mileage references use Browns Town as (0,0). Village Barney Valley Blue Pasture Congo Valley Bower Rabacca Salem Miles East of Miles North of Sugar Cane Browns Town Browns Town 90 140 20 50 100 10 10 60 70 20 80 120 tonnage 240,000 320,000 450,000 120,000 60,000 140,000
I have two marlets , Hilltor & Biztop, where I will be delivertrg 1 900ds 9oods. Hilltop is located at coordinates L2,0) ano I have 14 twckloads gorp to it. Biztop is lo cated at Coordinetes (16,14) and I have 7 truckloads goirg to it. Use an optimol method to find the location for building a ware house to the two marketi. Record the X Supply Coordinate of the optimal aarehouse location . Round to 2Decimali
Your regular trucking company that you use to move LTL freight from Winnipeg to Duluth, Minnesota, 1s suddenly on strike. You call other trucking companies but cannot get space What could you have done to avoid this situation? 1. Regularly use more than one carrier to create a bank of possible carriers to handle your business 2. Always book space with your truckers in advance 3. Use a pool car operator and hope they have next-day service to Duluth 4. Nothing can be done
The method for determining facility location which involves determining x and y co-ordinates of the proposed new location O a. Factor Rating Method O b. Locational Break-even Analysis O C. Transportation Method Od. Centroid Method
A company with a network of 10 pipelines transports mango juice according to the details shown in Table 1. Determine the maximum flow per hour. 1. Table/Jadual 1 Сарacity Node Node (m3/h) 140 100 120 100 120 80 110 100 100 100 Reverse Capacity |(m³/h) 60 20 40 40 40 20 30 40 60 60 Start End Pipeline 1 2 3 4 1 1 1 2 3 4 6 6 7 3 7 7 8 8 10
10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 A 25 26 27 28 29 30 B с 1 2 Based on the city distance dataset as follows: 3 4 5 6 7 8 9 1 Boston 2 Chicago 3 Dallas 4 Denver 5 LA 6 Miami 7 Phoenix 8 Seattle D Phoenix Chicago Denver Dallas 0 983 1815 1991 3036 1539 2664 2612 Boston Chicago Dallas Total trip miles by the traveler: Index Cities Seattle LA E Total trip miles 983 0 1205 1050 2112 1390 1729 2052 F Distance 1815 1205 0 801 1425 1332 1027 2404 G Denver LA 1991 1050 801 0 1174 2100 836 1373 H 3036 2112 1425 1174 0 2757 398 1909 I Miami 1539 1390 1332 2100 2757 0 2359 3389 J K Phoenix Seattle 2664 1729 1027 836 398 2359 0 1482 A resident of Seattle is embarking on a road trip that takes her to Los Angeles, Phoenix, Chicago, Denver, Dallas, and finally go back to Seattle. How many miles will she travel on this trip? Hint: Use INDEX and MATCH to answer the above question. 2612 2052 2404 1373 1909 3389 1482 0 L M N
City Cab Company identified 10 primary pickup and drop locations for cab riders in New York City. In an effort to minimize travel time and improve customer service and the utilization of the company's fleet of cabs, management would like the cab drivers to take the quickest route between locations whenever possible. The travel times in minutes are shown on the arcs of the network. Note that there are two one-way streets and that the direction is shown by the arrows. 1 I 13 10 15 10 2 5 3 2 4 4 5 15 3 5 6 12 2 7 5 8 4 7 9 Using the above network of roads and streets, what is the quickest route a driver beginning at location 1 should take to reach location 10? path = 1, 10
Find the shortest route for a delivery truck going from the PLANT, to the warehouse, then delivery to points 3, 4, and 5 (can be interchanged), and back to the plant again. Plant 1 100 200 50 3 200 100 40 5 150 100 100 6 Warehouse
(1) Find an optimal assignment of trucks to routes to minimize the total cost (using the Hungarian Method). B C 6 12 15 10 11 7 16 9 Truck / Route 1 2 3 4 Step la: Row subtraction (show your steps, e.g., see cell 1A) Truck / Route B 1 2 3 4 A 10 11 9 14 Step 1b: Column subtraction. Truck / Route 1 2 3 4 A 10-6=4 = = = = = B = с = C Step 2: Testing for optimal solution (show your lines covering the zero entries). What is the minimum number of lines required to cover all zeros? D 8 14 10 13 D = = D =
Describe how a transportation planner could use a routing guide.
A county wants to build one centrally-located processing facility to serve the county's four recycling drop-off locations. The four drop-offs have characteristics as given in the table below. What is the approximate center of gravity of these four locations? (Round answer to two decimal places.) Location Drop-off point A Drop-off point B Drop-off point C Drop-off point D O A. (22.46, 25.17) O B. (8.00, 10.00) O C. (1,370.00, 730.00) O D. (11.25, 11.25) O E. (13.70, 7.30) X-coordinate 5 8 41 7 Y-coordinate 7 275 10 Tonnage 20 30 20 30