Routing optimization for school bus problem

Qiang Guo, Yuk On Li, Yaohuang Guo

Research output: Journal article publicationJournal articleAcademic researchpeer-review

4 Citations (Scopus)

Abstract

A multi-objective nonlinear integer programming model was proposed to study the school bus problem. In the model, there are five objectives; to minimize the number of buses, to minimize total travel time of buses, to minimize total travel time spent by all children, to balance the loads among buses and to balance the travel time among buses, the objectives are sorted into four levels. A new heuristic optimization algorithm for solving the problem was presented. The algorithm starts with generating a minimum spanning tree to find basic routes, and then selects an adjustable unit to modify and determine the final routes. Further adjustment on the routes after the routes have been set is allowable if it follows some presented rules.
Original languageEnglish
Pages (from-to)486-490
Number of pages5
JournalXinan Jiaotong Daxue Xuebao/Journal of Southwest Jiaotong University
Volume41
Issue number4
Publication statusPublished - 1 Aug 2006

Keywords

  • Community
  • Heuristic optimization algorithm
  • Model
  • Multi-objective
  • Optimization
  • School bus problem

ASJC Scopus subject areas

  • General

Fingerprint

Dive into the research topics of 'Routing optimization for school bus problem'. Together they form a unique fingerprint.

Cite this