An optimization to schedule train operations with phase-regular framework for intercity rail lines (Q1925511): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2012/549374 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2099135755 / rank
 
Normal rank

Revision as of 20:35, 19 March 2024

scientific article
Language Label Description Also known as
English
An optimization to schedule train operations with phase-regular framework for intercity rail lines
scientific article

    Statements

    An optimization to schedule train operations with phase-regular framework for intercity rail lines (English)
    0 references
    0 references
    0 references
    18 December 2012
    0 references
    Summary: The most important operating problem for intercity rail lines, which are characterized with the train operations at rapid speed and high frequency, is to design a service-oriented schedule with the minimum cost. This paper proposes a phase-regular scheduling method which divides a day equally into several time blocks and applies a regular train-departing interval and the same train length for each period under the period-dependent demand conditions. A nonlinear mixed zero-one programming model, which could accurately calculate the passenger waiting time and the in-train crowded cost, is developed in this study. A hybrid genetic algorithm associated with the layered crossover and mutation operation is carefully designed to solve the proposed model. Finally, the effectiveness of the proposed model and algorithm is illustrated through the application to Hefei-Wuhan intercity rail line in China.
    0 references
    intercity rail lines
    0 references
    service-oriented schedule
    0 references
    nonlinear mixed zero-one programming model
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references