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 条
  • [41] DEVELOPMENT OF A COMPREHENSIVE LAND-USE PLAN BY MEANS OF A MULTIPLE OBJECTIVE MATHEMATICAL-PROGRAMMING MODEL
    BAMMI, D
    BAMMI, D
    INTERFACES, 1979, 9 (02) : 50 - 63
  • [42] REPLACING A KINETIC MODEL WITH A MATHEMATICAL PROGRAMMING MODEL
    BIGELOW, JH
    BIOMETRICS, 1972, 28 (01) : 258 - &
  • [43] DYNAMIC PROGRAMMING BASED ALGORITHM FOR COMPRESSOR STATION OPTIMIZATION
    Zhang, Xiaorui
    Wu, Changchun
    Zuo, Lili
    Meng, Xiangyan
    PROCEEDINGS OF THE ASME INTERNATIONAL MECHANICAL ENGINEERING CONGRESS AND EXPOSITION, 2014, VOL 11, 2015,
  • [44] Fuzzy two-stage mathematical programming problems
    Wang, SH
    Liu, YK
    2003 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-5, PROCEEDINGS, 2003, : 2638 - 2643
  • [45] Optimization for route selection under the integration of dispatching and control at the railway station: A 0-1 programming model and a two-stage solution algorithm
    Ma, Liang
    Yang, Kun
    Guo, Jin
    Bao, Yuanli
    Wu, Wenqing
    IET INTELLIGENT TRANSPORT SYSTEMS, 2024, 18 (11) : 2124 - 2151
  • [46] Using Mathematical Programming for Signal Plan Design - Some Practical Examples
    Teichmann, Dusan
    Dorda, Michal
    2015 16TH INTERNATIONAL CARPATHIAN CONTROL CONFERENCE (ICCC), 2015, : 537 - 541
  • [47] Mathematical Programming Models for Optimizing Partial-Order Plan Flexibility
    Say, Buser
    Cire, Andre A.
    Beck, J. Christopher
    ECAI 2016: 22ND EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2016, 285 : 1044 - 1052
  • [48] Scheduling Optimization Model and Algorithm Design for Two-way Marshalling Train
    Yao Qingyang
    Yuan Xiaoyun
    2015 INTERNATIONAL CONFERENCE ON INTELLIGENT TRANSPORTATION, BIG DATA AND SMART CITY (ICITBS), 2016, : 705 - 708
  • [49] Iterative algorithm for mathematical programming problems with preconvex constraints
    T. F. Minnibaev
    Yu. A. Chernyaev
    Computational Mathematics and Mathematical Physics, 2010, 50 : 792 - 794
  • [50] Macrocell placement algorithm based on mathematical programming technique
    Wang, Kesheng
    Tang, Pushan
    Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics, 2002, 14 (05): : 413 - 416