Author
Listed:
- Zhu, Songwei
- Wang, Yihui
- D’Ariano, Andrea
- Lu, Shaofeng
- Meng, Lingyun
- Pacciarelli, Dario
Abstract
The utilization of virtual coupling in train operations offers significant potential to increase the railway transport capacity. Different from traditional signaling systems, virtual coupling allows trains to be coupled and decoupled during operation. As a result, train operations under virtual coupling differ fundamentally from those under conventional signaling systems. Therefore, traditional speed trajectory optimization methods used for regular operations are insufficient for the operation of virtually coupled trains. To optimize the speed trajectories under virtual coupling, a mixed integer nonlinear programming model is formulated. This model explicitly represents the different operational states of virtual coupling using binary variables, and there are time window constraints restricting the times of state transitions. The original model is converted into a linear model by a piecewise-linear approach. With the aim of enhancing computational efficiency, a Lagrangian relaxation method is adopted, where the dual problem can be solved efficiently because the safety distance constraints are relaxed. To provide evidence of the proposed method’s effectiveness in coupling and decoupling scenarios, numerical experiments are conducted based on a part of the Beijing-Shanghai high-speed railway. The results show that our model effectively optimizes the speed trajectories for virtually coupled trains while satisfying safety distance and time window constraints. In the coupling scenario with two trains, compared with using CPLEX directly, the speed trajectories obtained by LR have smaller energy consumption and larger train distance. The total objective function obtained by LR is 1.05 % lower. Moreover, in some cases with the coupling process where the direct method cannot find any feasible solution, LR can solve the problem within the same computational time limit, demonstrating that LR significantly improves computational efficiency in coupling scenarios.
Suggested Citation
Zhu, Songwei & Wang, Yihui & D’Ariano, Andrea & Lu, Shaofeng & Meng, Lingyun & Pacciarelli, Dario, 2026.
"Lagrangian relaxation based speed trajectory optimization for multiple trains under virtual coupling with operational state transition,"
Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 205(C).
Handle:
RePEc:eee:transe:v:205:y:2026:i:c:s136655452500496x
DOI: 10.1016/j.tre.2025.104488
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transe:v:205:y:2026:i:c:s136655452500496x. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.