Zhang Yijie

Dr. Zhang Yijie

orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
19 February 2020 in Wireless Networks
Verified
Journal Article
Closed access
PDF file
ZYZhang Yijie
Zhang Yijie
MLMandan Liu
Mandan Liu

3 August 2020 in Algorithms
Verified
Journal Article
Open access
PDF file
ZYZhang Yijie
Zhang Yijie
MLMandan Liu
Mandan Liu
The wireless sensor network (WSN) has the advantages of low cost, high monitoring accuracy, good fault tolerance, remote monitoring and convenient maintenance. It has been widely used in various fields. In the WSN, the placement of node sensors has a great impact on its coverage, energy consumption and some other factors. In order to improve the convergence speed of a node placement optimization algorithm, the encoding method is improved in this paper. The degressive ary number encoding is further extended to a multi-objective optimization problem. Furthermore, the adaptive changing rule of ary number is proposed by analyzing the experimental results of the N-ary number encoded algorithm. Then a multi-objective optimization algorithm adopting the adaptive degressive ary number encoding method has been used in optimizing the node placement in WSN. The experiments show that the proposed adaptive degressive ary number encoded algorithm can improve both the optimization effect and search efficiency when solving the node placement problem.

29 July 2020 in Sensors
Verified
Journal Article
Open access
PDF file
ZYZhang Yijie
Zhang Yijie
MLMandan Liu
Mandan Liu
Node placement is one of the basic problems in a Wireless Sensor Network (WSN). During the operation of a WSN, sensor nodes may fail or die suddenly, which may lead to a coverage hole. To solve this problem, the node placement needs to be re-optimized. The dimensions of node placement optimization are high because of the large node number. In view of this defect, a regional optimization dynamic algorithm is put forward. In this paper, the regional optimization problem of node placement is modeled, and a regional optimization dynamic algorithm with a mixed strategy for node placement (MRDA) is proposed. Simulation experiments are carried out for the proposed algorithm and other comparison algorithms. Results of experiments show that the proposed algorithm can greatly reduce the dimensions and narrow the search range, with a significant improvement in the search performance and convergence speed.

21 October 2024 in Biomimetics
Verified
Journal Article
Open access
PDF file
ZYZhang Yijie
Zhang Yijie
YCYuhang Cai
Yuhang Cai
The high dimensionality of large datasets can severely impact the data mining process. Therefore, feature selection becomes an essential preprocessing stage, aimed at reducing the dimensionality of the dataset by selecting the most informative features while improving classification accuracy. This paper proposes a novel binary Gray Wolf Optimization algorithm to address the feature selection problem in classification tasks. Firstly, the historical optimal position of the search agent helps explore more promising areas. Therefore, by linearly combining the best positions of the search agents, the algorithm’s exploration capability is increased, thus enhancing its global development ability. Secondly, the novel quadratic interpolation technique, which integrates population diversity with local exploitation, helps improve both the diversity of the population and the convergence accuracy. Thirdly, chaotic perturbations (small random fluctuations) applied to the convergence factor during the exploration phase further help avoid premature convergence and promote exploration of the search space. Finally, a novel transfer function processes feature information differently at various stages, enabling the algorithm to search and optimize effectively in the binary space, thereby selecting the optimal feature subset. The proposed method employs a k-nearest neighbor classifier and evaluates performance through 10-fold cross-validation across 32 datasets. Experimental results, compared with other advanced algorithms, demonstrate the effectiveness of the proposed algorithm.

22 August 2022 in Wireless Communications and Mobile Computing
Verified
Journal Article
Open access
PDF file
ZYZhang Yijie
Zhang Yijie
ZGZhan Guo
Zhan Guo
Wireless sensor network (WSN) is an important part of the Internet of Things. With the application and development of the Internet of Things, the heterogeneity of WSN is put forward a higher demand. Node placement is a critical step in the heterogeneous wireless sensor network (HEWSN). It is very important to optimize the node placement to fundamentally prolong the lifetime, improve the performance, and decrease the cost of the HEWSN. In this paper, the node placement optimization problem of HEWSN with different sensing types’ nodes is studied. An improved algorithm named neighbor nodes directed evolved nondominated sorting genetic algorithm (NN-DENSGA) is proposed to solve the multiobjective optimization problem. Homogeneous neighbor nodes are considered to promote directional evolution, and heterogeneous neighbor nodes are considered to repair the coverage holes. In addition, a forced update strategy is designed to increase diversity of population. Experiments have shown that the proposed algorithm not only has improvements in optimization performance but also in convergence speed and stability.

29 June 2025 in Algorithms
Verified
Journal Article
Open access
PDF file
ZYZhang Yijie
Zhang Yijie
JCJizhou Chen
Jizhou Chen
In the obstacle grid map, due to the limitations in search direction imposed by classical path algorithms and meta-heuristic algorithms, the shortest paths are not the true shortest paths (TSPs) but rather the shortest grid paths (SGPs). This paper introduces an SGP vertex extraction and filtering algorithm (SGPVEFA) that identifies key nodes within SGPs. After screening, these nodes yield TSPs under the same conditions. Through various experiments, the shortest path length searched by the SGPVEFA proposed in this paper can be used to search for the real shortest path, and it also has advantages in comparison with recent new algorithms. With the increase in map scale and obstacle rate, the advantages of this path algorithm are more significant.