logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

AN EXACT ALGORITHM FOR MULTIPLE DEPOT BUS SCHEDULING

delete1994-01-01
delete62
PRE
AI
M
Michael A. Forbes *
J
J. N. Holt
A
A. M. Watts
DOI：10.1016/0377-2217(94)90334-4delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
In this paper we present an exact algorithm for solving the multiple depot bus scheduling problem. The algorithm uses two well known linear programming relaxations of the problem. The first, a pure network flow problem, is used to obtain a dual feasible solution to the second relaxation, a multi-commodity network flow problem, which is solved using dual simplex. Branch and bound is then used to obtain the optimal integer solution. This technique is then used to solve exactly problems much greater than any previously reported technique. Results are presented for problems with up to 600 trips and 3 depots.
Keywords:
VEHICLE SCHEDULING
PROGRAMMING
INTEGER
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

European Journal of Operational Research cover
European Journal of Operational Research
IF:
6
Papers:
2.2W
Citations:
6.4W

Organization

No organization information available