Jianping Wu

Jianping Wu


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
21 December 2017 in Applied Sciences
Verified
Journal Article
Open access
PDF file
JWJianping Wu
Jianping Wu
Boliang LinBoliang Lin
Boliang Lin
JWJiaxi Wang
Jiaxi Wang
SLSiqi Liu
Siqi Liu
Electric Multiple Unit (EMU) high-level maintenance planning is a typical discrete system. EMU high-level maintenance (HM) planning determines when to undergo HM or execute transportation task for train-sets, based on practical requirements such as passenger transport demand, workshop maintenance capacity, and maintenance regulations. This research constructs a time-state network that can display the transformation processes between different states. On this basis, a path based model and its improvement are developed to minimize the HM costs with consideration of all necessary regulations and practical constraints. To handle the solution space, a path set generation method is presented. A real-world instance from Shanghai Railway, which is the largest affiliate in China Railway Corporation, was conducted to demonstrate the efficiency and effectiveness of the proposed approach, which indicates that the model can be solved to optimum within short computational times by the state-of-the-art solver Gurobi. Moreover, a sensitivity analysis was also performed to evaluate the effects of the variation in average daily operating mileage, HM capacity at the depot and the assumed minimum value of cumulative mileage.

10 September 2018 in Symmetry
Verified
Journal Article
Open access
PDF file
SLSiqi Liu
Siqi Liu
Boliang LinBoliang Lin
Boliang Lin
JWJianping Wu
Jianping Wu
YZYinan Zhao
Yinan Zhao
As air pollution becomes increasingly severe, express trains play a more important role in shifting road freight and reducing carbon emissions. Thus, the design of railway express shipment service networks has become a key issue, which needs to be addressed urgently both in theory and practice. The railway express shipment service network design problem (RESSNDP) not only involves the selection of train services and determination of service frequency, but it is also associated with shipment routing, which can be viewed as a service network design problem (SNDP) with railway characteristics. This paper proposes a non-linear integer programming model (INLP) which aims at finding a service network and shipment routing plan with minimum cost while satisfying the transportation time constraints of shipments, carrying capacity constraints of train services, flow conservation constraint and logical constraints among decision variables. In addition, a linearization technique was adopted to transform our model into a linear one to obtain a global optimal solution. To evaluate the effectiveness and efficiency of our approach, a small trial problem was solved by the state-of-the-art mathematical programming solver Gurobi 7.5.2.

14 July 2017 in Symmetry
Verified
Journal Article
Open access
PDF file
Boliang LinBoliang Lin
Boliang Lin
SLSiqi Liu
Siqi Liu
RLRuixi Lin
Ruixi Lin
JWJianping Wu
Jianping Wu
JWJiaxi Wang
Jiaxi Wang
CLChang Liu
Chang Liu
China’s railway network is one of the largest railway networks in the world. By the end of 2016, the total length of railway in operation reached 124,000 km and the annual freight volume exceeded 3.3 billion tons. However, the structure of network does not completely match transportation demand, i.e., there still exist a few bottlenecks in the network, which forces some freight flows to travel along non-shortest paths. At present, due to the expansion of the high-speed railway network, more passengers will travel by electric multiple unit (EMU) trains running on the high-speed railway. Therefore, fewer passenger trains will move along the regular medium-speed lines, resulting in more spare capacity for freight trains. In this context, some shipments flowing on non-shortest paths can shift to shorter paths. And consequently, a combinatorial optimization problem concerning which origin-destination (O-D) pairs should be adjusted to their shortest paths will arise. To solve it, mathematical models are developed to adjust freight flows between their shortest paths and non-shortest paths based on the 0-1 knapsack problem. We also carry out computational experiments using the commercial software Gurobi and a greedy algorithm (GA), respectively. The results indicate that the proposed models are feasible and effective.

25 April 2018 in Symmetry
Verified
Journal Article
Open access
PDF file
SLSiqi Liu
Siqi Liu
Boliang LinBoliang Lin
Boliang Lin
JWJiaxi Wang
Jiaxi Wang
JWJianping Wu
Jianping Wu
Classification yards are crucial nodes of railway freight transportation network, which plays a vital role in car flow reclassification and new train formation. Generally, a modern yard covers an expanse of several square kilometers and costs billions of Chinese Yuan (CNY), i.e., hundreds of millions of dollars. The determination of location and size of classification yards in multiple periods is not only related to yard establishment or improvement cost, but also involved with train connection service (TCS) plan. This paper proposes a bi-level programming model for the multi-period and multi-classification-yard location (MML) problem. The upper-level is intended to find an optimal combinatorial investment strategy for candidate nodes throughout the planning horizon, and the lower-level aims to obtain a railcar reclassification plan with minimum operation cost on the basis of the strategy given by the upper-level. The model is constrained by budget, classification capacity, the number of available tracks, etc. A numerical study is then performed to evaluate the validity and effectiveness of the model.

31 October 2016 in arXiv
Verified
Preprint
Open access
PDF file
JWJianping Wu
Jianping Wu
Boliang LinBoliang Lin
Boliang Lin
It is an important objective pursued in a railway agency or company to reduce the major maintenance costs of electric multiple unit (EMU). The EMU major maintenance schedule decides when to undergo major maintenance or undertake transportation task for train-set, based on practical requirements, such as passenger transport demand, workshop inspection capacity, and maintenance requirements. Experienced railway practitioners can generally produce a feasible major maintenance schedule; however, this manual process is time-consuming, and an optimal solution is not guaranteed. This research constructs a time-space network that can display the train-set status transformation process between available and major maintenance status. On this basis, a 0-1 integer programming model is developed to reduce the major maintenance costs with consideration of all necessary regulations and practical constraints. Compared with the manual process, the genetic algorithm with simulated annealing survival mechanism is also developed to improve solution quality and efficiency. It can reduce the complexity of the algorithm substantially by excluding infeasible solutions when constructing the model.