Zhan Guo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Zhan Guo has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Xuefeng Yan
Key Laboratory of Smart Manufacturing in Energy Chemical Process, Ministry of Education, East China University of Science and Technology, Shanghai, China
1 shared publication - Yijie Zhang
School of Artificial Intelligence and Computer Science, Jiangnan University, Wuxi 214200, China
1 shared publication
Latest Publications
- Open Access
- 22 August 2022
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2022, 1-20
A Node Placement Optimization Algorithm in Heterogeneous WSN Based on Neighbor Nodes
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.
- 22 August 2022
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2022, 1-20
Open AccessA Node Placement Optimization Algorithm in Heterogeneous WSN Based on Neighbor Nodes
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.
- 26 June 2017
- Published by Taylor & Francis in Engineering Optimization
- Vol. 50 (4) , 716-731
Optimization of the p-xylene oxidation process by a multi-objective differential evolution algorithm with adaptive parameters co-derived with the population-based incremental learning algorithm
Different operating conditions of p-xylene oxidation have different influences on the product, purified terephthalic acid. It is necessary to obtain the optimal combination of reaction conditions to ensure the quality of the products, cut down on consumption and increase revenues. A multi-objective differential evolution (MODE) algorithm co-evolved with the population-based incremental learning (PBIL) algorithm, called PBMODE, is proposed. The PBMODE algorithm was designed as a co-evolutionary system. Each individual has its own parameter individual, which is co-evolved by PBIL. PBIL uses statistical analysis to build a model based on the corresponding symbiotic individuals of the superior original individuals during the main evolutionary process. The results of simulations and statistical analysis indicate that the overall performance of the PBMODE algorithm is better than that of the compared algorithms and it can be used to optimize the operating conditions of the p-xylene oxidation process effectively and efficiently.
- 26 June 2017
- Published by Taylor & Francis in Engineering Optimization
- Vol. 50 (4) , 716-731
Optimization of the p-xylene oxidation process by a multi-objective differential evolution algorithm with adaptive parameters co-derived with the population-based incremental learning algorithm
Different operating conditions of p-xylene oxidation have different influences on the product, purified terephthalic acid. It is necessary to obtain the optimal combination of reaction conditions to ensure the quality of the products, cut down on consumption and increase revenues. A multi-objective differential evolution (MODE) algorithm co-evolved with the population-based incremental learning (PBIL) algorithm, called PBMODE, is proposed. The PBMODE algorithm was designed as a co-evolutionary system. Each individual has its own parameter individual, which is co-evolved by PBIL. PBIL uses statistical analysis to build a model based on the corresponding symbiotic individuals of the superior original individuals during the main evolutionary process. The results of simulations and statistical analysis indicate that the overall performance of the PBMODE algorithm is better than that of the compared algorithms and it can be used to optimize the operating conditions of the p-xylene oxidation process effectively and efficiently.