Fall 2013
Team Members: Dallas Kuchel, Efrain Reyes, Matthew Stirling
The team developed an algorithm, coded in SAS, that solves large Vehicle Routing Problems. The algorithm first decomposes the set of deliveries into subsets with a clustering algorithm.
Then each cluster is independently solved as a Traveling Salesman Problem. The team uses an approach that first solves the each TSP as a Linear Program with fractional solutions. Then the algorithm dynamically adds cuts until an acceptable integer solutions is reached.
To find more information on the model formulation as well as other formulations that were attempted, please see the Final Report located off the Documents tab.