Skip to main content
SpringerLink
Log in

On constructing a family of student delivery routes in minimal time

  • Topical Issue
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Newton, R.M. and Thomas, W.H., Design of School Bus Routes by Computer, Socio-Econom. Planning Sci., 1969, vol. 3, pp. 75–85.

    Article  Google Scholar 

  2. Park, J. and Kim, B.-I., The School Bus Routing Problem: A Review, Eur. J. Oper. Res., 2010, vol. 202, no. 2, pp. 311–319.

    Article  MATH  Google Scholar 

  3. Bock, A., Grant, E., Kanemann, J., and Sanito, L., The School Bus Problem on Trees, Algorithm. Comput. Lecture Notes Comput. Sci., 2011, vol. 7074, pp. 10–19.

    Article  Google Scholar 

  4. Dantzig, G.B. and Ramser, J.H., The Truck Dispatching Problem, Manag. Sci., 1959, vol. 6, no. 1, pp. 80–91.

    Article  MATH  MathSciNet  Google Scholar 

  5. Tanaev, V.S. and Shkurba, V.V., Vvedenie v teoriyu raspisanii (Introduction to Scheduling Theory), Moscow: Nauka, 1973.

    Google Scholar 

  6. Sotskov, Yu.N., Strusevich, V.A., and Tanaev, V.S., Matematicheskie modeli i metody kalendarnogo planirovaniya (Mathematical Models and Calendar Planning Methods), Minsk: Universitetskoe, 1994.

    Google Scholar 

  7. Cormen, T.H., Leizerson, C.E., and Rivest, R.L., Introduction to Algorithms, Cambridge: MIT Press, 1990. Translated under the title Algoritmy. Postroenie i analiz, Moscow: Vil’yams, 2006.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ufa State Aviation Technical University, Ufa, Russia

    E. M. Bronshtein, D. M. Vagapova & A. V. Nazmutdinova

Authors
  1. E. M. Bronshtein
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. M. Vagapova
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. V. Nazmutdinova
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to E. M. Bronshtein.

Additional information

Original Russian Text © E.M. Bronshtein, D.M. Vagapova, A.V. Nazmutdinova, 2014, published in Avtomatika i Telemekhanika, 2014, No. 7, pp. 43–51.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bronshtein, E.M., Vagapova, D.M. & Nazmutdinova, A.V. On constructing a family of student delivery routes in minimal time. Autom Remote Control 75, 1195–1202 (2014). https://doi.org/10.1134/S0005117914070029

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117914070029

Keywords

Search

Navigation