Feng Yin

Feng Yin

Auto-generated profile, based on publicly available information

Feng Yin

School of Artificial Intelligence, Hebei University of Technology, Tianjin, China

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
28 September 2023 in Swarm and Evolutionary Computation
Verified
Journal Article
Closed access
FYFeng Yin
Feng Yin
BCBin Cao
Bin Cao

25 March 2025 in Complex & Intelligent Systems
Verified
Journal Article
Open access
PDF file
FYFeng Yin
Feng Yin
BCBin Cao
Bin Cao
Decomposition is an effective and popular strategy used by evolutionary algorithms to solve multiobjective optimization problems (MOPs). It can reduce the difficulty of directly solving MOPs, increase the diversity of the obtained solutions, and facilitate parallel computing. However, with the increase of the number of decision variables, the performance of multiobjective evolutionary algorithms (MOEAs) often deteriorates sharply. The advantages of the decomposition strategy are not fully exploited when solving such large-scale MOPs (LSMOPs). To this end, this paper proposes a parallel MOEA based on two-space decomposition (TSD) to solve LSMOPs. The main idea of the algorithm is to decompose the objective space and decision space into multiple subspaces, each of which is expected to contain some complete Pareto-optimal solutions, and then use multiple populations to conduct parallel searches in these subspaces. Specifically, the objective space decomposition approach adopts the traditional reference vector-based method, whereas the decision space decomposition approach adopts the proposed method based on a diversity design subspace (DDS). The algorithm uses a message passing interface (MPI) to implement its parallel environment. The experimental results demonstrate the effectiveness of the proposed DDS-based method. Compared with the state-of-the-art MOEAs in solving various benchmark and real-world problems, the proposed algorithm exhibits advantages in terms of general performance and computational efficiency.

11 December 2018
Verified
Book Chapter
Open access
PDF file
LWLiangxiong Wei
Liangxiong Wei
WSWeijie Sun
Weijie Sun
HCHaixiang Chen
Haixiang Chen
YPYuan Ping
Yuan Ping
FYFeng Yin
Feng Yin
LCLiangyin Chen
Liangyin Chen
The existing deterministic neighbor discovery algorithms in WSNs ensure that successful discovery can be obtained within a certain time, but the average discovery delay is long. It is difficult to meet the need for rapid discovery in mobile low duty cycle environments. This paper proposes a group-based fast neighbor discovery algorithm (GBFA). By carrying neighbor information in beacon packet, GBFA knows in advance some potential neighbors and select more energy efficient potential neighbors and actively make nodes wake up to verify whether these potential neighbors are true neighbors, thereby speeding up neighbor discovery and improving energy utilization efficiency. The evaluation results indicate the mean delay and extra energy consumption of the GBFA algorithm are lower than Group-based method up to \(10.58\%\) and \(18.88\%\) respectively.