鐵路終端車站內列車調度及路徑指派問題之研究
Date Issued
2004
Date
2004
Author(s)
周義華
DOI
922211E002090
Abstract
Train operation planning includes
Time Tabling, Train Routing, Vehicle
Scheduling, and Train Driver
Scheduling. Time Tabling neglects the
detailed layout of the railway network
within the railway stations. Therefore, it
may happen that a timetable is feasible
with respect to the railway network
between the railway stations but turn out
to be infeasible if one also considers the
detailed layout of the railway network
within the railway station. The aim of
Train Routing is to assist the planners in
checking whether a timetable generated
by Time Tabling is feasible with respect
to the routing of the trains through the
railway station.
Most studies of Routing Trains
through railway station considered only
single station or yard. Since the routing
of the trains within the railway yard
influences the routing possibilities for
the terminal station, a simultaneous
determination for the routing of terminal
station and yard may be desirable. At the
prerequisite of minimum train delay and
maximum track usage, we formulate the
problem by “weighted node packing
problem”. This formulation can also be
used on intermediate station through
modification. In order to solve the
problem efficiently, we adopt the genetic
algorithms rather than traditional
optimization algorithm. By providing
this problem-solving procedure, we seek
to reduce the heavy burden of the
planners.
Through the empirical study, it was
found that the solutions solved by
genetic algorithms with heuristic
operators had good qualities. In addition,
to adjust the parameters of the objective
function can also reflect the practical
constraint and demand.
Subjects
鐵路終端車站
列車運行計畫
列車調度
基因演算法
railway terminal station
train operation planning
train routing
genetic algorithms
Publisher
臺北市：國立臺灣大學土木工程學系暨研究所
Type
report
File(s)![Thumbnail Image]()
Loading...
Name
922211E002090.pdf
Size
96.18 KB
Format
Adobe PDF
Checksum
(MD5):5eef407881cf1c2db1fad7d4a9050c54