Ying Zhang

Prof. Dr. Ying Zhang

orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
8 February 2019 in IEEE Access
Verified
Journal Article
Open access
YZYing Zhang
Ying Zhang
YWYanhao Wang
Yanhao Wang
MGMinghe Gao
Minghe Gao
QMQunfei Ma
Qunfei Ma
JZJing Zhao
Jing Zhao
LHLinyan Huang
Linyan Huang
In recent years, people have been paying more and more attention to air quality because it directly affects people’s health and daily life. Effective air quality prediction has become one of the hot research issues. However, this work is suffering many challenges, such as the instability of data sources and the variation of pollutant concentration along time series. Aiming at this problem, we propose an improved air quality prediction method based on the LightGBM model to predict the PM2.5 concentration at the 35 air quality monitoring stations in Beijing over the next 24 hours. In this paper, we resolve the issue of processing the high-dimensional large-scale data with employing the LightGBM model and innovatively take the forecasting data as one of the data sources for predicting the air quality. With exploring the forecasting data feature, we could improve the prediction accuracy with making full use of the available spatial data. Given the lack of data, we employ the sliding window mechanism to deeply mine the highdimensional temporal features for increasing the training dimensions to millions.We compare the predicted data with the actual data collected at the 35 air quality monitoring stations in Beijing. The experimental results show that the proposed method is superior to other schemes and prove the advantage of integrating the forecasting data and building up the high-dimensional statistical analysis.

7 May 2020 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
YZYing Zhang
Ying Zhang
YWYanhao Wang
Yanhao Wang
FLFanyu Li
Fanyu Li
BWBin Wu
Bin Wu
YCYao-Yi Chiang
Yao-Yi Chiang
XZXin Zhang
Xin Zhang
Charging infrastructure deployment is to seek the proper plan of settling charging stations and charging piles under multiple constraints, such as recharging demand, cruising range, etc., and it has been asserted as an NP-Complete problem. In this paper, we propose a multicriteria-oriented approach of efficiently deploying charging infrastructure to cope with the problem. We firstly formulate five realistic charging objective functions that exhibit a significant diminishing returns effect, i.e., submodularity, and then exploit the submodularity of these objectives to design the acceleration algorithms for Charging Station PLacement (CSPL) with the provable performance guarantees. The corresponding algorithms are respectively named Lazy Greedy with Direct Gain (LGDG) and Lazy Greedy with Effective Gain (LGEG), and they scale well to the road networks of arbitrary size. Relying on the inference that the linear combination of submodular functions is still a submodular function, we treat CSPL as a multicriteria optimization problem that can be efficiently solved by the proposed algorithms. Moreover, we employ Erlang-Loss system to gain an optimal Charging Pile ASsignment (CPAS), which is capable of reducing the gap between the growing complexity of charging demands and the constrained supply of charging resources in considering the correlation between the primary human activities and the charging process. The experimental evaluation with real data sets shows that, compared with the state-of-the-art methods, the proposed approach reveals better effectiveness and efficiency, and it offers a potent solution to the planning of charging infrastructure for electric vehicles with large-scale datasets in reality.

1 May 2020 in ISA Transactions
Verified
Journal Article
Closed access
YZYing Zhang
Ying Zhang
RZRongrong Zhang
Rongrong Zhang
QMQunfei Ma
Qunfei Ma
YWYanhao Wang
Yanhao Wang
QWQingqing Wang
Qingqing Wang
LHLinyan Huang
Linyan Huang

19 October 2022 in IEEE Transactions on Smart Grid
Verified
Journal Article
Closed access
YZYing Zhang
Ying Zhang
MLMuyang Li
Muyang Li
YCYuanchang Chen
Yuanchang Chen
YCYaoyi Chiang
Yaoyi Chiang
YHYunpeng Hua
Yunpeng Hua
Electric vehicle route planning (EVRP) is generated from the collaborative operation of smart grids and intelligent transportation systems. It has become an essential issue for the widespread use of battery electric vehicles. However, the existed EVRP solutions are of either high computational complexity or low efficiency for large-scale problems. Towards such issues, we propose an efficient Deep Reinforcement Learning based methodology for constraint-based routing while simultaneously considering electric vehicles’ charging policies. We design a two-layer model to find near-optimal solutions and handle the broad range of problem instances according to the rewards and the preset feasibility rules. The first layer is to approximate a sequence of consecutive actions in reality and correspondingly produce a minimum time-consuming feasible route without re-training for each new problem instance. The second layer is to generate a charging scheme along the previously generated feasible path. The proposed methodology is independent of the road network topology and the electric vehicles’ types. Besides, the convergence of value function in the presented model for EVRP is studied. The experiment shows that our methodology outperforms the traditional ones in computation time with comparable solution quality. Moreover, the obtained model can be directly applied to treat other problem instances on various road networks without re-training procedures.

1 October 2018 in Pervasive and Mobile Computing
Verified
Journal Article
Closed access
YZYing Zhang
Ying Zhang
BABaltabay Aliya
Baltabay Aliya
YZYutong Zhou
Yutong Zhou
IYIlsun You
Ilsun You
XZXin Zhang
Xin Zhang
Mario CollottaMario Collotta
Mario Collotta

9 February 2023 in Neuroscience
Verified
Journal Article
Closed access
XZXuena Zhang
Xuena Zhang
MLMingying Li
Mingying Li
YYYun Yue
Yun Yue
YZYing Zhang
Ying Zhang
AWAnshi Wu
Anshi Wu