The Holding Problem at Multiple Holding Stations
The Holding Problem at Multiple Holding Stations
- New search for: Sun, Aichong
- New search for: Hickman, Mark
- New search for: Hickman, Mark
- New search for: Mirchandani, Pitu
- New search for: Voß, Stefan
- New search for: Sun, Aichong
- New search for: Hickman, Mark
Inherent stochasticity within the transit operating environment suggests there may be benefits of holding vehicles at more than one holding station on a route. In this paper, the holding problem at multiple holding stations considers holding vehicles at a given subset of stations on the route. By approximating the vehicle dwell time as the passenger boarding time, the holding problem at multiple holding stations can be modeled as a convex quadratic programming problem, with the objective function as a convex quadratic function subject to many linear constraints. This particular problem can be solved by a heuristic that decomposes the overall problem into sub-problems which can be solved to optimality. Also, a hypothetical numerical example is presented to illustrate the effectiveness of the problem formulation and heuristic.
Document information
The Holding Problem at Multiple Holding Stations
2008-01-01
21 pages
Article/Chapter (Book)
Electronic Resource
English
Similar titles
ARTICLE HOLDING SYSTEM, ARTICLE HOLDING DEVICE, AND ARTICLE HOLDING METHOD
| European Patent Office | 2017