Data Collection
Initial Project Topic: Using optimization techniques to observe the efficiency of Piki tup’s garbage collection routes
Initial Expo Category: 119 Mathematics and statistics

Question or Problem being addressed: Are the distances of the route that Piki tup takes to collect garbage the most effect or can they be optimized using discrete mathematics?
Hypothesis: The distances of the routes that Piki tup takes to collect garbage aren’t the most efficient and can be shortened because the optimal route covers much shorter distances than Piki tup.
Apparatus:
Any functional computer The route/s that Piki tup currently takes to deliver garbage (I will be using 1-4 of Piki tup’s routes for different areas in Johannesburg dependent on the time available and how complex the experiment gets)
Label the half of the vertices from V1 – V((Total number of vertices)/2 ) and the other half from X - X((Total number of vertices)/2 ). For example:
-If there were 40 vertices (40 street intersections) in the total from the graph (Suburb), then the half the amount of vertices would be labeled from V1 – V( 40/( 2) ) and the other half would be labeled X1 – X( 40/( 2) ) and therefore be labeled V1 – V20 and X1 – X20.
4. Find the distance (in hundred metres) of each road in the suburb or for each line segment in the graph. Use Google Maps to do this by clicking on where the road you want to measure starts and the clicking on where it ends. Record this information in your two graphs as labels for the line segments you are measuring.
5. Pick any one of your two identical graphs for this next step. Draw out the route Piki tup currently takes to collect garbage. In number and letters describe the route using the names of the vertices as a