Jiaxi Wang

Mr. Jiaxi Wang


Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 March 2019 in Reliability Engineering & System Safety
Verified
Journal Article
Closed access
BLBoliang Lin
Boliang Lin
JWJianping Wu
Jianping Wu
RLRuixi Lin
Ruixi Lin
JWJiaxi Wang
Jiaxi Wang
HWHui Wang
Hui Wang
XZXuhui Zhang
Xuhui Zhang

1 February 2019 in Transportation Research Part E: Logistics and Transportation Review
Verified
Journal Article
Closed access
BLBoliang Lin
Boliang Lin
SLSiqi Liu
Siqi Liu
RLRuixi Lin
Ruixi Lin
JWJiaxi Wang
Jiaxi Wang
MSMin Sun
Min Sun
JXJie Xiao
Jie Xiao

16 November 2023 in Reliability Engineering & System Safety
Verified
Journal Article
Closed access
JWJiaxi Wang
Jiaxi Wang

8 January 2021 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
JWJiaxi Wang
Jiaxi Wang
YZYinan Zhao
Yinan Zhao
MGManfred Gronalt
Manfred Gronalt
Boliang LinBoliang Lin
Boliang Lin
JWJianping Wu
Jianping Wu
To meet the operational requirements and to ensure safe operations, train units of a passenger railway operator require inspection and/or cleaning at the maintenance depots after running a specified mileage or time period. Accordingly, these inspection and cleaning activities are called depot services. In this paper, we propose an integer linear programming (ILP) model for the integrated optimization problem of depot service scheduling, train parking, and train routing. Both short trains (8 marshaling) and long trains (16 marshaling) are considered in the ILP model which is a combinational optimization problem in the dead-end tracks scenario. Moreover, a real-world case study of the Shanghai South Depot, China is carried out to further examine the effectiveness and efficiency of the proposed methodology. Computational results indicate that our method is able to generate optimized shunting plans for the linearized INLP within reasonable solution time for real-life applications, outperforming the manual method in terms of the solution quality and the computation speed.

1 January 2016 in Computational Intelligence and Neuroscience
Verified
Journal Article
Open access
PDF file
JWJiaxi Wang
Jiaxi Wang
Boliang LinBoliang Lin
Boliang Lin
JJJunchen Jin
Junchen Jin
The shunting schedule of electric multiple units depot (SSED) is one of the essential plans for high-speed train maintenance activities. This paper presents a 0-1 programming model to address the problem of determining an optimal SSED through automatic computing. The objective of the model is to minimize the number of shunting movements and the constraints include track occupation conflicts, shunting routes conflicts, time durations of maintenance processes, and shunting running time. An enhanced particle swarm optimization (EPSO) algorithm is proposed to solve the optimization problem. Finally, an empirical study from Shanghai South EMU Depot is carried out to illustrate the model and EPSO algorithm. The optimization results indicate that the proposed method is valid for the SSED problem and that the EPSO algorithm outperforms the traditional PSO algorithm on the aspect of optimality.

19 August 2018 in Symmetry
Verified
Journal Article
Open access
PDF file
JWJianping Wu
Jianping Wu
Boliang LinBoliang Lin
Boliang Lin
HWHui Wang
Hui Wang
XZXuhui Zhang
Xuhui Zhang
ZWZhongkai Wang
Zhongkai Wang
JWJiaxi Wang
Jiaxi Wang
Electric multiple unit (EMU) trains’ high-level maintenance planning is a discrete problem in mathematics. The high-level maintenance process of the EMU trains consumes plenty of time. When the process is undertaken during peak periods of the passenger flow, the transportation demand may not be fully satisfied due to the insufficient supply of trains. In contrast, if the process is undergone in advance, extra costs will be incurred. Based on the practical requirements of high-level maintenance, a 0–1 programming model is proposed. To simplify the description of the model, candidate sets of delivery dates, i.e., time windows, are generated according to the historical data and maintenance regulations. The constraints of the model include maintenance regulations, the passenger transportation demand, and capacities of workshop. The objective function is to minimize the mileage losses of all EMU trains. Moreover, a modified particle swarm algorithm is developed for solving the problem. Finally, a real-world case study of Shanghai Railway is conducted to demonstrate the proposed method. Computational results indicate that the (approximate) optimal solution can be obtained successfully by our method and the proposed method significantly reduces the solution time to 500 s.