1972
DOI: 10.1287/mnsc.18.6.b279
|View full text |Cite
|
Sign up to set email alerts
|

Computer-Assisted School Bus Scheduling

Abstract: This paper reports on an application of computer technology to a significant and costly school administration problem: the transportation of students between home and school. The problem, as it is generally thought of, has been complicated by the consideration of attempting racial balance via busing. We present an algorithm to find a feasible solution which tends to minimize the number of required routes and mileage. After setting down the basic approach used and the results of an application, we will present … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
53
0
2

Year Published

1998
1998
2017
2017

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 114 publications
(55 citation statements)
references
References 4 publications
0
53
0
2
Order By: Relevance
“…The MTSP already presents enough characteristics to represent practical problems, such as school vehicle routing [30]. Bektas [31] presented other examples of practical applications and algorithms for MTSP.…”
Section: Optimization and Vehicle Routing Problemsmentioning
confidence: 99%
“…The MTSP already presents enough characteristics to represent practical problems, such as school vehicle routing [30]. Bektas [31] presented other examples of practical applications and algorithms for MTSP.…”
Section: Optimization and Vehicle Routing Problemsmentioning
confidence: 99%
“…ii. School bus routing problem: (Angel et al, 1972) investigated the problem of scheduling buses as a variation of the mTSP with some side constraints. The objective of the scheduling is to obtain a bus loading pattern such that the number of routes is minimized, the total distance travelled by all buses is kept at minimum, no bus is overloaded and the time required to traverse any route does not exceed a maximum allowed policy.…”
Section: Main Applicationsmentioning
confidence: 99%
“…Angel et al [1] put forward the concept of "clustering structure after the first path" for the school bus routing problem without mixed load, and construct the vehicle routing. Euchi et al [2] consider how to decide the school bus arrive the student stop, take the minimum distance of vehicle into a target, and study the city school bus routing problem in Tunisian city with the variable neighborhood search algorithm and ant colony optimization.…”
Section: Introductionmentioning
confidence: 99%