School bus routes generator in urban surroundings

https://doi.org/10.1016/0305-0548(80)90006-4Get rights and content

Abstract

In this paper, a comprehensive study of the school bus routing problem in an urban surroundings is presented. It complements and extends over previous school bus routing studies. The problem is defined as a multi-stage process where the stops are generated, where the students are assigned to these and where the bus routes are generated. Several suited versions of vehicle routing techniques are analysed and compared. Branch exchange procedures to improve the solutions are also studied. Our numerical experimentation indicates that each problem should be solved several times with different routing techniques, followed by branch exchange procedures, to ensure reliable solutions.

References (18)

  • R.M. Newton et al.

    Design of school bus routes by computer

    Socio-Economic Planning Sci.

    (1969)
  • G. Clarke et al.

    Scheduling of vehicles from a central depot to a number of delivery points

    Ops Res.

    (1964)
  • B. Golden et al.

    Implementing vehicle routing algorithms

    Networks

    (1977)
  • P.C. Yellow

    A Computational Modification to the Savings Method of Vehicle Scheduling

    Ops Res. Quart.

    (1970)
  • D. Rosenkrantz et al.

    Approximate algorithms for the travelling salesperson problem

  • B.E. Gillet et al.

    A heuristic algorithm for the vehicle-dispatch problem

    Ops Res.

    (1974)
  • S. Lin

    Computer solutions of the travelling-salesman problem

    Bell System Tech. J.

    (1965)
  • L. Bodin and L. Berman, Routing and Scheduling of School Buses by Computer, presented at Fall 1974 ORSA Meeting in San...
  • N. Christofides et al.

    The optimum location of multi-centers on a graph

    Ops Res. Quart.

    (1971)
There are more references available in the full text version of this article.

Cited by (49)

  • A unifying framework for selective routing problems

    2024, European Journal of Operational Research
  • Integration of efficient multi-objective ant-colony and a heuristic method to solve a novel multi-objective mixed load school bus routing model

    2018, Applied Soft Computing Journal
    Citation Excerpt :

    Maximum riding time [28,29]. School time window [30]. Maximum walking time or distance [16].

  • A multi-loading school bus routing problem

    2018, Expert Systems with Applications
View all citing articles on Scopus

This research was supported by a grant from the Transportation Development and Research Agency of Canada and by a F.C.A.C. grant from the Education Ministry of the Province of Quebec.

Gilles Dulac is working at BELL CANADA headquarters, Montreal, P.Q. He graduated from University of Montreal in 1978 with the degree of M.Sc. (INFORMATIQUE) and from McGill University in 1976 with the degree of B.Com (Major in Mathematics). He has seven years experience in banking and finance and a few years in computer programming and systems development. His present occupational interests are concerned with solving large scale (0–1) mathematical programming problems on the computer.

§

During his studies he worked for a college data processing center where he developed a student information system and a student scheduling system. After graduation he entered the data processing center of the Quebec Ministry of Education where he is now in charge of the development and implementation of a school bus transportation and student districting system to be used throughout Quebec's school boards. This system is planned to use the school bus routing and scheduling components developed by the University of Montreal, to which he contributed during his graduate studies.

View full text