A Two-step Method to Solve the Motor Train-Set Circulation Problem

被引:0
|
作者
Zhou, Yu [1 ]
Zhou, Leishan [1 ]
Bai, Zixi [1 ]
Wang, Yun [1 ]
机构
[1] Beijing Jiaotong Univ, Sch Traff & Transportat, Beijing 100044, Peoples R China
来源
关键词
Train-set scheduling; circulation plan; the Hungarian algorithm; path exchange;
D O I
10.4028/www.scientific.net/AMM.505-506.820
中图分类号
TU [建筑科学];
学科分类号
0813 ;
摘要
This paper deals with the optimization problem of motor train-set in dedicated passenger line, a motor train-set operational model was proposed and maintenance constraint was considered. To solve this model and utilize the motor train-set efficiently, we described a two-step method and the problem was divided into two sub-problems: one is to make sub-routings and another is to combine these sub-routings to new circulations. First step the Hungarian algorithm was used to get circulations of the motor train-set without considering maintenance constraint and the circulations will be divided into several sub-routings by the constraint of maintenance. In order to utilize the motor train-set more balanced, the second step is to combine these sub-routing to new circulations by path exchange rules. This approach was evaluated on the Jing-Hu Passenger Dedicated Line, the computational results show that this new method is feasible and we provide a new idea to solve such problems.
引用
收藏
页码:820 / 826
页数:7
相关论文
共 50 条
  • [1] Application of Particle Swarm Algorithm in Train-Set Circulation Problem of China
    Li, Hua
    Han, Baoming
    Lu, Fang
    Li, Xiaojuan
    SUSTAINABLE DEVELOPMENT OF URBAN INFRASTRUCTURE, PTS 1-3, 2013, 253-255 : 1235 - 1240
  • [2] Integration of Train-Set Circulation and Adding Train Paths Problem Based on an Existing Cyclic Timetable
    Tan, Yu-Yan
    Jiang, Zhi-Bin
    Li, Ya-Xuan
    Wang, Ru-Xin
    IEEE ACCESS, 2020, 8 : 87142 - 87163
  • [3] Railway Timetable Rescheduling Based on the Feedback of Train-set Circulation
    Xie, Meiquan
    Li, Xiamiao
    8TH INTERNATIONAL CONFERENCE ON TRAFFIC AND TRANSPORTATION STUDIES (ICTTS), 2012, 43 : 781 - 789
  • [4] Application of Multiple-Population Genetic Algorithm in Optimizing the Train-Set Circulation Plan Problem
    Zhou, Yu
    Zhou, Leishan
    Wang, Yun
    Yang, Zhuo
    Wu, Jiawei
    COMPLEXITY, 2017,
  • [5] Optimization of the Electric Multiple Units Circulation Plan with the Minimum Number of Train-Set
    Lin B.
    Shen Y.
    Zhong W.
    Wang Z.
    Guo Q.
    Zhongguo Tiedao Kexue/China Railway Science, 2023, 44 (05): : 210 - 221
  • [6] Two-step genetic algorithm to solve the inverse problem in electrocardiography for cardiac sources
    Rincon, Alejandro Lopez
    Bendahmane, Mostafa
    Ainseba, Bedreddine
    COMPUTER METHODS IN BIOMECHANICS AND BIOMEDICAL ENGINEERING-IMAGING AND VISUALIZATION, 2014, 2 (03): : 129 - 137
  • [7] Experimentation with two-step Adomian decomposition method to solve evolution models
    Department of Mathematics, Zhijiang College, Zhejiang University of Technology, Hangzhou, 310024, China
    不详
    不详
    Appl Math Comput (New York), 2006, 2 (1495-1502):
  • [8] Optimizing Train-Set Circulation Plan in High-Speed Railway Networks Using Genetic Algorithm
    Wang, Yun
    Zhou, Yu
    Yan, Xuedong
    JOURNAL OF ADVANCED TRANSPORTATION, 2019, 2019
  • [9] A FAST CONVERGENT TWO-STEP ITERATIVE METHOD TO SOLVE THE ABSOLUTE VALUE EQUATION
    Esmaeili, Hamid
    Mirzapour, Mahdi
    Mahmoodabadi, Ebrahim
    UNIVERSITY POLITEHNICA OF BUCHAREST SCIENTIFIC BULLETIN-SERIES A-APPLIED MATHEMATICS AND PHYSICS, 2016, 78 (01): : 25 - U338
  • [10] A two-step improved Newton method to solve convex unconstrained optimization problems
    T. Dehghan Niri
    S. A. Shahzadeh Fazeli
    M. Heydari
    Journal of Applied Mathematics and Computing, 2020, 62 : 37 - 53