The school bus routing problem: A case study

Yuk On Li, Z. Fu

Research output: Journal article publicationJournal articleAcademic researchpeer-review

108 Citations (Scopus)


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.
Original languageEnglish
Pages (from-to)552-558
Number of pages7
JournalJournal of the Operational Research Society
Issue number5
Publication statusPublished - 1 Jan 2002


  • Combinatorics
  • Heuristics
  • Optimization
  • Transport
  • Vehicle routing

ASJC Scopus subject areas

  • Management Information Systems
  • Strategy and Management
  • Management Science and Operations Research
  • Marketing


Dive into the research topics of 'The school bus routing problem: A case study'. Together they form a unique fingerprint.

Cite this