20. Suppose that one wishes to schedule vehicles from a central depot to five customerlocations. The cost of making trips between each pair of locations is given in thefollowing matrix. (Assume that the depot is location 0.)Cost Matrix (c)то12345753310301542F13520R2185834020M425Assume that these costs correspond to distances between locations and thateach vehicle is constrained to travel no more than 50 miles on each route. Find therouting suggested by the savings method.20

0 1 2 3 4 5 0 20 75 33 10 30 F 1 35 5 20 15 R 2 18 58 42 O 3 40 20…

Answered: 20. Suppose that one wishes to schedule…

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter6: Optimization Models With Integer Variables

Section6.5: Set-covering And Location-assignment Models

Problem 35P

See similar textbooks

Similar questions

Continuing the previous problem, suppose again thatall arcs go in both directions, but suppose Maude’sobjective is to find the shortest path from node 1 tonode 7 (not node 10). Modify the spreadsheet modelappropriately and solve.
A company has factories at F1, F2 and F3 which supply to warehouses at W1, W2 and W3. Weekly factory capacities are 200, 160 and 90 units, respectively. Weekly warehouse requiremnet are 180, 120 and 150 units, respectively. Unit shipping costs (in rupess) are as follows: W1 W2 W3 Supply F1 16 20 12 200 F2 14 8 18 160 F3 26 24 16 90 Demand 180 120 150 450 Determine the optimal distribution for this company to minimize total shipping cost.
Problem 7-18 (pg 279) Using the following equations, graph the constraints and solve using the corner point approach. X1 = number of undergraduate courses X2 = number of graduate courses Minimize cost = $2,500X1 + $3,000X2 subject to X1 >= 30 X2 >= 20 X1 + X2 >= 60 X1, X2 >= 0
Suppose a company must service customers lying inan area of A sq mi with n warehouses. Kolesar and Blumhave shown that the average distance between a warehouseand a customer is An Assume that it costs the company $60,000 per year tomaintain a warehouse and $400,000 to build a warehouse.(Assume that a $400,000 cost is equivalent to foreverincurring a cost of $40,000 per year.) The company fills160,000 orders per year, and the shipping cost per order is$1 per mile. If the company serves an area of 100 sq mi,then how many warehouses should it have?
Draw the network for this transportation problem. (Let xij represent the flow from node i to node j.) Min 2x13 + 4x14 + 6x15 + 8x23 + 11x24 + 9x25 s.t. x13 + x14 + x15 ≤ 500 x23 + x24 + x25 ≤ 400 x13 + x23 = 300 x14 + x24 = 300 x15 + x25 = 300 xij ≥ 0
A truck driver has to deliver a load of lumber to oneof two construction sites, which are, respectively, 27 and 33 miles from the lumberyard, but he has misplaced theorder telling him where the load of lumber should go. The two construction sites are 12 miles apart, and, to compli-cate matters, the telephone at the lumberyard is out of order. Where should he go first if he wants to minimizethe distance he can expect to drive and he feels that(a) the odds are 5 to 1 that the lumber should go to theconstruction site that is 33 miles from the lumberyard;(b) the odds are 2 to 1 that the lumber should go to theconstruction site that is 33 miles from the lumberyard;(c) the odds are 3 to 1 that the lumber should go to theconstruction site that is 33 miles
General Ford produces cars at L.A. and Detroit and hasa warehouse in Atlanta; the company supplies cars tocustomers in Houston and Tampa. The cost of shipping a carbetween points is given in Table 60 (“—” means that ashipment is not allowed). L.A. can produce as many as1,100 cars, and Detroit can produce as many as 2,900 cars.Houston must receive 2,400 cars, and Tampa must receive1,500 cars.a Formulate a balanced transportation problem thatcan be used to minimize the shipping costs incurred inmeeting demands at Houston and Tampa.b Modify the answer to part (a) if shipments betweenL.A. and Detroit are not allowed.c Modify the answer to part (a) if shipments betweenHouston and Tampa are allowed at a cost of $5.
A company has n factories. Factory i is located at point(xi, yi), in the x–y plane. The company wants to locate awarehouse at a point (x, y) that minimizes ini1(distance from factory i to warehouse)2Where should the warehouse be located?
the Problem. The DISTRIBUTION UNLIMITED CO. will be producing the same new product at two different factories, and then the product must be shipped to two warehouses, where either factory can supply either warehouse. The distribution network available for shipping this product is shown in Fig. 3.13, where F1 and F2 are the two factories, W1 and W2 are the two warehouses, and DC is a distribution center. The amounts to be shipped from F1 and F2 are shown to their left, and the amounts to be received at W1 and W2 are shown to their right. Each arrow represents a feasible shipping lane. Thus, F1 can ship directly to W1 and has three possible routes (F1 → DC → W2, F1 → F2 → DC → W2, and F1 → W1 → W2) for shipping to W2. Factory F2 has just one route to W2 (F2 → DC → W2) and one to W1 (F2 → DC → W2 → W1). The cost per unit shipped through each shipping lane is shown next to the arrow. Also shown next to F1 → F2 and DC → W2 are the maximum amounts that can be shipped through these lanes. The…
Consider the transportation table below. REQUIREDa. Define the decision variablesb. Write a linear programming model for this problem.c. Use the Northwest-Corner Method, the Least-Cost Method and the VAM to getthe starting feasible solution.d. Find the optimal solution using the transportation algorithm discussed in class by considering the least optimal of the objective function computed in (c).e. Formulate a network model to illustrate the optimal solution
ASAP PLEASE.. The distribution of goods from the source (factory) to the target (warehouse) will cause problems regarding TRANSPORT, namely how the goods are sent from the factory to the warehouse which produces minimum costs. If it is known that - the capacity of 3 factories is 40000, 30000 and 20000, - the need for 3 warehouses is 20000, 50000 and 30000 respectively. The cost of shipping goods from the factory to the warehouse is shown in the following table Solve the above TRANSPORTATION problems with VAM and MODI
[8] Given the constraints in this problem the maximum profit is:

SEE MORE QUESTIONS

Recommended textbooks for you

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

SEE MORE TEXTBOOKS