Wenkai Xu
Research Subjects
Wenkai Xu has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Peng Zhao
School of Traffic and Transportation, Beijing Jiaotong University, Beijing, China
6 shared publications Liqiao Ning
School of Architecture, Harbin Institute of Technology, Shenzhen, Guangdong 518055, China
4 shared publications- Liqiao Ning
School of Traffic and Transportation
4 shared publications Ke Qiao
School of Traffic and Transportation
2 shared publicationsBinglei Xie
School of Architecture, Harbin Institute of Technology, Shenzhen, Guangdong 518055, China
1 shared publicationGe Gao
College of Transportation, Shandong University of Science and Technology, Shandong, China
1 shared publication
Latest Publications
- 11 December 2025
- Published by SAGE Publications in Transportation Research Record: Journal of the Transportation Research Board
- Vol. 2680 (8) , 482-505
Passenger-to-Train Intelligent Matching Model Under Full-Length and Short-Turn Routings Based on Path Calculation from Map Application Programming Interface
Aiming at flexible composition conditions, this paper proposes a passenger-to-train matching method that integrates automated fare collection (AFC) data and full-length and short-turn routing schedules. In the data layer, the method uses an electronic map application programming interface (API) to get path data in different modes to construct a workable path database. The traveling time of the AFC data is then used to match the path in the corresponding mode with the error of the corresponding database to get the passenger’s travel trajectory. In addition, the Passenger-to-Train Intelligent Matching System (T-P IMS) model is constructed based on the exploration of passenger transfer behavior in the microscopic stations of full-length and short-turn routing, and the projections of passengers taking trains are completed based on the train schedule. In this paper, the Behavior Analysis Intelligent Matching (BAIM) algorithm is also designed to realize efficient computation, and a real case study is carried out to count the average waiting time of transferring passengers as well as the train–passenger flow under different modes of operation. The statistical results of the case study show that the path matching effect of this paper is extremely close to the actual situation. The success rate of the model coupling is more than 99%.
- 11 December 2025
- Published by SAGE Publications in Transportation Research Record: Journal of the Transportation Research Board
- Vol. 2680 (8) , 482-505
Passenger-to-Train Intelligent Matching Model Under Full-Length and Short-Turn Routings Based on Path Calculation from Map Application Programming Interface
Aiming at flexible composition conditions, this paper proposes a passenger-to-train matching method that integrates automated fare collection (AFC) data and full-length and short-turn routing schedules. In the data layer, the method uses an electronic map application programming interface (API) to get path data in different modes to construct a workable path database. The traveling time of the AFC data is then used to match the path in the corresponding mode with the error of the corresponding database to get the passenger’s travel trajectory. In addition, the Passenger-to-Train Intelligent Matching System (T-P IMS) model is constructed based on the exploration of passenger transfer behavior in the microscopic stations of full-length and short-turn routing, and the projections of passengers taking trains are completed based on the train schedule. In this paper, the Behavior Analysis Intelligent Matching (BAIM) algorithm is also designed to realize efficient computation, and a real case study is carried out to count the average waiting time of transferring passengers as well as the train–passenger flow under different modes of operation. The statistical results of the case study show that the path matching effect of this paper is extremely close to the actual situation. The success rate of the model coupling is more than 99%.
- Open Access
- 8 August 2023
- Published by SAGE Publications in Measurement and Control
- Vol. 57 (1) , 30-39
Last train timetabling with transfer accessibility in metro networks: integer linear programing model and schedule-based transfer network
Last train timetable plays an important role in actual operation of metro systems, especially in big cities. Appreciable transfer passengers rely on last train connections to reach their destinations, which requires a coordinated last train timetable. This study is devoted to dealing with the last train timetabling problem in metro networks, and proposes an integer linear programing model to coordinate last train connections at transfer stations to improve the transfer accessibility in terms of served transfer passengers and effective last train connections. Several measures at the planning level are used to guarantee feasibility of the optimized last train timetable when applied in practice. Then, the schedule-based transfer network and pre-process method are presented to shrink the scale of binary variables, which can expedite the solution process when solving problems in large-scale networks. Finally, some experiments based on the Qingdao metro network are carried out to verify the effectiveness of the timetabling method, and results show that dwell time and service ending time have direct influence on network accessibility. Comparison analyses show that the proposed model is able to generate a coordinated enough last train timetable with higher transfer accessibility and better practicality, which can provide support for operators to improve the last train service in a metro network.
- 8 August 2023
- Published by SAGE Publications in Measurement and Control
- Vol. 57 (1) , 30-39
Open AccessLast train timetabling with transfer accessibility in metro networks: integer linear programing model and schedule-based transfer network
Last train timetable plays an important role in actual operation of metro systems, especially in big cities. Appreciable transfer passengers rely on last train connections to reach their destinations, which requires a coordinated last train timetable. This study is devoted to dealing with the last train timetabling problem in metro networks, and proposes an integer linear programing model to coordinate last train connections at transfer stations to improve the transfer accessibility in terms of served transfer passengers and effective last train connections. Several measures at the planning level are used to guarantee feasibility of the optimized last train timetable when applied in practice. Then, the schedule-based transfer network and pre-process method are presented to shrink the scale of binary variables, which can expedite the solution process when solving problems in large-scale networks. Finally, some experiments based on the Qingdao metro network are carried out to verify the effectiveness of the timetabling method, and results show that dwell time and service ending time have direct influence on network accessibility. Comparison analyses show that the proposed model is able to generate a coordinated enough last train timetable with higher transfer accessibility and better practicality, which can provide support for operators to improve the last train service in a metro network.
- 23 April 2020
- Published by World Scientific Pub Co Pte Ltd in Modern Physics Letters B
- Vol. 34 (24)
A trade-off method for timetable rescheduling considering transfer connections in subway networks
- 23 April 2020
- Published by World Scientific Pub Co Pte Ltd in Modern Physics Letters B
- Vol. 34 (24)
A trade-off method for timetable rescheduling considering transfer connections in subway networks
- 1 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Transfer synchronization model with elastic headway and valid inequalities
Given that the timetable with even headway is inferior in matching the passenger demand, we use the departure times in even headway situation as the benchmarks, and allow the departure times to change within a limited range to increases the flexibility in timetabling. Then a transfer synchronization model with elastic headway is constructed. By analyzing the specific structure of the model, four classes of valid inequalities are designed to improve the computational efficiency when implementing the branch and cut algorithm in CPLEX. Finally, an experimental case study is conducted and results show that timetabling with elastic headway can effectively improve transfer efficiency, and valid inequalities can strengthen the linear relaxation model and shrink the solution space as well as the number of branch nodes, and then the algorithm can seek the optimal solution faster.
- 1 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Transfer synchronization model with elastic headway and valid inequalities
Given that the timetable with even headway is inferior in matching the passenger demand, we use the departure times in even headway situation as the benchmarks, and allow the departure times to change within a limited range to increases the flexibility in timetabling. Then a transfer synchronization model with elastic headway is constructed. By analyzing the specific structure of the model, four classes of valid inequalities are designed to improve the computational efficiency when implementing the branch and cut algorithm in CPLEX. Finally, an experimental case study is conducted and results show that timetabling with elastic headway can effectively improve transfer efficiency, and valid inequalities can strengthen the linear relaxation model and shrink the solution space as well as the number of branch nodes, and then the algorithm can seek the optimal solution faster.
- Open Access
- 1 October 2018
- Published by Wiley in Journal of Advanced Transportation
- Vol. 2018, 1-16
Transfer Robustness Optimization for Urban Rail Transit Timetables
A good timetable is required to not only be efficient, but also yield effectiveness in preventing and counteracting delays. When travelling via urban rail transit networks, transferring passengers may miss their scheduled connecting train because of a feeder train delay that results in them experiencing increased travel costs. Considering that running time supplements and transfer buffer times yield different effects on the travel plans of transferring and nontransferring passengers, we formulate an expected extra travel cost (EETC) function to appropriately balance efficiency and robustness, which is then implemented in the construction of a robust transfer optimization model with the objective of minimizing the total EETC. Next, to improve the computational efficiency, we propose an approximate linearization approach for the EETC function and introduce two types of binary variables and auxiliary substitution variables to convert the nonlinear model to a mixed-integer linear model. Experimental results show that our proposed method can yield practically applicable solutions with significant reductions in both EETC and probability of missing a transfer.
- 1 October 2018
- Published by Wiley in Journal of Advanced Transportation
- Vol. 2018, 1-16
Open AccessTransfer Robustness Optimization for Urban Rail Transit Timetables
A good timetable is required to not only be efficient, but also yield effectiveness in preventing and counteracting delays. When travelling via urban rail transit networks, transferring passengers may miss their scheduled connecting train because of a feeder train delay that results in them experiencing increased travel costs. Considering that running time supplements and transfer buffer times yield different effects on the travel plans of transferring and nontransferring passengers, we formulate an expected extra travel cost (EETC) function to appropriately balance efficiency and robustness, which is then implemented in the construction of a robust transfer optimization model with the objective of minimizing the total EETC. Next, to improve the computational efficiency, we propose an approximate linearization approach for the EETC function and introduce two types of binary variables and auxiliary substitution variables to convert the nonlinear model to a mixed-integer linear model. Experimental results show that our proposed method can yield practically applicable solutions with significant reductions in both EETC and probability of missing a transfer.
- Open Access
- 3 July 2018
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2018, 1-10
Transfer Coordination for Metro Networks during the Start- or End-of-Service Period
When travelling via metro networks during the start- or end-of-service period, transferring passengers may suffer a transfer failure. Accordingly, the synchronization timetabling problem necessitates consideration of transfer waiting time and transfer availability with respect to the first or last train. Hence, transfer train index (TTI) is formulated to identify the transfer train and calculate the transfer waiting time. Furthermore, two types of connection indexes, the last connection train index (LCTI) and the first connection train index (FCTI), are devised to distinguish transfer failure from transfer success, and the penalty constraints are implemented together to reflect the adverse effects of transfer failure. Then, a mixed integer programming model is developed to concurrently reduce transfer waiting time and improve transfer availability, which can be solved by CPLEX. Finally, a case study on Beijing metro network is made to verify the method. Experimental results show that our proposed model can yield synchronization solutions with significant reductions in both the average transfer waiting time and the proportion of transfer failure passengers.
- 3 July 2018
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2018, 1-10
Open AccessTransfer Coordination for Metro Networks during the Start- or End-of-Service Period
When travelling via metro networks during the start- or end-of-service period, transferring passengers may suffer a transfer failure. Accordingly, the synchronization timetabling problem necessitates consideration of transfer waiting time and transfer availability with respect to the first or last train. Hence, transfer train index (TTI) is formulated to identify the transfer train and calculate the transfer waiting time. Furthermore, two types of connection indexes, the last connection train index (LCTI) and the first connection train index (FCTI), are devised to distinguish transfer failure from transfer success, and the penalty constraints are implemented together to reflect the adverse effects of transfer failure. Then, a mixed integer programming model is developed to concurrently reduce transfer waiting time and improve transfer availability, which can be solved by CPLEX. Finally, a case study on Beijing metro network is made to verify the method. Experimental results show that our proposed model can yield synchronization solutions with significant reductions in both the average transfer waiting time and the proportion of transfer failure passengers.
- 2 July 2018
- Published by American Society of Civil Engineers (ASCE)
- p. 1179-1190
A Passenger-Oriented Model for Timetable Rescheduling during the End-of-Service Period: A Case Study of the Beijing Subway Network
The present paper offers a novel solution to the timetable rescheduling problem of a subway network during the end-of-service period. Based on the complex transfer connections between multiple trains at different lines, we propose a passenger-oriented timetable rescheduling model with the consideration of transfer coordination. On the one hand, we try to maximize the number of successful transfer passengers. On the other hand, we attempt to minimize the average transfer waiting time of successful transfer passengers. As a NP-hard problem, an efficient genetic algorithm is designed to solve the problem of a large-scale and complex network. Finally, a case study of the Beijing subway network is used to verify the proposed method.
- 2 July 2018
- Published by American Society of Civil Engineers (ASCE)
- p. 1179-1190
A Passenger-Oriented Model for Timetable Rescheduling during the End-of-Service Period: A Case Study of the Beijing Subway Network
The present paper offers a novel solution to the timetable rescheduling problem of a subway network during the end-of-service period. Based on the complex transfer connections between multiple trains at different lines, we propose a passenger-oriented timetable rescheduling model with the consideration of transfer coordination. On the one hand, we try to maximize the number of successful transfer passengers. On the other hand, we attempt to minimize the average transfer waiting time of successful transfer passengers. As a NP-hard problem, an efficient genetic algorithm is designed to solve the problem of a large-scale and complex network. Finally, a case study of the Beijing subway network is used to verify the proposed method.
- Open Access
- 27 June 2018
- Published by Wiley in Journal of Advanced Transportation
- Vol. 2018, 1-9
A Practical Method for Timetable Rescheduling in Subway Networks during the End-of-Service Period
This study proposes a biobjective optimization method for timetable rescheduling during the end-of-service period of a subway network, taking all stakeholders’ interests into consideration. We seek to minimize the total transfer waiting time for all transfer passengers, meanwhile minimizing the deviation to the scheduled timetable. The ε-constraint method and linearization techniques are utilized to obtain the approximate Pareto optimal solutions within limited seconds, allowing for figuring out the trade-off between the two objectives. The method is validated by numerical experiments for different delay scenarios based on a real-world case: the Beijing subway network.
- 27 June 2018
- Published by Wiley in Journal of Advanced Transportation
- Vol. 2018, 1-9
Open AccessA Practical Method for Timetable Rescheduling in Subway Networks during the End-of-Service Period
This study proposes a biobjective optimization method for timetable rescheduling during the end-of-service period of a subway network, taking all stakeholders’ interests into consideration. We seek to minimize the total transfer waiting time for all transfer passengers, meanwhile minimizing the deviation to the scheduled timetable. The ε-constraint method and linearization techniques are utilized to obtain the approximate Pareto optimal solutions within limited seconds, allowing for figuring out the trade-off between the two objectives. The method is validated by numerical experiments for different delay scenarios based on a real-world case: the Beijing subway network.
- Open Access
- 10 July 2017
- Published by Elsevier in KSCE Journal of Civil Engineering
- Vol. 22 (4) , 1436-1445
Last Train Delay Management in Urban Rail Transit Network: Bi-objective MIP Model and Genetic Algorithm
- 10 July 2017
- Published by Elsevier in KSCE Journal of Civil Engineering
- Vol. 22 (4) , 1436-1445
Open AccessLast Train Delay Management in Urban Rail Transit Network: Bi-objective MIP Model and Genetic Algorithm
- Open Access
- 1 January 2017
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2017 (1)
A Passenger‐Oriented Model for Train Rescheduling on an Urban Rail Transit Line considering Train Capacity Constraint
The major objective of this work is to present a train rescheduling model with train capacity constraint from a passenger‐oriented standpoint for a subway line. The model expects to minimize the average generalized delay time (AGDT) of passengers. The generalized delay time is taken into consideration with two aspects: the delay time of alighting passengers and the penalty time of stranded passengers. Based on the abundant automatic fare collection (AFC) system records, the passenger arrival rate and the passenger alighting ratio are introduced to depict the short‐term characteristics of passenger flow at each station, which can greatly reduce the computation complexity. In addition, an efficient genetic algorithm with adaptive mutation rate and elite strategy is used to solve the large‐scale problem. Finally, Beijing Subway Line 13 is taken as a case study to validate the method. The results show that the proposed model does help neutralize the effect of train delay, with a 9.47% drop in the AGDT in comparison with the train‐oriented model.
- 1 January 2017
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2017 (1)
Open AccessA Passenger‐Oriented Model for Train Rescheduling on an Urban Rail Transit Line considering Train Capacity Constraint
The major objective of this work is to present a train rescheduling model with train capacity constraint from a passenger‐oriented standpoint for a subway line. The model expects to minimize the average generalized delay time (AGDT) of passengers. The generalized delay time is taken into consideration with two aspects: the delay time of alighting passengers and the penalty time of stranded passengers. Based on the abundant automatic fare collection (AFC) system records, the passenger arrival rate and the passenger alighting ratio are introduced to depict the short‐term characteristics of passenger flow at each station, which can greatly reduce the computation complexity. In addition, an efficient genetic algorithm with adaptive mutation rate and elite strategy is used to solve the large‐scale problem. Finally, Beijing Subway Line 13 is taken as a case study to validate the method. The results show that the proposed model does help neutralize the effect of train delay, with a 9.47% drop in the AGDT in comparison with the train‐oriented model.