scholarly journals Finding nonlinear system equations and complex network structures from data: A sparse optimization approach

2021 ◽  
Vol 31 (8) ◽  
pp. 082101 ◽  
Author(s):  
Ying-Cheng Lai
Author(s):  
Ivan Zelinka ◽  
Donald Davendra ◽  
Jouni Lampinen ◽  
Roman Senkerik ◽  
Michal Pluhacek

2018 ◽  
Vol 2018 ◽  
pp. 1-19 ◽  
Author(s):  
Ziyan Luo ◽  
Xiaoyu Li ◽  
Naihua Xiu

In this paper, we propose a sparse optimization approach to maximize the utilization of regenerative energy produced by braking trains for energy-efficient timetabling in metro railway systems. By introducing the cardinality function and the square of the Euclidean norm function as the objective function, the resulting sparse optimization model can characterize the utilization of the regenerative energy appropriately. A two-stage alternating direction method of multipliers is designed to efficiently solve the convex relaxation counterpart of the original NP-hard problem and then to produce an energy-efficient timetable of trains. The resulting approach is applied to Beijing Metro Yizhuang Line with different instances of service for case study. Comparison with the existing two-step linear program approach is also conducted which illustrates the effectiveness of our proposed sparse optimization model in terms of the energy saving rate and the efficiency of our numerical optimization algorithm in terms of computational time.


2021 ◽  
Author(s):  
Georgy Grebenyuk ◽  
Nikolay Lubkov ◽  
Alexander Roschin ◽  
Leonid Sereda

Sign in / Sign up

Export Citation Format

Share Document