Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/27894
Title: The school bus routing problem : a case study
Authors: Li, LYO 
Fu, Z
Keywords: Combinatorics
Heuristics
Optimisation
Transport
Vehicle routing
Issue Date: 2002
Publisher: Palgrave Macmillan
Source: Journal of the Operational Research Society, 2002, v. 53, no. 5, p. 552-558 How to cite?
Journal: Journal of the Operational Research Society 
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.
URI: http://hdl.handle.net/10397/27894
ISSN: 0160-5682
EISSN: 1476-9360
DOI: 10.1057/palgrave/jors/2601341
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

48
Last Week
0
Last month
1
Citations as of Sep 7, 2017

WEB OF SCIENCETM
Citations

35
Last Week
0
Last month
0
Citations as of Sep 14, 2017

Page view(s)

55
Last Week
2
Last month
Checked on Sep 18, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.