On constructing a family of student delivery routes in minimal time

We consider the school bus routing problem which is to construct the routes for delivering students after classes by multiple buses in minimal time. We show the corresponding linear partially integer model. Together with an exact algorithm we show a simple heuristic algorithm and present the results of a computational experiment.

Presented by the member of Editorial Board: A. A. Lazarev