Yunyi Liang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Yunyi Liang has a total of 42 co-authors. Here are the top co-authors by number of shared publications:
- Zhizhou Wu
School of Traffic and Transportation Engineering, Xinjiang University, Urumqi, China
12 shared publications - Yinhai Wang
University of Washington
6 shared publications - Jinjun Tang
Smart Transport Key Laboratory of Hunan Province, School of Traffic and Transportation Engineering, Central South University, Changsha 410075, China
4 shared publications Zhizhou Wu
The Key Laboratory of Road and Traffic Engineering, Ministry of Education, Tongji University, Shanghai, China
4 shared publications- Constantinos Antoniou
Transportation Systems Engineering, Technical University of Munich, Germany
2 shared publications Yining Ren
The Key Laboratory of Road and Traffic Engineering, Ministry of Education, Tongji University, Shanghai, China
2 shared publications
Latest Publications
- 30 October 2026
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 82 (16) , 819
Integrated task scheduling and bandwidth allocation for vehicle-infrastructure collaborative perception considering subchannel assignment
- 30 October 2026
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 82 (16) , 819
Integrated task scheduling and bandwidth allocation for vehicle-infrastructure collaborative perception considering subchannel assignment
- 1 January 2026
- Published by Canadian Science Publishing in Canadian Journal of Civil Engineering
- Vol. 53, 1-14
Integrated optimization of metro and bridging bus operation under metro disruption
Existing studies on integrated optimization of metro and bridging bus operation under metro disruption often overlook the joint optimization of the train timetables and rolling stock circulations (i.e., the selections of turnaround stations, service cancellations, and service connections), as well as the routes and timetables of bridging buses. To address this gap, this study formulates the problem as a mixed-integer linear program. This program aims to minimize the total cost, including the cost of train timetable deviation before and after adjustment, the cost of the number of train service cancellations, the cost of the headway deviations of train services, the cost of the average passenger delay, and the cost of bridging bus operation time. An enhanced Adaptive Large Neighbor Search Algorithm is developed to solve the model. Three customized destroy operators and repair operators are designed to rapidly find high-quality solutions. Experiment results on Metro Line 1 in Urumqi demonstrate that the proposed model achieves 13.83% improvement compared with the model separately optimizes metro and bridging bus operation.
- 1 January 2026
- Published by Canadian Science Publishing in Canadian Journal of Civil Engineering
- Vol. 53, 1-14
Integrated optimization of metro and bridging bus operation under metro disruption
Existing studies on integrated optimization of metro and bridging bus operation under metro disruption often overlook the joint optimization of the train timetables and rolling stock circulations (i.e., the selections of turnaround stations, service cancellations, and service connections), as well as the routes and timetables of bridging buses. To address this gap, this study formulates the problem as a mixed-integer linear program. This program aims to minimize the total cost, including the cost of train timetable deviation before and after adjustment, the cost of the number of train service cancellations, the cost of the headway deviations of train services, the cost of the average passenger delay, and the cost of bridging bus operation time. An enhanced Adaptive Large Neighbor Search Algorithm is developed to solve the model. Three customized destroy operators and repair operators are designed to rapidly find high-quality solutions. Experiment results on Metro Line 1 in Urumqi demonstrate that the proposed model achieves 13.83% improvement compared with the model separately optimizes metro and bridging bus operation.
- Open Access
- 4 October 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (19) , 10715
Influence of Driver Factors on On-Street Parking Choice: Evidence from a Hybrid SP–RP Survey with Binary Logistic Analysis
This study investigates the influence of driver-related factors on on-street parking choice by integrating stated preference (SP) and revealed preference (RP) survey methods. A hybrid SP–RP survey was designed to simulate realistic parking scenarios, and 423 valid questionnaires were collected online and offline. Key factors affecting parking choice were identified through descriptive analysis, including user acceptance of differentiated pricing and satisfaction with existing policies. The Kaiser–Meyer–Olkin (KMO = 0.904) and Bartlett’s test (p < 0.001) confirmed data suitability for factor analysis. A binary logistic regression model was developed to quantify variable effects under different travel purposes. Key findings include the following: monthly parking fee had the strongest effect (OR = 6.691, p = 0.010) on parking choice for shopping/entertainment trips; model prediction accuracy ranged from 80.87% to 83.56% across travel purposes; and goodness-of-fit metrics were strong (McFadden R2 = 0.630, Nagelkerke R2 = 0.772). The results provide empirical evidence on parking choice determinants and support the design of demand-responsive parking policies through dynamic and differentiated pricing strategies.
- 4 October 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (19) , 10715
Open AccessInfluence of Driver Factors on On-Street Parking Choice: Evidence from a Hybrid SP–RP Survey with Binary Logistic Analysis
This study investigates the influence of driver-related factors on on-street parking choice by integrating stated preference (SP) and revealed preference (RP) survey methods. A hybrid SP–RP survey was designed to simulate realistic parking scenarios, and 423 valid questionnaires were collected online and offline. Key factors affecting parking choice were identified through descriptive analysis, including user acceptance of differentiated pricing and satisfaction with existing policies. The Kaiser–Meyer–Olkin (KMO = 0.904) and Bartlett’s test (p < 0.001) confirmed data suitability for factor analysis. A binary logistic regression model was developed to quantify variable effects under different travel purposes. Key findings include the following: monthly parking fee had the strongest effect (OR = 6.691, p = 0.010) on parking choice for shopping/entertainment trips; model prediction accuracy ranged from 80.87% to 83.56% across travel purposes; and goodness-of-fit metrics were strong (McFadden R2 = 0.630, Nagelkerke R2 = 0.772). The results provide empirical evidence on parking choice determinants and support the design of demand-responsive parking policies through dynamic and differentiated pricing strategies.
- 10 July 2025
- Published by Springer Nature in Peer-to-Peer Networking and Applications
- Vol. 18 (4) , 1-15
Joint optimization of roadside unit deployment and connected vehicle routing for emergency information propagation
- 10 July 2025
- Published by Springer Nature in Peer-to-Peer Networking and Applications
- Vol. 18 (4) , 1-15
Joint optimization of roadside unit deployment and connected vehicle routing for emergency information propagation
- 9 June 2025
- Published by Springer Nature in Signal, Image and Video Processing
- Vol. 19 (9) , 1-12
Point cloud processing under adverse weather: a survey of datasets, enhancement, and denoising methods
- 9 June 2025
- Published by Springer Nature in Signal, Image and Video Processing
- Vol. 19 (9) , 1-12
Point cloud processing under adverse weather: a survey of datasets, enhancement, and denoising methods
- 9 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 26 (7) , 9263-9276
Joint Optimization of Transit Network Design, Timetable, and Passenger Assignment With Exact Transfer Behavior Modeling
This study investigates the problem of joint optimization of transit network design, timetable, and passenger assignment with exact transfer behavior modeling. The problem is formulated as a bi-level mixed-integer bilinear program to capture passengers’ realistic path choice behavior. The upper-level model aims to minimize the weighted sum of the cost of bus route construction, bus route operation, bus station construction, travel time of passengers, the delay caused by failures in aboarding to the bus trips at the origin, the delay caused by failures in transfer between the bus trips, and the overflow delay when the bus trip operates at capacity. The lower-level model aims to minimize the travel time of passengers. The travel time of passengers is formulated as the sum of the waiting time for boarding, the transfer time, and the in-vehicle travel time. The passenger transfer time and the delay caused by failures in transfer between the bus trips are formulated with exact modeling of passenger transfer behavior. This bi-level mixed-integer bilinear program is transformed into an equivalent mixed-integer bilinear program with equilibrium constraints using Karush-Kuhn-Tucker conditions. To seek a solution of good quality to the proposed model while not requiring a large amount of computer memory, a Benders decomposition algorithm integrated with piecewise linearization is developed. A numerical application demonstrates that the proposed model is able to achieve 3.49% lower total cost than the baseline model assuming passenger transfer time to be half of the headway.
- 9 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 26 (7) , 9263-9276
Joint Optimization of Transit Network Design, Timetable, and Passenger Assignment With Exact Transfer Behavior Modeling
This study investigates the problem of joint optimization of transit network design, timetable, and passenger assignment with exact transfer behavior modeling. The problem is formulated as a bi-level mixed-integer bilinear program to capture passengers’ realistic path choice behavior. The upper-level model aims to minimize the weighted sum of the cost of bus route construction, bus route operation, bus station construction, travel time of passengers, the delay caused by failures in aboarding to the bus trips at the origin, the delay caused by failures in transfer between the bus trips, and the overflow delay when the bus trip operates at capacity. The lower-level model aims to minimize the travel time of passengers. The travel time of passengers is formulated as the sum of the waiting time for boarding, the transfer time, and the in-vehicle travel time. The passenger transfer time and the delay caused by failures in transfer between the bus trips are formulated with exact modeling of passenger transfer behavior. This bi-level mixed-integer bilinear program is transformed into an equivalent mixed-integer bilinear program with equilibrium constraints using Karush-Kuhn-Tucker conditions. To seek a solution of good quality to the proposed model while not requiring a large amount of computer memory, a Benders decomposition algorithm integrated with piecewise linearization is developed. A numerical application demonstrates that the proposed model is able to achieve 3.49% lower total cost than the baseline model assuming passenger transfer time to be half of the headway.
- 2 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 26 (7) , 9867-9881
Road Side Unit Location Optimization Considering Communication Channel Competition and 6G Technology
This study investigates the problem of road side unit (RSU) location optimization considering vehicle-to-RSU (V2R) communication channel competition. To hedge against the uncertainty of vehicle density, the problem is formulated as a stochastic mixed-integer nonlinear program with equilibrium constraints. This program aims to minimize the expectation of weighted sum of V2R communication delay, packet loss rate and packet collision rate and age of information in V2R communication over all scenarios given RSU location budget limit. Decision variables are RSU locations and the number of connected autonomous vehicles (CAVs) communicating with each located RSU. Equilibrium constraints in the program model V2R communication channel competition among CAVs and ensures the choice of CAVs on RSUs to satisfy user equilibrium principle. The V2R communication is calculated under 6G technology. The program is linearized by using piecewise linearization method. To enhance the solution efficiency, a progressive hedging algorithm is developed to decompose the relaxed linearized model into several subproblems. The optimal solution to the relaxed linearized model is found by iteratively formulating and the solving subproblems. A branch and bound algorithm is introduced to obtain the optimal integer solution to the linearized model. The numerical results show that the proposed model can achieve 20.55% lower total communication delay than the state-of-the-art model only optimizing total V2R information propagation delay, when CAVs choose RSUs for communication in a competitive manner.
- 2 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 26 (7) , 9867-9881
Road Side Unit Location Optimization Considering Communication Channel Competition and 6G Technology
This study investigates the problem of road side unit (RSU) location optimization considering vehicle-to-RSU (V2R) communication channel competition. To hedge against the uncertainty of vehicle density, the problem is formulated as a stochastic mixed-integer nonlinear program with equilibrium constraints. This program aims to minimize the expectation of weighted sum of V2R communication delay, packet loss rate and packet collision rate and age of information in V2R communication over all scenarios given RSU location budget limit. Decision variables are RSU locations and the number of connected autonomous vehicles (CAVs) communicating with each located RSU. Equilibrium constraints in the program model V2R communication channel competition among CAVs and ensures the choice of CAVs on RSUs to satisfy user equilibrium principle. The V2R communication is calculated under 6G technology. The program is linearized by using piecewise linearization method. To enhance the solution efficiency, a progressive hedging algorithm is developed to decompose the relaxed linearized model into several subproblems. The optimal solution to the relaxed linearized model is found by iteratively formulating and the solving subproblems. A branch and bound algorithm is introduced to obtain the optimal integer solution to the linearized model. The numerical results show that the proposed model can achieve 20.55% lower total communication delay than the state-of-the-art model only optimizing total V2R information propagation delay, when CAVs choose RSUs for communication in a competitive manner.