Yaling Zhou
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
Yaling Zhou has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Chengxuan Cao
State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University, Beijing, People’s Republic of China
3 shared publications - Ziyan Feng
School of Economics and Management, Beijing University of Chemical Technology, Beijing, China
3 shared publications Yutong Liu
State Key Laboratory of Rail Traffic Control and Safety, Beijing JiaoTong University, Beijing 100044, China
2 shared publications
Latest Publications
- Open Access
- 29 October 2021
- Published by MDPI AG in Applied Sciences
- Vol. 11 (21) , 10143
Optimization of Multimodal Discrete Network Design Problems Based on Super Networks
In this paper, we investigate the multimodal discrete network design problem that simultaneously optimizes the car, bus, and rail transit network, in which inter-modal transfers are achieved by slow traffic modes including walking and bike-sharing. Specifically, a super network topology is presented to signify the modal interactions. Then, the generalized cost formulas of each type of links in the super network are defined. And based on the above formulas a bi-objective programming model is proposed to minimize the network operation cost and construction cost with traffic flow equilibrium constraints, investment constraints and expansion constraints. Moreover, a hybrid heuristic algorithm that combines the minimum cost flow algorithm and simulated annealing algorithm is presented to solve the proposed model. Finally, the effectiveness of the proposed model and algorithm is evaluated through two numerical tests: a simple test network and an actual multimodal transport network.
- 29 October 2021
- Published by MDPI AG in Applied Sciences
- Vol. 11 (21) , 10143
Open AccessOptimization of Multimodal Discrete Network Design Problems Based on Super Networks
In this paper, we investigate the multimodal discrete network design problem that simultaneously optimizes the car, bus, and rail transit network, in which inter-modal transfers are achieved by slow traffic modes including walking and bike-sharing. Specifically, a super network topology is presented to signify the modal interactions. Then, the generalized cost formulas of each type of links in the super network are defined. And based on the above formulas a bi-objective programming model is proposed to minimize the network operation cost and construction cost with traffic flow equilibrium constraints, investment constraints and expansion constraints. Moreover, a hybrid heuristic algorithm that combines the minimum cost flow algorithm and simulated annealing algorithm is presented to solve the proposed model. Finally, the effectiveness of the proposed model and algorithm is evaluated through two numerical tests: a simple test network and an actual multimodal transport network.
- Open Access
- 10 March 2020
- Published by Wiley in Journal of Advanced Transportation
- Vol. 2020, 1-22
A Cost and Passenger Responsible Optimization Method for the Operation Plan of Additional High-Speed Trains in a Peak Period
In the peak period of a railway system, operators typically add additional trains to provide increased capacity to satisfy the increasing passenger demand. The paper proposes a new optimization framework for designing the operation plan, which includes the number of additional trains, train type, stop plan, and timetable, for additional trains in a peak period. A space-time network representation is used to obtain a feasible primary operation plan by finding a set of feasible space-time paths in the space-time network. Considering simultaneously the passenger demand and the trains’ total travel times, we formulate a biobjective integer programming model for generating a cost and passenger responsible primary operation plan. A set of loading capacity constraints are formulated in the model to guarantee a suitable loading capacity for each station’s passenger demand and better service for passengers. The CPLEX solver is used to solve the proposed model and to generate the optimal operation plan. Two sets of numerical experiments are conducted on a small-scale rail corridor and on the Wuhan-Guangzhou rail corridor to evaluate the performance of the proposed method. The results of the experiments show that the primary operation plan can be obtained within an acceptable computation time.
- 10 March 2020
- Published by Wiley in Journal of Advanced Transportation
- Vol. 2020, 1-22
Open AccessA Cost and Passenger Responsible Optimization Method for the Operation Plan of Additional High-Speed Trains in a Peak Period
In the peak period of a railway system, operators typically add additional trains to provide increased capacity to satisfy the increasing passenger demand. The paper proposes a new optimization framework for designing the operation plan, which includes the number of additional trains, train type, stop plan, and timetable, for additional trains in a peak period. A space-time network representation is used to obtain a feasible primary operation plan by finding a set of feasible space-time paths in the space-time network. Considering simultaneously the passenger demand and the trains’ total travel times, we formulate a biobjective integer programming model for generating a cost and passenger responsible primary operation plan. A set of loading capacity constraints are formulated in the model to guarantee a suitable loading capacity for each station’s passenger demand and better service for passengers. The CPLEX solver is used to solve the proposed model and to generate the optimal operation plan. Two sets of numerical experiments are conducted on a small-scale rail corridor and on the Wuhan-Guangzhou rail corridor to evaluate the performance of the proposed method. The results of the experiments show that the primary operation plan can be obtained within an acceptable computation time.
- Open Access
- 3 October 2018
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2018, 1-22
A Multiobjective Optimization for Train Routing at the High-Speed Railway Station Based on Tabu Search Algorithm
This paper focuses on the train routing problem at a high-speed railway station to improve the railway station capacity and operational efficiency. We first describe a node-based railway network by defining the turnout node and the arrival-departure line node for the mathematical formulation. Both considering potential collisions of trains and convenience for passengers’ transfer in the station, the train routing problem at a high-speed railway station is formulated as a multiobjective mixed integer nonlinear programming model, which aims to minimize trains’ departure time deviations and total occupation time of all tracks and keep the most balanced utilization of arrival-departure lines. Since massive decision variables for the large-scale real-life train routing problem exist, a fast heuristic algorithm is proposed based on the tabu search to solve it. Two sets of numerical experiments are implemented to demonstrate the rationality and effectiveness of proposed method: the small-scale case confirms the accuracy of the algorithm; the resulting heuristic proved able to obtain excellent solution quality within 254 seconds of computing time on a standard personal computer for the large-scale station involving up to 17 arrival-departure lines and 46 trains.
- 3 October 2018
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2018, 1-22
Open AccessA Multiobjective Optimization for Train Routing at the High-Speed Railway Station Based on Tabu Search Algorithm
This paper focuses on the train routing problem at a high-speed railway station to improve the railway station capacity and operational efficiency. We first describe a node-based railway network by defining the turnout node and the arrival-departure line node for the mathematical formulation. Both considering potential collisions of trains and convenience for passengers’ transfer in the station, the train routing problem at a high-speed railway station is formulated as a multiobjective mixed integer nonlinear programming model, which aims to minimize trains’ departure time deviations and total occupation time of all tracks and keep the most balanced utilization of arrival-departure lines. Since massive decision variables for the large-scale real-life train routing problem exist, a fast heuristic algorithm is proposed based on the tabu search to solve it. Two sets of numerical experiments are implemented to demonstrate the rationality and effectiveness of proposed method: the small-scale case confirms the accuracy of the algorithm; the resulting heuristic proved able to obtain excellent solution quality within 254 seconds of computing time on a standard personal computer for the large-scale station involving up to 17 arrival-departure lines and 46 trains.