Math 1140 Writing Assignment #1
Hamilton Circuits in My Life
In this assignment, you will use your knowledge of Hamilton Circuits to determine the most
efficient path for running a series of errands.
1. Choose three places that you often visit (grocery store, restaurant, work, etc.), and list the
addresses for each, as well as for your campus home, in the table below. Note: It is best
of the locations are not all the same approximate distance from each other.
Location
A
B
C
D
Name
Campus Home
Address
2. Use Mapquest or a similar program to determine the distance from each location to each
of the other locations on your list. Round to the nearest tenth of a mile for each
distance. Complete the table below with this information.
A
B
C
D
A
*
B
C
D
*
*
*
3. Next create a model by sketching and labeling a weighted graph with your locations and
distances. You are welcome to insert a picture of your graph if you are drawing it by
hand.
4. Suppose you are planning to start at home, visit each of your other three locations, and
then return home again. Use the Brute Force Method to determine the most efficient route
you can take to complete your errands. Clearly show all your work below.
5. Finally, use the Nearest Neighbor Method to determine an efficient route that you can
take to complete your errands. Clearly show each step of your process below. How does
your solution compare to what you found in Part Four?
Writing Assignment #1
Rubric
Writing Assignment #1
Answer to Part One is complete.
(2 pts possible)
Part Two contains a complete
and reasonable table. (3 pts
possible)
Complete, weighted graph is
clearly shown, and accurately
matches the situation. (4 pts
possible)
All work for the Brute Force
Method is clearly, completely
and correctly done. Optimal
Hamilton circuit is identified. (3
pts possible)
Nearest Neighbor Method is
correctly applied to find a
Hamilton Circuit and
comparison to the Brute Force
Method is made. (4 pts possible)
TOTAL SCORE (OUT OF 16)
Comments:
Please see comments above.
2
3
4
3
4