Networked timetable stability improvement based on a bilevel optimization programming model (Q1718056): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2014/290937 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2046606060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing schedule performance and reliability for train stations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic \((\max,+)\) approach for determining railway infrastructure capacity. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysing stability and investments in railway networks using advanced evolutionary algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability evaluation of a railway timetable at station level / rank
 
Normal rank

Latest revision as of 02:19, 18 July 2024

scientific article
Language Label Description Also known as
English
Networked timetable stability improvement based on a bilevel optimization programming model
scientific article

    Statements

    Networked timetable stability improvement based on a bilevel optimization programming model (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    8 February 2019
    0 references
    Summary: Train timetable stability is the possibility to recover the status of the trains to serve as arranged according to the original timetable when the trains are disturbed. To improve the train timetable stability from the network perspective, the bilevel programming model is constructed, in which the upper level programming is to optimize the timetable stability on the network level and the lower is to improve the timetable stability on the dispatching railway segments. Timetable stability on the network level is defined with the variances of the utilization coefficients of the section capacity and station capacity. Weights of stations and sections are decided by the capacity index number and the degrees. The lower level programming focuses on the buffer time distribution plan of the trains operating on the sections and stations, taking the operating rules of the trains as constraints. A novel particle swarm algorithm is proposed and designed for the bilevel programming model. The computing case proves the feasibility of the model and the efficiency of the algorithm. The method outlined in this paper can be embedded in the networked train operation dispatching system.
    0 references

    Identifiers