Case Study By: The South Group Binder’s Beverage Case Study By: The South Group

Binder’s Beverages Business Problem Binder’s Beverages has a plant in Denver and a warehouse in east Denver. The problem is to get the finished product to the warehouse. There is a network diagram of the roads from the plant to the warehouse and the amount of time for each branch is given.

Binder’s Beverages What is the shortest route from the plant to the warehouse? To solve this we must first correct an error in the network diagram provided in the text book. This is the diagram as provided in the text. 2 4 8 5 7 9 3 6 1 10

Binder’s Beverages When looking at the information about how much time it takes on the branches to and from the nodes, it becomes apparent that there should be a branch connecting code 3 and 5. This is the corrected network diagram, with the added branch in red. 2 4 8 3 5 7 9 6 1 10

Binder’s Beverages Open QM For Windows. Select the modules drop down menu and select the networks option.

Binder’s Beverages Next open a new shortest route file.

Next Enter the number of branches for the problem. Binder’s Beverages Next Enter the number of branches for the problem.

Binder’s Beverages Fill in data grid with problem data. Also set the destination and origin. Solve the problem by clicking the solve button

Binder’s Beverages 7. The solution can be viewed in the data grid

Binder’s Beverages The shortest route is 1  2  4  8  9  10. It takes 65 minutes. The shortest route is shown in red on the following diagram. 2 4 8 5 7 9 3 1 6 10