Xingchen Zhang
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
Xingchen Zhang has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Junhua Chen
School of Traffic and Transportation, Beijing Jiaotong University, No. 3 Shang Yuan Cun, Hai Dian District, Beijing 100044, China
7 shared publications - Zanyang Cui
School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China
3 shared publications - Chunxiao Zhao
School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China
2 shared publications - Han Zheng
School of Traffic and Transportation, Beijing Jiaotong University, No.3 Shang Yuan Cun, Hai Dian District, Beijing 100044, China
2 shared publications - Zhimei Wang
School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China
2 shared publications - Ang-Yang Chen
School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China
1 shared publication
Latest Publications
- Open Access
- 22 November 2023
- Published by Springer Nature in Quantum Information Processing
- Vol. 22 (11) , 1-28
High-speed train timetable optimization based on space–time network model and quantum simulator
Timetable scheduling is a combinatorial optimization problem that presents formidable challenges for classical computers. This paper introduces a pioneering methodology for addressing the high-speed train timetabling problem through quantum computing. Initially, a comprehensive binary integer programming model, grounded in the space–time network, is proposed (M1). To manage the intricacy of model M1, a knapsack problem reformulation is employed to establish a simplified binary integer programming model (M2). Both M1 and M2 are subsequently converted into quadratic unconstrained binary optimization (QUBO) models to harness the potential of quantum computing. Several techniques, including the Gurobi solver, simulated annealing, and the coherent Ising machine (CIM) quantum simulator, are deployed to solve the model across four distinct scenarios of varying complexity. The findings indicate that CIM quantum simulator outperforms the simulated annealing method in terms of solution quality for medium-scale problems.
- 22 November 2023
- Published by Springer Nature in Quantum Information Processing
- Vol. 22 (11) , 1-28
Open AccessHigh-speed train timetable optimization based on space–time network model and quantum simulator
Timetable scheduling is a combinatorial optimization problem that presents formidable challenges for classical computers. This paper introduces a pioneering methodology for addressing the high-speed train timetabling problem through quantum computing. Initially, a comprehensive binary integer programming model, grounded in the space–time network, is proposed (M1). To manage the intricacy of model M1, a knapsack problem reformulation is employed to establish a simplified binary integer programming model (M2). Both M1 and M2 are subsequently converted into quadratic unconstrained binary optimization (QUBO) models to harness the potential of quantum computing. Several techniques, including the Gurobi solver, simulated annealing, and the coherent Ising machine (CIM) quantum simulator, are deployed to solve the model across four distinct scenarios of varying complexity. The findings indicate that CIM quantum simulator outperforms the simulated annealing method in terms of solution quality for medium-scale problems.
- Open Access
- 20 October 2023
- Published by MDPI AG in Sustainability
- Vol. 15 (20) , 15113
Integrated Planning for Depot Location and Line Planning Problems in the Intercity Railway Network with Passenger Demand Uncertainty
In this study, we present a mathematical model and solution approach for addressing the robust integrated intercity railway depot location and line planning problem (RIDLLPP), which encompasses the initial two stages of the railway planning process. Our primary objective is to identify depot locations that exhibit robustness across a range of likely future scenarios, and this is achieved by incorporating line planning decisions. The model focuses on five critical strategic determinations, namely the depot location, depot storage capacity, line operation, passenger assignment, and fleet allocation. To tackle this complex problem, we propose an iterative solution framework that combines the Differential Evolution (DE) algorithm with improved rounding heuristics (DE-IRH). To evaluate the effectiveness of our framework, we conduct a comparative analysis with the Gurobi solver using multiple medium-sized artificial instances. The results demonstrate that our proposed framework achieves an optimality gap of 4.87% while requiring less computational time. Furthermore, we validate the robustness of the model’s location choices across various input scenarios, thereby providing valuable insights for transportation planning agencies and railway companies that can inform their decision-making processes.
- 20 October 2023
- Published by MDPI AG in Sustainability
- Vol. 15 (20) , 15113
Open AccessIntegrated Planning for Depot Location and Line Planning Problems in the Intercity Railway Network with Passenger Demand Uncertainty
In this study, we present a mathematical model and solution approach for addressing the robust integrated intercity railway depot location and line planning problem (RIDLLPP), which encompasses the initial two stages of the railway planning process. Our primary objective is to identify depot locations that exhibit robustness across a range of likely future scenarios, and this is achieved by incorporating line planning decisions. The model focuses on five critical strategic determinations, namely the depot location, depot storage capacity, line operation, passenger assignment, and fleet allocation. To tackle this complex problem, we propose an iterative solution framework that combines the Differential Evolution (DE) algorithm with improved rounding heuristics (DE-IRH). To evaluate the effectiveness of our framework, we conduct a comparative analysis with the Gurobi solver using multiple medium-sized artificial instances. The results demonstrate that our proposed framework achieves an optimality gap of 4.87% while requiring less computational time. Furthermore, we validate the robustness of the model’s location choices across various input scenarios, thereby providing valuable insights for transportation planning agencies and railway companies that can inform their decision-making processes.
- Open Access
- 6 September 2022
- Published by MDPI AG in Applied Sciences
- Vol. 12 (18) , 8965
Fluctuating Demand-Oriented Optimization of Train Line Planning Considering Carriage Resources Transfer under Flexible Compositions
The intercity railway is subject to variation and fluctuation in demand both in time and space over a day to a large extent. In that case, more advanced line planning techniques are practically needed to match the non-equilibrium passenger demand. We propose an integer linear programming model for adapting to the fluctuating demand and improving rail line profit, in which the multi-period planning approach and flexible train composition mode are taken into consideration. In particular, we also consider the limitations of the carriage and the dynamic transfer of resources during a finite period to ensure the better implementation of the line planning and subsequent operation plans. Our purpose is to improve on previous line planning models by integrating the multi-period strategic-level line planning decision with resource constraints. Since the problem is computationally intractable for realistic size instances, an improved round heuristic algorithm that is based on linear relaxation is proposed and we compare the round heuristic performance with the commercial solver Gurobi on artificial instances. The numerical experiments that are based on an intercity railway in China certify the effectiveness and applicability of the proposed model and algorithm. We evaluate the impact of different optimization parameters and reserved carriages and the computation results show that in comparison to the fixed composition mode, the proposed approach can improve the utilization efficiency of carriage resources and increase the line profit by 1.9% under the same carriage resource conditions.
- 6 September 2022
- Published by MDPI AG in Applied Sciences
- Vol. 12 (18) , 8965
Open AccessFluctuating Demand-Oriented Optimization of Train Line Planning Considering Carriage Resources Transfer under Flexible Compositions
The intercity railway is subject to variation and fluctuation in demand both in time and space over a day to a large extent. In that case, more advanced line planning techniques are practically needed to match the non-equilibrium passenger demand. We propose an integer linear programming model for adapting to the fluctuating demand and improving rail line profit, in which the multi-period planning approach and flexible train composition mode are taken into consideration. In particular, we also consider the limitations of the carriage and the dynamic transfer of resources during a finite period to ensure the better implementation of the line planning and subsequent operation plans. Our purpose is to improve on previous line planning models by integrating the multi-period strategic-level line planning decision with resource constraints. Since the problem is computationally intractable for realistic size instances, an improved round heuristic algorithm that is based on linear relaxation is proposed and we compare the round heuristic performance with the commercial solver Gurobi on artificial instances. The numerical experiments that are based on an intercity railway in China certify the effectiveness and applicability of the proposed model and algorithm. We evaluate the impact of different optimization parameters and reserved carriages and the computation results show that in comparison to the fixed composition mode, the proposed approach can improve the utilization efficiency of carriage resources and increase the line profit by 1.9% under the same carriage resource conditions.
- Open Access
- 14 August 2022
- Published by MDPI AG in Applied Sciences
- Vol. 12 (16) , 8132
Train Occupancy Time of a Railway Section and the Combined Occupancy Method for Capacity Assessment
Accurate and convenient assessment of a section’s capacity is an essential problem in the operation of high-speed railway companies. The concept of occupancy time is widely used in the field, but there is still a lack of quantitative analysis to support follow-up studies and application. In this research, the calculation method for one train, two trains and multiple trains is discussed. The occupancy time of the two trains was divided into three cases according to the relationship between them, and the calculation formulas are given. For the calculation of multiple trains, the circumstances were too intricate to be classified. To solve this problem, the concept of a continuous train group was proposed. The three properties of the continuous train group were analyzed and proved by mathematical derivation to provide theoretical support to transform a multi-train problem into many two-train problems. Finally, a combined occupancy method for capacity assessment was formed and applied to the Beijing–Shanghai high-speed railway. A series of numerical cases were designed to evaluate the performance compared with the UIC406 method. The results demonstrate that the combined occupancy method can better assess the capacity and is more convenient to implement.
- 14 August 2022
- Published by MDPI AG in Applied Sciences
- Vol. 12 (16) , 8132
Open AccessTrain Occupancy Time of a Railway Section and the Combined Occupancy Method for Capacity Assessment
Accurate and convenient assessment of a section’s capacity is an essential problem in the operation of high-speed railway companies. The concept of occupancy time is widely used in the field, but there is still a lack of quantitative analysis to support follow-up studies and application. In this research, the calculation method for one train, two trains and multiple trains is discussed. The occupancy time of the two trains was divided into three cases according to the relationship between them, and the calculation formulas are given. For the calculation of multiple trains, the circumstances were too intricate to be classified. To solve this problem, the concept of a continuous train group was proposed. The three properties of the continuous train group were analyzed and proved by mathematical derivation to provide theoretical support to transform a multi-train problem into many two-train problems. Finally, a combined occupancy method for capacity assessment was formed and applied to the Beijing–Shanghai high-speed railway. A series of numerical cases were designed to evaluate the performance compared with the UIC406 method. The results demonstrate that the combined occupancy method can better assess the capacity and is more convenient to implement.
- Open Access
- 3 January 2022
- Published by MDPI AG in Sustainability
- Vol. 14 (1) , 491
Solution of Multi-Crew Depots Railway Crew Scheduling Problems: The Chinese High-Speed Railway Case
This paper presents a novel mathematical formulation in crew scheduling, considering real challenges most railway companies face such as roundtrip policy for crew members joining from different crew depots and stricter working time standards under a sustainable development strategy. In China, the crew scheduling is manually compiled by railway companies respectively, and the plan quality varies from person to person. An improved genetic algorithm is proposed to solve this large-scale combinatorial optimization problem. It repairs the infeasible gene fragments to optimize the search scope of the solution space and enhance the efficiency of GA. To investigate the algorithm’s efficiency, a real case study was employed. Results show that the proposed model and algorithm lead to considerable improvement compared to the original planning: (i) Compared with the classical metaheuristic algorithms (GA, PSO, TS), the improved genetic algorithm can reduce the objective value by 4.47%; and (ii) the optimized crew scheduling plan reduces three crew units and increases the average utilization of crew unit working time by 6.20% compared with the original plan.
- 3 January 2022
- Published by MDPI AG in Sustainability
- Vol. 14 (1) , 491
Open AccessSolution of Multi-Crew Depots Railway Crew Scheduling Problems: The Chinese High-Speed Railway Case
This paper presents a novel mathematical formulation in crew scheduling, considering real challenges most railway companies face such as roundtrip policy for crew members joining from different crew depots and stricter working time standards under a sustainable development strategy. In China, the crew scheduling is manually compiled by railway companies respectively, and the plan quality varies from person to person. An improved genetic algorithm is proposed to solve this large-scale combinatorial optimization problem. It repairs the infeasible gene fragments to optimize the search scope of the solution space and enhance the efficiency of GA. To investigate the algorithm’s efficiency, a real case study was employed. Results show that the proposed model and algorithm lead to considerable improvement compared to the original planning: (i) Compared with the classical metaheuristic algorithms (GA, PSO, TS), the improved genetic algorithm can reduce the objective value by 4.47%; and (ii) the optimized crew scheduling plan reduces three crew units and increases the average utilization of crew unit working time by 6.20% compared with the original plan.
- Open Access
- 18 October 2021
- Published by MDPI AG in Information
- Vol. 12 (10) , 429
Study on Customized Shuttle Transit Mode Responding to Spatiotemporal Inhomogeneous Demand in Super-Peak
Instantaneous mega-traffic flow has long been one of the major challenges in the management of mega-cities. It is difficult for the public transportation system to cope directly with transient mega-capacity flows, and the uneven spatiotemporal distribution of demand is the main cause. To this end, this paper proposed a customized shuttle bus transportation model based on the “boarding-transfer-alighting” framework, with the goal of minimizing operational costs and maximizing service quality to address mega-transit demand with uneven spatiotemporal distribution. The fleet application is constructed by a pickup and delivery problem with time window and transfer (PDPTWT) model, and a heuristic algorithm based on Tabu Search and ALNS is proposed to solve the large-scale computational problem. Numerical tests show that the proposed algorithm has the same accuracy as the commercial solution software, but has a higher speed. When the demand size is 10, the proposed algorithm can save 24,000 times of time. In addition, 6 reality-based cases are presented, and the results demonstrate that the designed option can save 9.93% of fleet cost, reduce 45.27% of vehicle waiting time, and 33.05% of passenger waiting time relative to other existing customized bus modes when encountering instantaneous passenger flows with time and space imbalance.
- 18 October 2021
- Published by MDPI AG in Information
- Vol. 12 (10) , 429
Open AccessStudy on Customized Shuttle Transit Mode Responding to Spatiotemporal Inhomogeneous Demand in Super-Peak
Instantaneous mega-traffic flow has long been one of the major challenges in the management of mega-cities. It is difficult for the public transportation system to cope directly with transient mega-capacity flows, and the uneven spatiotemporal distribution of demand is the main cause. To this end, this paper proposed a customized shuttle bus transportation model based on the “boarding-transfer-alighting” framework, with the goal of minimizing operational costs and maximizing service quality to address mega-transit demand with uneven spatiotemporal distribution. The fleet application is constructed by a pickup and delivery problem with time window and transfer (PDPTWT) model, and a heuristic algorithm based on Tabu Search and ALNS is proposed to solve the large-scale computational problem. Numerical tests show that the proposed algorithm has the same accuracy as the commercial solution software, but has a higher speed. When the demand size is 10, the proposed algorithm can save 24,000 times of time. In addition, 6 reality-based cases are presented, and the results demonstrate that the designed option can save 9.93% of fleet cost, reduce 45.27% of vehicle waiting time, and 33.05% of passenger waiting time relative to other existing customized bus modes when encountering instantaneous passenger flows with time and space imbalance.
- Open Access
- 13 September 2019
- Published by MDPI AG in Sustainability
- Vol. 11 (18) , 5025
Designing a New Shuttle Service to Meet Large-Scale Instantaneous Peak Demands for Passenger Transportation in a Metropolitan Context: A Green, Low-Cost Mass Transport Option
Currently, the green, sustainable development of metropolises is hindered by problems caused by Large-scale Instantaneous Peak-demands for Passenger-transportation (LIPP), such as traffic congestion and air pollution. To mitigate these problems, we propose a new type of demand-responsive service as an alternative to inefficient “door-to-door” service. The proposed service is based on service units designed to aggregate passengers for shuttle service. To guarantee service quality and efficiency, a maximum passenger walking time constraint, a request rejection mechanism and a scheme for ensuring solution feasibility are considered. Through numerical experiments, we prove the following: (i) the proposed transport option exhibits better performance (by 40.37% for passengers and by 35.79% for operators) than the door-to-door transport option for solving real cases. (ii) By testing different datasets, we prove that the proposed service is more suitable for the request distributions that are spatiotemporally concentrated. (iii) Regarding the individual components of the proposed clustering-first, routing-second solution framework, the proposed soft clustering algorithm exhibits better performance than the classical hard clustering method (by 8%), and the proposed routing algorithm is 1.5 times more efficient than the commercial solution software GAMS.
- 13 September 2019
- Published by MDPI AG in Sustainability
- Vol. 11 (18) , 5025
Open AccessDesigning a New Shuttle Service to Meet Large-Scale Instantaneous Peak Demands for Passenger Transportation in a Metropolitan Context: A Green, Low-Cost Mass Transport Option
Currently, the green, sustainable development of metropolises is hindered by problems caused by Large-scale Instantaneous Peak-demands for Passenger-transportation (LIPP), such as traffic congestion and air pollution. To mitigate these problems, we propose a new type of demand-responsive service as an alternative to inefficient “door-to-door” service. The proposed service is based on service units designed to aggregate passengers for shuttle service. To guarantee service quality and efficiency, a maximum passenger walking time constraint, a request rejection mechanism and a scheme for ensuring solution feasibility are considered. Through numerical experiments, we prove the following: (i) the proposed transport option exhibits better performance (by 40.37% for passengers and by 35.79% for operators) than the door-to-door transport option for solving real cases. (ii) By testing different datasets, we prove that the proposed service is more suitable for the request distributions that are spatiotemporally concentrated. (iii) Regarding the individual components of the proposed clustering-first, routing-second solution framework, the proposed soft clustering algorithm exhibits better performance than the classical hard clustering method (by 8%), and the proposed routing algorithm is 1.5 times more efficient than the commercial solution software GAMS.
- Open Access
- 27 June 2019
- Published by MDPI AG in ISPRS International Journal of Geo-Information
- Vol. 8 (7) , 294
Automatic Discovery of Railway Train Driving Modes Using Unsupervised Deep Learning
Driving modes play vital roles in understanding the stochastic nature of a railway system and can support studies of automatic driving and capacity utilization optimization. Integrated trajectory data containing information such as GPS trajectories and gear changes can be good proxies in the study of driving modes. However, in the absence of labeled data, discovering driving modes is challenging. In this paper, instead of classical models (railway-specified feature extraction and classical clustering), we used five deep unsupervised learning models to overcome this difficulty. In these models, adversarial autoencoders and stacked autoencoders are used as feature extractors, along with generative adversarial network-based and Kullback–Leibler (KL) divergence-based networks as clustering models. An experiment based on real and artificial datasets showed the following: (i) The proposed deep learning models outperform the classical models by 27.64% on average. (ii) Integrated trajectory data can improve the accuracy of unsupervised learning by approximately 13.78%. (iii) The different performance rankings of models based on indices with labeled data and indices without labeled data demonstrate the insufficiency of people’s understanding of the existing modes. This study also analyzes the relationship between the discovered modes and railway carrying capacity.
- 27 June 2019
- Published by MDPI AG in ISPRS International Journal of Geo-Information
- Vol. 8 (7) , 294
Open AccessAutomatic Discovery of Railway Train Driving Modes Using Unsupervised Deep Learning
Driving modes play vital roles in understanding the stochastic nature of a railway system and can support studies of automatic driving and capacity utilization optimization. Integrated trajectory data containing information such as GPS trajectories and gear changes can be good proxies in the study of driving modes. However, in the absence of labeled data, discovering driving modes is challenging. In this paper, instead of classical models (railway-specified feature extraction and classical clustering), we used five deep unsupervised learning models to overcome this difficulty. In these models, adversarial autoencoders and stacked autoencoders are used as feature extractors, along with generative adversarial network-based and Kullback–Leibler (KL) divergence-based networks as clustering models. An experiment based on real and artificial datasets showed the following: (i) The proposed deep learning models outperform the classical models by 27.64% on average. (ii) Integrated trajectory data can improve the accuracy of unsupervised learning by approximately 13.78%. (iii) The different performance rankings of models based on indices with labeled data and indices without labeled data demonstrate the insufficiency of people’s understanding of the existing modes. This study also analyzes the relationship between the discovered modes and railway carrying capacity.
- Open Access
- 1 August 2018
- Published by MDPI AG in ISPRS International Journal of Geo-Information
- Vol. 7 (8) , 308
Identifying Modes of Driving Railway Trains from GPS Trajectory Data: An Ensemble Classifier-Based Approach
Recognizing Modes of Driving Railway Trains (MDRT) can help to solve railway freight transportation problems in driver behavior research, auto-driving system design and capacity utilization optimization. Previous studies have focused on analyses and applications of MDRT, but there is currently no approach to automatically and effectively identify MDRT in the context of big data. In this study, we propose an integrated approach including data preprocessing, feature extraction, classifiers modeling, training and parameter tuning, and model evaluation to infer MDRT using GPS data. The highlights of this study are as follows: First, we propose methods for extracting Driving Segmented Standard Deviation Features (DSSDF) combined with classical features for the purpose of improving identification performances. Second, we find the most suitable classifier for identifying MDRT based on a comparison of performances of K-Nearest Neighbor, Support Vector Machines, AdaBoost, Random Forest, Gradient Boosting Decision Tree, and XGBoost. From the real-data experiment, we conclude that: (i) The ensemble classifier XGBoost produces the best performance with an accuracy of 92.70%; (ii) The group of DSSDF plays an important role in identifying MDRT with an accuracy improvement of 11.2% (using XGBoost). The proposed approach has been applied in capacity utilization optimization and new driver training for the Baoshen Railway.
- 1 August 2018
- Published by MDPI AG in ISPRS International Journal of Geo-Information
- Vol. 7 (8) , 308
Open AccessIdentifying Modes of Driving Railway Trains from GPS Trajectory Data: An Ensemble Classifier-Based Approach
Recognizing Modes of Driving Railway Trains (MDRT) can help to solve railway freight transportation problems in driver behavior research, auto-driving system design and capacity utilization optimization. Previous studies have focused on analyses and applications of MDRT, but there is currently no approach to automatically and effectively identify MDRT in the context of big data. In this study, we propose an integrated approach including data preprocessing, feature extraction, classifiers modeling, training and parameter tuning, and model evaluation to infer MDRT using GPS data. The highlights of this study are as follows: First, we propose methods for extracting Driving Segmented Standard Deviation Features (DSSDF) combined with classical features for the purpose of improving identification performances. Second, we find the most suitable classifier for identifying MDRT based on a comparison of performances of K-Nearest Neighbor, Support Vector Machines, AdaBoost, Random Forest, Gradient Boosting Decision Tree, and XGBoost. From the real-data experiment, we conclude that: (i) The ensemble classifier XGBoost produces the best performance with an accuracy of 92.70%; (ii) The group of DSSDF plays an important role in identifying MDRT with an accuracy improvement of 11.2% (using XGBoost). The proposed approach has been applied in capacity utilization optimization and new driver training for the Baoshen Railway.
- Open Access
- 1 January 2017
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2017 (1)
System Dynamic Model for Simulating Demand‐Supply Interaction of Railway Express Freight System
Express freight transportation is a rich seam of profit for China railway, and railway express freight system is a complex system with multiple variables and nonlinear feedback loops. This paper presents a System Dynamic Model for simulating the interaction between demand and supply of railway express freight system in China. The model consists of three submodels including economic environment, demand, supply, and investment, and its validity is verified by running in Vensim DDS software using historical data. In the simulation of period 2000–2025, the three variables are taken as control variables including growth rate of the national economy, railway express freight rate, and investment in fixed railway assets. Three scenarios for each control variable are simulated, and their effects are analyzed to provide beneficial reference for regulating the demand‐supply gap of railway express freight. The simulation demonstrated that raising freight rate, adding investment in fixed railway assets, and decelerating economic growth rate are all effective ways to shrink the demand‐supply gap of railway express freight. The model can be used to forecast the transport demand of railway express freight and test the outcomes of demand‐supply regulating measures.
- 1 January 2017
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2017 (1)
Open AccessSystem Dynamic Model for Simulating Demand‐Supply Interaction of Railway Express Freight System
Express freight transportation is a rich seam of profit for China railway, and railway express freight system is a complex system with multiple variables and nonlinear feedback loops. This paper presents a System Dynamic Model for simulating the interaction between demand and supply of railway express freight system in China. The model consists of three submodels including economic environment, demand, supply, and investment, and its validity is verified by running in Vensim DDS software using historical data. In the simulation of period 2000–2025, the three variables are taken as control variables including growth rate of the national economy, railway express freight rate, and investment in fixed railway assets. Three scenarios for each control variable are simulated, and their effects are analyzed to provide beneficial reference for regulating the demand‐supply gap of railway express freight. The simulation demonstrated that raising freight rate, adding investment in fixed railway assets, and decelerating economic growth rate are all effective ways to shrink the demand‐supply gap of railway express freight. The model can be used to forecast the transport demand of railway express freight and test the outcomes of demand‐supply regulating measures.