The scheduling of vehicle movement activities is an important component in highspeed railway transit operations planning process. This paper presents a mathematical programming approach to vehicle routing for the Pennsylvania Transrapid Maglev Train System. A mathematical model of the routing procedure is first derived. Based on this model, the vehicle routing problem is formulated into a constrained optimization problem, in which the train miles travelled are maximized subject to various operational and safety requirements. This large scale non-linear optimization problem is then solved by a genetic algorithm.
Routing for the Pennsylvania Maglev system by a genetic algorithm
2006-01-01
13 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Routing for the Pennsylvania Maglev system by a genetic algorithm
Online Contents | 2006
|Routing for the Pennsylvania Maglev system by a genetic algorithm
Online Contents | 2006
|Routing for the Pennsylvania Maglev system by a genetic algorithm
SAGE Publications | 2006
|Routing for the Pennsylvania Maglev system by a genetic algorithm
British Library Online Contents | 2006
|