Mathematical model and algorithm for automatically programming the stage plan of marshalling station

被引:0
|
作者
Wang, Shidong [1 ]
Zheng, Li [1 ]
Zhang, Zhihai [1 ]
Liu, Shucheng [2 ]
机构
[1] Department of Industrial Engineering, Tsinghua University, Beijing 100084, China
[2] Transport Department, Urumchi Railway Bureau, Urumchi 830011, China
来源
关键词
Algorithms - Mathematical models - Planning - Railroad stations - Railroad transportation;
D O I
暂无
中图分类号
学科分类号
摘要
Based on the practical operation flow of marshalling station, the automatic programming for the stage plan can be separated into the automatic programming of flow assignment plan, break-up/formation plan and the utilization plan for arrival/departure line. Mathematical models are built respectively for them and solutions are worked out. Under the precondition of satisfying the requirements for train formations and with the minimum total dwell time of the transfer train unit at the marshalling station as the target, the flow assignment plan model fixes on train flow source for outbound trains from trains on hand and in-bounds at the moment. After the flow assignments for train units and with the minimum total number of delayed trains as the target, break-up/formation plan model determines the break-up/formation sequence of trains. Under the condition of current track configuration and with the maximum number of reception/departure trains as the target, the model of utilization plan for arrival/departure line reasonably arranges the reception/departure of trains scheduled by train diagram. The automatic programming for the stage plan of marshalling station can be realized by rationally linking up the abovementioned three models together. A computer aided decision support system is built by adopting the proposed three models and is being applied at Urumchi West Station.
引用
收藏
页码:120 / 125
相关论文
共 50 条
  • [31] An Iterative Three-Stage Algorithm for the Pre-Marshalling Problem in Container Terminals
    Ren, Zijie
    Zhang, Canrong
    2015 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM), 2015, : 1232 - 1236
  • [32] Comprehensive Optimization Model and Algorithm of Operation Plan for Smart Port Station of Heavy Haul Railway
    Wu Y.-D.
    He S.-W.
    Zhou H.
    Jiaotong Yunshu Xitong Gongcheng Yu Xinxi/Journal of Transportation Systems Engineering and Information Technology, 2023, 23 (06): : 215 - 226
  • [35] A Novel Way to Automatically Plan Cellular Networks Supported by Linear Programming and Cloud Computing
    Godinho, Andre
    Fernandes, Daniel
    Soares, Gabriela
    Pina, Paulo
    Sebastiao, Pedro
    Correia, Americo
    Ferreira, Lucio S.
    APPLIED SCIENCES-BASEL, 2020, 10 (09):
  • [36] A mathematical programming approach to the Kernel Fisher algorithm
    Mika, S
    Rätsch, G
    Müller, KR
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 13, 2001, 13 : 591 - 597
  • [37] IMPROVED DIRECT SEARCH MATHEMATICAL PROGRAMMING ALGORITHM
    PAPPAS, M
    MORADI, JY
    JOURNAL OF ENGINEERING FOR INDUSTRY-TRANSACTIONS OF THE ASME, 1975, 97 (04): : 1305 - 1310
  • [38] METHODOLOGY FOR ALGORITHM COMPARISON IN MATHEMATICAL PROGRAMMING.
    Shayan, M.E.
    International Journal on Policy and Information, 1987, 11 (01): : 59 - 65
  • [39] AN ALGORITHM FOR SOLVING MATHEMATICAL-PROGRAMMING PROBLEMS
    FEDORENKO, RP
    USSR COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 1982, 22 (06): : 50 - 62
  • [40] IMPROVED DIRECT SEARCH MATHEMATICAL PROGRAMMING ALGORITHM
    PAPPAS, M
    MORADI, JY
    MECHANICAL ENGINEERING, 1975, 97 (12) : 97 - 97