• DocumentCode
    2672253
  • Title

    Optimal model and algorithm of passenger train plan

  • Author

    Lianbo, Deng

  • Author_Institution
    Traffic & Transp. Eng. Sch., Central South Univ., Changsha
  • fYear
    2008
  • fDate
    16-18 July 2008
  • Firstpage
    613
  • Lastpage
    616
  • Abstract
    Based on current researches on passenger train plan, the correlated costs of passenger train plan and optimal objectives were analyzed. Through balancing the interest of the railway corporation and the passengerspsila demand, combining passenger train plan with the passenger transfer plan and considering the flow assignment on the railway passenger transfer network as lower project, the bi-level programming model was built up. Through summing up and refining the experience and integrating a series of sub-problems, such as the passenger routing, designing the railway passenger transfer network, the flow assignment of passenger transferring, arranging the stop-stations, analyzing the passenger train plan evaluation indexes, the optimal algorithm based on the simulated annealing algorithm was designed. On the basis of the model and the algorithm above, the optimal software of passenger train plan is developed. The software has been applied to some dedicated passenger traffic line with good results and efficiency.
  • Keywords
    rail traffic; simulated annealing; bi-level programming model; flow assignment; optimal software; passenger routing; passenger train plan; passenger transfer plan; railway corporation; simulated annealing algorithm; Algorithm design and analysis; Centralized control; Costs; Frequency; Laboratories; Optimal control; Rail transportation; Railway engineering; Simulated annealing; Traffic control; Bi-level programming; Multi-class user equilibrium; Passenger train plan; Simulated annealing algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Control Conference, 2008. CCC 2008. 27th Chinese
  • Conference_Location
    Kunming
  • Print_ISBN
    978-7-900719-70-6
  • Electronic_ISBN
    978-7-900719-70-6
  • Type

    conf

  • DOI
    10.1109/CHICC.2008.4605864
  • Filename
    4605864