Inspiration
This project comes from a challenge proposed by Caixa d'Enginyers.
What it does
It optimizes the transit routes of vans that offer banking services in low population towns in Catalonia.
How we built it
We built it in Python, using a greedy search algorithm and branch and bound to optimize the routes. We also used the Google Maps Platform to perform certain tasks and obtain the necessary data.
Challenges we ran into
Writing the branch and bound algorithm proved to be difficult and also using the Google Maps Platform API.
Accomplishments that we're proud of
We are proud to have managed to omplement the branch and bound part and also to have been able to integrate the Google Maps API into the project.
What we learned
We reinforced our knowledge on certain algorithms for the optimization of the routes.
Log in or sign up for Devpost to join the conversation.