This was my IB Mathematics internal asessement. I tried to find a way to find the best place for meeting with my classmates taking into account that we were from all over Catalonia.
I tried to minimize the time there were cars on the road so we would try to share cars whenever possible. I used Prim’s algorithm for a first model using spanning trees and later google OR-tools for a model using CVRP.
Unfortunately, the code for the project is not really useful. For this project a way to get the time-distance between two people is needed, and would involve using an API from a site like Google maps or similar. Given that I only needed the program to run once for the essay and for a research project, I got the data in a semi-manual way from a service that allowed me to.
When looking for which service to use I also noticed that commercial use of their data in routing programs like mine is usually explicitly forbidden with the normal agreements. This means that creating a real-life usable application would be a very difficult task from an economic/business point of view.
It is a project that I would be interested to pick up again, but right now its not really possible due to the problems I have explained.