This repository demonstrates the usage of OR-Tools and OSMnx.
Vehicle Routing Problem (VRP) is a combinatorial optimization problem that involves finding the optimal set of routes for a fleet of vehicles to visit a set of locations, subject to various constraints. It is a well-known problem in the field of operations research and has many practical applications such as logistics, transportation, and supply chain management.
OR-Tools is an open-source software suite for optimization developed by Google. It includes a wide range of solvers and tools for solving various types of optimization problems, including VRP.
OSMnx is a Python library for working with OpenStreetMap (OSM) data. It allows you to download OSM data, visualize it, and perform various spatial analyses on it. In this notebook, we will use OSMnx to download street network data for a specific location.
The goal of the notebook is to demonstrate how to solve a VRP using OR-Tools and OSMnx. Specifically, we will use OSMnx to download street network data for a specific location, and then use OR-Tools to find the optimal set of routes for a fleet of vehicles to visit a set of bus stops in that location, subject to various constraints such as vehicle capacity and maximum distance traveled. Finally, we will visualize the results on a map using folium. This notebook is intended for anyone who is interested in learning about VRP, OR-Tools, and OSMnx, regardless of their level of expertise in these areas.
See 1. Vehicle Routing Problem (VRP) demo with OSMnx and OR-Tools
