.png){kind=icon}
Return
A school bus scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2011.11.035.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper introduces a school bus scheduling problem wherein trips for each school are given. A trip consists of a sequence of bus stops and their designated school. Each school has its fixed time window within which trips should be completed. A school bus can serve multiple trips for multiple schools. The school bus scheduling problem seeks to optimize bus schedules to serve all the given trips considering the school time windows. We first model the problem as a vehicle routing problem with time windows (VRPTW) by treating a trip as a virtual stop. Two assignment problem based exact approaches are then proposed for special cases and a heuristic algorithm is proposed for more general cases. Benchmark problems and computational experiments are presented. Computational experiments show the effectiveness of the proposed approaches. (C) 2011 Elsevier B.V. All rights reserved.
Keywords:
Heuristics
School bus routing problem
Bus scheduling problem
Vehicle routing problem
Assignment problem
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available
Cited Papers
Are we “experienced listeners”? A review of the musical capacities that do not depend on formal musical training.png)
Cognition
CognitionIF0
PREAI
ShareSaveShareSaveShareSaveShareSave
View more