WHWenjuan He

Wenjuan He

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Wenjuan He has a total of 19 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    An Improved Genetic Transmission and Dynamic-Opposite Learning Strategy for Multitasking Optimization

    by Ning Li, Lei Wang, Qiaoyong Jiang, Xiaoyu Li, Bin Wang, Wenjuan He

    Multi-task evolutionary optimization is a new method proposed in recent years to solve optimization problems. Compared with traditional single-task optimization, the multi-task optimization mechanism based on evolutionary algorithms promotes the evolution of population by sharing the potential similarity and complementarity between different problems, so as to improve the performance and efficiency of solving problems. However, with the evolution of the population, the ability of one task to learn from other tasks may decrease, and the efficiency of knowledge transfer will also decrease. To address this issue and improve the quality of knowledge transfer among the tasks, this article proposes a new genetic transmission strategy and mutation strategy of multi task optimization algorithm, namely DOMLMFEA. In particular, in the genetic process, if two parent individuals are specific to different tasks, one parent individual is mapped to the vicinity of the other parent individual through task space mapping, and high-quality offspring individuals are generated through crossover. In addition, a dynamic opposite mutual learning mutation strategy based on wavelet basis function is introduced to generate promising solutions. It can effectively explore and develop in the unified search space and the subspace of each task, and improve the local search ability of the algorithm and the diversity of solutions. In order to evaluate the performance of DOMLMFEA, this paper tests on classical multi-task optimization problems, and compared with several other state-of-the-art MFEA variants. Numerical and simulation results show the effectiveness of the proposed DOMLMFEA.


  • Open Access

    An Adaptive Mechanism With Cooperative Coevolution and Covariance for Differential Evolution

    by Bin Wang, Lu Ren, Juan Diego Prado, Wenjuan He, Haiyan Jin, Qiaoyong Jiang, Xiaofan Wang

    Differential evolution (DE) is an evolutionary algorithm widely used to solve optimization problems with different characteristics in fields where actions and decisions depend on numerical data such as engineering, economics, and logistics. In this paper, an adaptive differential evolution mechanism with cooperative co-evolution and covariance (A-CC/COV-DE) is proposed to overcome the low efficiency of differential evolution when solving large-scale numerical optimization problems, especially when the correlation between the variables of the problem is unknown. An unknown correlation of variables hinders DE from achieving an optimal search process since different types of correlations ideally require distinct optimization strategies. According to the separability of variables, the appropriate evolutionary strategy is selected adaptively. For separable functions, cooperative coevolution is adopted. After using extended differential grouping to split the problem, the sub-components are optimized by differential evolution. This reduces the dimensionality and complexity of the problem, improving its convergence speed and global search ability. For non-separable functions, a covariance matrix is calculated, and then the eigenvector is used to rotate the coordinate system. This leads to eliminate the correlation between variables and improve the search efficiency of differential evolution. We evaluated the performance of A-CC/COV-DE on the CEC 2014 test suite and compared it with state-of-the-art differential evolution algorithms. The experimental results show that our proposal is quite competitive with recent algorithms.


  • Open Access

    Multiobjective Differential Evolution with Discrete Elite Guide in Internet of Vehicles Roadside Unit Deployment

    by Feng Wang, Chenle Wang, Kan Wang, Qiaoyong Jiang, Bin Wang, Wenjuan He

    In a vehicular ad hoc network (VANET), roadside units (RSUs) are installed at roadside and intersections to process vehicle‐to‐infrastructure communication, collect and analyse intelligent vehicle traffic data, send information to vehicles, and achieve early warning of safe driving of vehicles. Owning to the high cost of implementing and maintaining RSUs, it is of vital importance to determine where and how many RSUs to deploy. Optimal RSU deployment requires both a small number of RSUs and the maximum coverage of vehicle running process, which constitutes a conflicting multiobjective problem. Nevertheless, existing works do not explicitly utilize multiobjective algorithm to solve the RSU deployment problem. Therefore, a multiobjective differential evolution approach is proposed in this work to solve the problem. Firstly, to conquer the complexity of urban road RSU deployment, the static model is established. Secondly, in the proposed multiobjective differential evolution with discrete elitist guide (MODE‐deg), the sigmoid function is applied to discrete individual values. Finally, elitist individuals are selected based on crowding distance ranking and nondominated ranking to generate new individuals, which further improve the convergence speed and population performance. Experimental results show that MODE‐deg can generate the optimal nondominant solution set with good convergence and diversity, in contrast to other multiobjective evolutionary algorithms in five test functions of ZDT.


  • Open Access

    A Symmetric Sine Cosine Algorithm With Adaptive Probability Selection

    by Bin Wang, Tian Xiang, Ning Li, Wenjuan He, Wei Li, Xinhong Hei

    To improve the ability of the sine cosine algorithm (SCA) in the exploitation process, an improved symmetric SCA with adaptive probability selection (SSCA-APS), is proposed. The search process of this algorithm is divided into early and late stages. In the early stage, the operators of the traditional SCA algorithm continue to be used. In the late stage, three improvements were applied. Firstly, the symmetric sine and cosine operators are proposed. The adaptive probability selection strategy is adopted to integrate original sine and cosine operators and symmetric sine and cosine operators for dynamically adjusting the step size of the search range. Furthermore, to prevent the population from falling into local optimization, Gaussian perturbation is used to mutate the globally optimal individuals of the current generation. In addition, the information of two randomly selected individuals and the globally optimal individual is integrated by quadratic interpolation to maintain population diversity and produce a new individual. 23 test functions were used to verify the performance of the proposed algorithm. The simulation results indicate that the performance of the SSCA-APS algorithm has competitiveness when it is compared with classical SCA and some state-of-the-art SCA variants.


  • Open Access

    A novel watermarking algorithm for three-dimensional point-cloud models based on vertex curvature

    by Jing Liu, Yajie Yang, Douli Ma, Wenjuan He, Yinghui Wang

    A new blind watermarking scheme for three-dimensional point-cloud models is proposed based on vertex curvature to achieve an appropriate trade-off between transparency and robustness. The root mean square curvature of local set of every vertex is first calculated for the three-dimensional point-cloud model and then the vertices with larger root mean square curvature are used to carry the watermarking information; the vertices with smaller root mean square curvature are exploited to establish the synchronization relation between the watermark embedding and extraction. The three-dimensional point-cloud model is divided into ball rings, and the watermarking information is inserted by modifying the radial radii of vertices within ball rings. Those vertices taking part in establishing the synchronization relation do not carry the watermarking information; therefore, the synchronization relation is not affected by the embedded watermark. Experimental results show the proposed method outperforms other well-known three-dimensional point-cloud model watermarking methods in terms of imperceptibility and robustness, especially for against geometric attack.