Ten Real-World Problem Instances (Malta) of the Single-School Bus Routing Problem
<div> <div> <div> <div> <p>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 </p> <div> <div> <div> <div> <p><strong>Lewis, R. and Smith-Miles, K. (2018). A heuristic algorithm for finding cost-effective solutions to real-world school bus routing problems. <em>Journal of Discrete Algorithms</em>, 52-53:2–17</strong></p> <p>and is as follows.</p> <p> </p> </div> </div> </div> </div> <p>The first line in each file gives:</p> <ul> <li>The number of bus stops, including the school;</li> <li>The number of student addresses;</li> <li>The number of listed walks from student addresses to bus stops;</li> <li>The distance unit (K for km, M for miles);</li> <li>The minimum eligibility distance;</li> <li>The maximum walking distance;</li> <li>Further information, which can be ignored. </li> </ul> <div> <div> <div> <p>The second line contains the following details on the school:</p> <ul> <li>An “s” indicating that this line contains information about a stopping location; </li> <li>School's latitude;</li> <li>School's longitude;</li> <li>School's name. </li> </ul> <p>The next lines starting with an "s" contain the following details on the bus stops: </p> <ul> <li>Stop's latitude;</li> <li>Stop's longitude;</li> <li>Stop's name. </li> </ul> <p>The next lines starting with an "a" contain the following details on the student addresses: </p> <ul> <li>Address's latitude;</li> <li>Address's longitude;</li> <li>Number of children requiring transport to the school at this address;</li> <li>Family name at this address.</li> </ul> <p>The next lines starting with a "d" contain the following distance details between pairs of stopping locations:</p> <ul> <li>Index of start location;</li> <li>Index of end location;</li> <li>Driving distance between start and end locations;</li> <li>Driving time (seconds) between start and end locations.</li> </ul> </div> </div> </div> <p>The next lines starting with a "w" contain the following walk details between pairs of one student address and one bus stop: </p> <ul> <li>Index of address;</li> <li>Index of bus stop;</li> <li>Walking distance between address and bus stop;</li> <li>Walking time (seconds) between address and bus stop. </li> </ul> <p><em>Note that all indices start from 0. For stopping locations, 0 corresponds to the school and the rest correspond to the bus stops. </em></p> </div> </div> </div> </div>
ShareScore
32/100
Overall dataset sharing score
Score breakdown
These five areas show where the dataset supports — or may limit — practical reuse.
- Stewardship
- 4
- Harmonization
- 4
- Access
- 16
- Reuse readiness
- 8
- Engagement
- 0