Inspiration
We initially worked as a group when we all took Graph Theory this past fall, so we wanted to design a project that dealt with some facet of that. We settled onto solving a Traveling Salesman Problem with the minimal spanning path of a graph.
What it does
Our algorithm works by brute forcing the node points given the initial starting point, with (n-1)! total possibilities. We then measure the amount of weight to each edge in the graph by using the Google Maps Distance Matrix API to determine the fastest permutation order and route.
How we built it
lots of learning
Challenges we ran into
We really struggled with our front end web development, producing many bugs that we had to step through. We also had trouble defining what algorithm to use for obtaining the mimimum spanning path as TSP has high run time, and we wanted to avoid that. We could not.
Accomplishments that we're proud of
2/3 of the team pulled an all nighter
What we learned
Working with-in a deadline to follow-through the whole lifespan of a project: conception, planning, implementation, de-bugging, optimizing, and presenting. Full stack development, API implementation, and Algorithm design
What's next for Optipath
Ideally, we add more functionality to the web application by allowing the user to choose what factors to prioritize when designing their path, such as gas efficiency or time efficiency.
Log in or sign up for Devpost to join the conversation.