Dataset for the optimization of chartered bus transportation at Unicamp

This dataset includes distance matrices computed from thousands of chartered bus stops associated with Unicamp. Each stop is georeferenced with latitude and longitude coordinates, which were processed to calculate both road network distances (in meters) and travel times (in seconds) between all points. These matrices can be used to solve combinatorial optimization problems such as the Traveling Salesman Problem (TSP) or the Vehicle Routing Problem (VRP). Additionally, each stop was arbitrarily assigned a number of passengers ranging from 1 to 3.