A branch-and-price approach for trip sequence planning of high-speed train units

Gao, Yuan; Schmidt, Marie; Yang, Lixing; Gao, Ziyou

doi:10.1016/j.omega.2019.102150

Cited by 15 publications

(2 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [14], a mixed-integer programming model was constructed for the rolling stock scheduling problem considering the maintenance requirements; the model was solved using the commercial solver Cplex. In [15], a comparative analysis of two Mul-CFP modeling methods, the arc-based model and the path-based model, was conducted, and the two models were solved with the commercial Gurobi solver and the branch-price method, respectively. The path-based model was found to be more applicable to large-scale railway networks.…”

Section: Literature Reviewmentioning

confidence: 99%

Integrated Optimization of Rolling Stock Scheduling and Flexible Train Formation Based on Passenger Demand for an Intercity High-Speed Railway

Zhao

Han

et al. 2022

Sustainability

View full text Add to dashboard Cite

The key features of an intercity high-speed railway (IHSR) include its high frequency, the short intervals, and the short distances covered. The mode of rolling stock scheduling generally uses fixed segments. In view of the fact that intercity passenger demand has the characteristics of large fluctuations in terms of time and direction, the use of the traditional rolling stock scheduling plan with a fixed train formation will result in a mismatch between the train formation and passenger demand. In order to improve the matching of train formation and passenger demand and increase the utilization rate of rolling stocks, this paper puts forward the concept of flexible train formation by time period and constructs an integrated optimization model of the rolling stock scheduling and flexible train formation based on passenger demand. The model aims at minimizing the number of rolling stocks, the amount of coupling/decoupling necessary, and the deadhead time. The model takes into account constraints such as the connection method used, the source and destination of the rolling stock, the total amount of rolling stock, and the use of a flexible train formation. In addition, the Gurobi solver is used to accurately solve the problem through the linearization of the model. This paper also provides an example of the Beijing–Tianjin IHSR as a verification of the feasibility and effectiveness of the proposed model. The example compares the indicators in the fixed and flexible train formation modes. The results of the research show that, on the premise of meeting passenger demand, the flexible train formation mode can reduce the cost of rolling stock; increase the efficiency of rolling stock; improve the balance of rolling stock scheduling; and, consequently, provide a reference for the optimization of rolling stock scheduling plan with the background of “cost reduction and efficiency increase” in the railway industry.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Integrated Optimization of Rolling Stock Scheduling and Flexible Train Formation Based on Passenger Demand for an Intercity High-Speed Railway

Zhao

Han

et al. 2022

Sustainability

View full text Add to dashboard Cite

show abstract

“…In public transport, the total travel time is usually limited (such as the route to the airport or railway station). Other applications appear in aircraft management system [19,11,17,7], railway management [9,20,15], the optimal path planning for robots [12,25]. In network communication, the equipment can be placed in the network to supplement the signal [4,34].…”

mentioning

confidence: 99%

A Directional Heuristics Pulse Algorithm for a Two Resources Constrained Shortest Path Problem with Reinitialization

Zeng¹,

Chen²

2023

JIMO

View full text Add to dashboard Cite

<p style='text-indent:20px;'>In this paper, the path planning problem of UAV flight error correction is studied, and a mixed-integer linear programming (MILP) model is proposed to solve the resource constrained shortest path problem (RCSPP-R) with reinitialization, and its resource accumulation can be reinitialized to zero at the reset node. Since RCSPP-R is a NP-hard problem, Pulse algorithm is used to solve the proposed model. Aiming at the high computational cost of pulse algorithm, three pruning strategies are proposed to improve the effectiveness and efficiency of the algorithm, namely, preprocessing strategy based on direction constraint to reduce the search space, dynamic relaxation strategy to improve the quality of boundary, and heuristic search strategy to optimize the node expansion sequence. Then the time-consuming of the algorithm and the number of dominant solutions are used as evaluation indexes for comparison. Numerical results show that the proposed algorithm can deal with this problem more reliably. Specifically, compared with the Label Correction algorithm, the original Pulse algorithm and the Ant Colony algorithm, there are advantages in the number of superior solutions, and compared with the above three algorithms, the time consumption is reduced by 31.64%, 88.52% and 83.5% respectively.</p>

show abstract

Integrated optimization of sequential processes: General analysis and application to public transport

Schiewe

Schöbel

2022

EURO Journal on Transportation and Logistics

View full text Add to dashboard Cite

A branch-and-price approach for trip sequence planning of high-speed train units

Cited by 15 publications

References 29 publications

Integrated Optimization of Rolling Stock Scheduling and Flexible Train Formation Based on Passenger Demand for an Intercity High-Speed Railway

Integrated Optimization of Rolling Stock Scheduling and Flexible Train Formation Based on Passenger Demand for an Intercity High-Speed Railway

A Directional Heuristics Pulse Algorithm for a Two Resources Constrained Shortest Path Problem with Reinitialization

Integrated optimization of sequential processes: General analysis and application to public transport

Contact Info

Product

Resources

About