(1) Find an optimal assignment of trucks to routes to minimize the total cost (using the Hungarian Method).BC6121510117169Truck / Route1234Step la: Row subtraction (show your steps, e.g., see cell 1A)Truck / RouteB1234A1011914Step 1b: Column subtraction.Truck / Route1234A10-6=4=====B=с=CStep 2: Testing for optimal solution (show your lines covering the zero entries).What is the minimum number of lines required to cover all zeros?D8141013D==D=

The Assignment Problem is a problem in the field of Operations Management which is defined as…

Answered: (1) Find an optimal assignment of…

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter5: Network Models

Section5.5: Shortest Path Models

Problem 32P

See similar textbooks

Similar questions

Assign nine automobile service departments to bays in a 3 × 3 grid so that the closeness ratings Problem 2 in the following matrix are satisfied. (The unimportant and ordinary-importance ratings have been omitted to simplify the example.) The location of department 4 must be in the upper right-hand corner of the grid to satisfy a town ordinance.
Maximal Flow a. Write the linear program for this problem. b. Create a spreadsheet model to find the maximal flow from node 1 to 6
The MidLands Trucking Company based in Louisvillehas eight trucks located throughout the Mideast that havedelivered their loads and are available for shipments. Through their Internet logistics site MidLands has re-ceived shipping requests from 12 customers. The follow-ing table shows the mileage for a truck to travel to a customer location, pick up the load, and deliver it. Determine the optimal assignment of trucks to customersthat will minimize the total mileage. Customers Truck A B C D E F G H I J K L1 500 730 620 410 550 600 390 480 670 710 440 5902 900 570 820 770 910 660 650 780 840 950 590 6703 630 660 750 540 680 750 810 560 710 1200 490 6504 870 1200 810 670 710 820 1200 630 700 900 540 6205 950 910 740 810 630 590 930 650 840 930 460 5606 1100 860 800 590 570 550 780 610 1300 840 550 7907 610 710 910 550 810 730 910 720 850 760 580 6308 560 690 660 640 720 670 830 690 880 1000 710 680
Mo. A company needs to make deliveries on 10 different routes. The time (in minutes) to complete each route and the delivery amount (i.e., the load in number of units) are as follows. Route RO1 R02 R03 R04 R05 R06 R07 R08 R09 R10 Time 29 35 15 35 20 23 35 40 45 50 Load 200 240 110 90 65 135 80 170 150 270 The company is considering 6 carriers to make these deliveries. The vehicle capacities of these carriers are as follows. Carrier C01 C02 C03 C04 C05 C06 Capacity 600 720 450 510 660 550 The problem is to assign routes to the minimum number of carriers in such a way that all routes are completed within a time limit of two hours. For instance, routes 5, 9, and 10 could be assigned to carrier C04 because the total time to complete the routes is 115 minutes and the total load is 485. Create a spreadsheet model and use solver for optimized route?
Bao wants to consolidate the sales data in the S., Canada, and U.K. worksheets on the All Locations worksheet. Ungroup the worksheets, go to the All Locations worksheet, and then consolidate the data as follows: In cell B6, enter a formula using the SUM function and a 3D reference to total the revenue from Action movies in Quarter 1 (cell B6) in the U.S., Canada, and U.K. Copy the formula in cell B6 to calculate the revenue from the other types of movies for all four quarters (range B7:B11 and C6:E11), pasting the formula only.
A company needs to locate three departments (X, Y, and Z) in the three areas (I, II, and III) of a new facility. They want to minimize interdepartmental transportation costs, which are expected to be $.50 per load meter moved. An analyst has prepared the following flow and distance matrices: Distances (meters) Flows (Loads per week) From/To I II III From/To X Y Z I - 10 20 X - 0 80 II - - 10 Y 30 - 150 III - Z 100 130 -If the company were to locate departments X, Y, and Z in areas 1, 2, and 3, respectively, what would be the total distance (in meters) loads would be moved each week?A. 3,100B. 3,600C. 6,200D. 7,200E. 8,200 Work must…
BETTER PRODUCTS COMPANY has decided to start manufacturing four new products in three plants that currently have excess production capacity. The products require comparable production effort per unit, so the available production capacity in the plants is measured by the number of units of any product that can be manufactured per day. a)Formulate this problem as a transportation problem by constructing the appropriate parameter table. I already have an optimal solution (it's from the book). (I dont understand)-------------------------------------------------------------------------OPTIMAL SOLUTION:It has basic variables (assignments) X₁₂ = 30, X₁₃ = 30, X₁₅ = 15, X₂₄ = 15, X₂₅ = 60, X₃₁ = 20 and X₃₄ = 25, so that: Plant 1 produces all of products 2 and 3.Plant 2 produces 37.5% of product 4.Plant 3 produces 62.5% of product 4 and all of product 1. The total cost of Z = $3 260 per day.-------------------------------------------------------------------------Instructions:Please explain this…
BETTER PRODUCTS COMPANY has decided to start manufacturing four new products in three plants that currently have excess production capacity. The products require comparable production effort per unit, so the available production capacity in the plants is measured by the number of units of any product that can be manufactured per day. a)Formulate this problem as a transportation problem by constructing the appropriate parameter table. I already have an optimal solution (it's from the book). (I dont understand)-------------------------------------------------------------------------OPTIMAL SOLUTION:It has basic variables (assignments) X₁₂ = 30, X₁₃ = 30, X₁₅ = 15, X₂₄ = 15, X₂₅ = 60, X₃₁ = 20 and X₃₄ = 25, so that: Plant 1 produces all of products 2 and 3.Plant 2 produces 37.5% of product 4.Plant 3 produces 62.5% of product 4 and all of product 1. The total cost of Z = $3 260 per day.-------------------------------------------------------------------------Instructions:Please explain this…
9-43. Northwest University is in the process of complet-ing a computer bus network that will connect com-puter facilities throughout the university. The prime objective is to string a main cable from one endof the campus to the other (nodes 1–25) throughunderground conduits. These conduits are shownin the network below; the distance between them isin hundreds of feet. Fortunately, these undergroundconduits have remaining capacity through which thebus cable can be placed.(a) Given the network for this problem, how long (inhundreds of feet) is the shortest route from node1 to node 25?(b) In addition to the computer bus network, a newphone system is also being planned. The phonesystem would use the same underground conduits. If the phone system were installed, the follow-ing paths along the conduit would be at capacity and would not be available for the computer busnetwork: 6–11, 7–12, and 17–20. What changes(if any) would you have to make to the pathused for the computer bus if the phone…
You work for ABC Transportes, which is implementing a Route Management System. To do so, you must study a route from the city of ITA to the city of OSA. Considering the graph in Figure 1 and the Table 1, you must represent the problem as follows: 1) State space States: s State Space: S Initial State: s0 Final State(s): G __________________ Figure 1:
Formulate but do not solve the problem.The management of Hartman Rent-A-Car has allocated $2.25 million to buy a fleet of new automobiles consisting of compact, intermediate-size, and full-size cars. Compacts cost $18,000 each, intermediate-size cars cost $27,000 each, and full-size cars cost $36,000 each. If Hartman purchases twice as many compacts as intermediate-size cars and the total number of cars to be purchased is 100, determine how many cars of each type will be purchased. (Assume that the entire budget will be used. Let x, y, and z denote the number of compact, intermediate-sized, and full-size cars purchased, respectively.) = 2,250,000 = x = 100
Consider the network in the following figure. Edges that are not pictured have a length of ∞. Image attatched (a) What is the optimal TSP tour on this network, and what is its total length, z*? What is the optimal 1-tree Tˆ* on this network (“rooted” at node 1), and what is its total length, z(Tˆ*)? (b) Find the best Held-Karp lower bound you can. That is, find weights to add to one or more nodes so that z* and the right-hand side of the following formula are as close as possible. z* ≥ z(Tˆ*) + SUM{i∈N} λi(di(Tˆ*) − 2) Image attatched Here Tˆ* is the optimal 1-tree under the revised distance matrix, z(Tˆ*) is its cost and di(Tˆ*) is the degree of node i in 1-tree Tˆ*.

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

(1) Find an optimal assignment of trucks to routes to minimize the total cost (using the Hungarian Method). Truck / Route A B C 1 10 12 11 10 9 7 14 9 2 3 4 6 15 11 16 Step la: Row subtraction (show your steps, e.g., see cell 1A) Truck / Route A B 1 10-6=4 = C = D 8 14 10 13 D =