Abstract
AbstractThis article introduces the cumulative school bus routing problem, which concerns the transport of students from a school using a fleet of identical buses. The objective of the problem is to select a drop‐off point for each student among potential locations within a certain walking distance and to generate routes such that the sum of arrival times of all students from their school to their homes is minimized. The article describes six polynomial‐size mixed integer linear programming formulations based on original and auxiliary graphs, and the formulations are numerically compared on real instances. The article reports the results of computational experiments performed to evaluate the performance of the proposed models.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
