Ten Real-World Problem Instances (Malta) of the Single-School Bus Routing Problem

Each problem instance is specified in a file with the extension .bus. The format of each file is similar to that of the problem instances used in 

Lewis, R. and Smith-Miles, K. (2018). A heuristic algorithm for finding cost-effective solutions to real-world school bus routing problems. Journal of Discrete Algorithms, 52-53:2–17

and is as follows.

The first line in each file gives:

The number of bus stops, including the school;

The number of student addresses;

The number of listed walks from student addresses to bus stops;

The distance unit (K for km, M for miles);

The minimum eligibility distance;

The maximum walking distance;

Further information, which can be ignored. 

The second line contains the following details on the school:

An “s” indicating that this line contains information about a stopping location; 

School's latitude;

School's longitude;

School's name. 

The next lines starting with an "s" contain the following details on the bus stops: 

Stop's latitude;

Stop's longitude;

Stop's name. 

The next lines starting with an "a" contain the following details on the student addresses: 

Address's latitude;

Address's longitude;

Number of children requiring transport to the school at this address;

Family name at this address.

The next lines starting with a "d" contain the following distance details between pairs of stopping locations:

Index of start location;

Index of end location;

Driving distance between start and end locations;

Driving time (seconds) between start and end locations.

The next lines starting with a "w" contain the following walk details between pairs of one student address and one bus stop: 

Index of address;

Index of bus stop;

Walking distance between address and bus stop;

Walking time (seconds) between address and bus stop. 

Note that all indices start from 0. For stopping locations, 0 corresponds to the school and the rest correspond to the bus stops.