Yun Jing

Prof. Yun Jing


Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
14 September 2020 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
YJYun Jing
Yun Jing
HHHongtao Hu
Hongtao Hu
SGSiye Guo
Siye Guo
XWXuan Wang
Xuan Wang
FCFangqiu Chen
Fangqiu Chen
This paper studies accurate short-term prediction of urban rail transit passenger flow in external passenger transport hub. Based on the conventional features that affect external rail transit passenger flows, we propose an innovative method of statistical features construction to make accurate prediction of frequently fluctuating passenger flow under the framework of machine learning. Firstly, by classifying the statistical features in time-series, we improve the previous long-short-term memory(LSTM) network model and establish a novel long-short-term memory(LSTM) network model that can deal with long-term dependent time-series data so as to accurately fit real-time passenger flow. Secondly, by introducing the lightweight implementation algorithm LightGBM based on the gradient decision boosting tree(GBDT), we build a short-term prediction model, which can reduce operation cost and improve accuracy so that accurate fitting of passenger flow peaks can be achieved. Thirdly, based on K-nearest neighbor algorithm, we select DRS as the dynamic regression device that can find a local optimal fusion method, and establish a LGB-LSTM-DRS local optimal fusion prediction model. Taking the AFC passenger flow data of Chengdudong Station as an example, we predict the short-term passenger flow. Compare with other commonly used models such as LR, RF, and GBDT, it's proved that the LGB-LSTM-DRS model has the smallest error (MAPE and RMSE) and the best prediction performance.

3 March 2018 in Neural Computing and Applications
Verified
Journal Article
Closed access
PDF file
YJYun Jing
Yun Jing
ZZZhenhua Zhang
Zhenhua Zhang

16 November 2017 in Cluster Computing
Verified
Journal Article
Closed access
PDF file
YJYun Jing
Yun Jing
YLYingke Liu
Yingke Liu
MBMingkai Bi
Mingkai Bi

23 July 2020 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
GSGuofeng Sun
Guofeng Sun
ZTZhiqiang Tian
Zhiqiang Tian
RLRenhua Liu
Renhua Liu
YJYun Jing
Yun Jing
YMYawen Ma
Yawen Ma
This paper studies the take-out route delivery problem (TRDP) with order allocation and unilateral soft time window constraints. The TRDP considers the order allocation and delivery route optimization in the delivery service process. The TRDP is a challenging version of vehicle routing problem. In order to solve this problem, this paper aims to minimize the total cost of delivery, builds an optimization model of this problem by using cumulative time, and adds time dimension in order allocation and path optimization dimensions. It can not only track the real-time location of delivery personnel but also record the delivery personnel to perform a certain task. The main algorithm is the dynamic allocation algorithm designed from the perspective of dispatch efficiency, and the subalgorithm is the improved genetic algorithm. Finally, some experiments are designed to verify the effectiveness of the established model and the designed algorithm, the order allocation and route optimization are calculated with/without the consideration of traffic jam, and the results show that the algorithm can generate better solution in each scene.

28 June 2019 in Expert Systems
Verified
Journal Article
Closed access
PDF file
YJYun Jing
Yun Jing
YLYingke Liu
Yingke Liu
ZZZhenhua Zhang
Zhenhua Zhang
YSYunhan Su
Yunhan Su

25 August 2025 in Applied Sciences
Verified
Journal Article
Open access
PDF file
YYYufeng Yao
Yufeng Yao
ZYZhepeng Yue
Zhepeng Yue
YJYun Jing
Yun Jing
JZJinchuan Zhang
Jinchuan Zhang
With the advancement of China’s industrialization, demand for express freight transportation has been rising. However, high-speed rail freight faces challenges, such as relatively low transport efficiency and lower revenues, compared with air and road modes. To address these issues, this paper focuses on freight train operations. First, it analyzes key influencing factors, including operating costs and benefits. Next, it conducts a comprehensive assessment of train consist capacity, freight node capacity, transport demand, and the number of freight services, and formulates an operational planning model that maximizes rail revenue, minimizes intermediate stops, and satisfies freight demand. Finally, an Improved Golden Jackal Optimization–based Genetic Algorithm (IGJOGA) is proposed to solve the model. Simulation results indicate that IGJOGA achieves higher solution efficiency than a traditional genetic algorithm for the freight train operation planning problem, and the results can provide a practical reference for freight train set operation schemes.