.png){kind=icon}
返回
A school bus scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2011.11.035.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Heuristics
School bus routing problem
Bus scheduling problem
Vehicle routing problem
Assignment problem
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
Are we “experienced listeners”? A review of the musical capacities that do not depend on formal musical training.png)
Cognition
CognitionIF0
PREAI
分享收藏Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows具有时间窗的多仓库车辆调度问题的动态窗口减少
PREAI
分享收藏
查看更多内容