route optimization for waste collection - Madrid challenge

Date |
Mar 2019
Technologies |

Open data challenge promoted by Kopuru. The challenge here is to calculate and show on a map which is the shortest route for the collection of glass containers within the district of Madrid Central. In doing so, we could help the City Council of Madrid through the use of data to improve the service to its citizens. The final result is hosted on

Challenge Objectives

  • To create a visualization platform that delimits the area of Central Madrid and collects the geolocation of the different types of containers.
  • To calculate and visualize the route to be followed identifying the starting point, route, end point and distance travelled. The team that identifies the shortest route (measured in meters) respecting the direction of the streets will win.

Route Optimization
The route optimization was inspired by Todd W. Schneider approach, where he designs a Shiny app to solve the traveling salesman problem with simulated annealing. Route distances and travel times were queried from HERE maps API. The number of queries were reduced as much as possible, reducing the number of neighbours to a fixed value N, given that the completeness of the graph remained untouched.