IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v53y2002i5d10.1057_palgrave.jors.2601341.html
   My bibliography  Save this article

The school bus routing problem: a case study

Author

Listed:
  • L Y O Li

    (The Hong Kong Polytechnic University)

  • Z Fu

    (Central South University, Changsha, People's Republic of China)

Abstract

This paper describes a case study of the school bus routing problem. It is formulated as a multi-objective combinatorial optimisation problem. The objectives considered include minimising the total number of buses required, the total travel time spent by pupils at all pick-up points, which is what the school and parents are concerned with most, and the total bus travel time. It also aims at balancing the loads and travel times between buses. A heuristic algorithm for its solution is proposed. The algorithm has been programmed and run efficiently on a PC. Numerical results are reported using test data from a kindergarten in Hong Kong. It has shown to be effective with a saving of 29% in total travelling times when comparing to current practice.

Suggested Citation

  • L Y O Li & Z Fu, 2002. "The school bus routing problem: a case study," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(5), pages 552-558, May.
    • Handle: RePEc:pal:jorsoc:v:53:y:2002:i:5:d:10.1057_palgrave.jors.2601341
    DOI: 10.1057/palgrave.jors.2601341
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601341
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2601341?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pal:jorsoc:v:53:y:2002:i:5:d:10.1057_palgrave.jors.2601341. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.