Network Model Assignment

For this assignment, you are going to build a network (netform) model and determine the shortest path from an origin to a destination!

You are going to a Halloween party at a friends house! A few things need to happen, first. You have procrastinated a little bit and so you have to pick a few things up on the way to the party. You will need to go to a grocery store and get a snack to take to the party, and then you will need to go to a costume shop and get a costume for the party! You will start at your house, and you will end the trip at your friends house. You decide to go by the grocery store first so that you have more time at the costume shop before you have to leave for the party. There are two grocery stores and two costume shops in your town. The two grocery stores are Daves Groceries and Foodies. The two costume shops are Howl-o-ween and Carlies Costumes. The distances between the nodes are given below.

Origin	Destination	Distance
Your house	Dave's Groceries	5
Your house	Foodie's	7
Dave's	Howl-o-ween	2
Dave's	Carlie's Costumes	3
Foodie's	Howl-o-ween	3
Foodie's	Carlie's Costumes	3
Howl-o-ween	Friend's House	2
Carlie's Costumes	Friend's House	1

Remember that you will go to the grocery store first.

1. Draw the netform diagram. Remember to label the nodes and include the arc distances.
2. Solve this problem! You can either solve it manually or you can solve it with a computer solution. This is most similar to the Cable Network problem in the slides.