Lin Yang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Lin Yang has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Zhe Xu
School of Computer Information and Engineering, Changzhou Institute of Technology, Changzhou 213032, China
6 shared publications - Baohang Zhang
School of Computer Information and Engineering, Changzhou Institute of Technology, Changzhou 213032, China
3 shared publications - Yanting Liu
School Of Software and Big Data, Changzhou College of Information Technology, Changzhou 213164, China
3 shared publications - Fenggang Yuan
School of Computer Information and Engineering, Changzhou Institute of Technology, Changzhou, China
2 shared publications - Guozhong Tian
School of Computer Information and Engineering, Changzhou Institute of Technology, Changzhou 213032, China
2 shared publications - Jiatianyi Yu
Faculty of Engineering, University of Toyama, Toyama-shi, Japan
2 shared publications
Latest Publications
- Open Access
Cross-Swarm Recombination Particle Swarm Optimizer for Offshore Wind Farm Layout and Cable Routing Optimization
Previous studies have applied particle swarm optimization to coupled offshore wind farm layout and cable design and used geometry-guided genetic search to preserve spatial configurations during crossover. Transferring a successful relocation between layouts requires reassessing its wake and cable effects in the receiving layout. We propose cross-swarm recombination particle swarm optimization (CSRPSO) for offshore layouts with embedded capacity-constrained routing under a levelized cost of energy (LCOE) objective. Two swarms use wake interactions and cable connections to guide turbine relocations. Successful relocations are reconstructed in the other swarm’s personal-best layouts and compared with candidates generated from current layouts using complete LCOE evaluations. Six algorithms were compared across eight wind-farm cases over 30 repetitions per case, using matched seeds and initial populations, populations of 30 and 15,000 complete evaluations including initialization. CSRPSO achieved the lowest mean and median LCOE in every case, reducing mean LCOE by 0.041–0.697% versus adaptive replacement strategy-incorporated genetic learning particle swarm optimization (AGPSO), the closest baseline. At 10,000 evaluations, one-third below budget, its mean LCOE was below AGPSO’s final mean in every case. Mean annual energy production exceeded AGPSO’s in all eight cases, and mean cable expenditure was lower in six.
Open AccessCross-Swarm Recombination Particle Swarm Optimizer for Offshore Wind Farm Layout and Cable Routing Optimization
Previous studies have applied particle swarm optimization to coupled offshore wind farm layout and cable design and used geometry-guided genetic search to preserve spatial configurations during crossover. Transferring a successful relocation between layouts requires reassessing its wake and cable effects in the receiving layout. We propose cross-swarm recombination particle swarm optimization (CSRPSO) for offshore layouts with embedded capacity-constrained routing under a levelized cost of energy (LCOE) objective. Two swarms use wake interactions and cable connections to guide turbine relocations. Successful relocations are reconstructed in the other swarm’s personal-best layouts and compared with candidates generated from current layouts using complete LCOE evaluations. Six algorithms were compared across eight wind-farm cases over 30 repetitions per case, using matched seeds and initial populations, populations of 30 and 15,000 complete evaluations including initialization. CSRPSO achieved the lowest mean and median LCOE in every case, reducing mean LCOE by 0.041–0.697% versus adaptive replacement strategy-incorporated genetic learning particle swarm optimization (AGPSO), the closest baseline. At 10,000 evaluations, one-third below budget, its mean LCOE was below AGPSO’s final mean in every case. Mean annual energy production exceeded AGPSO’s in all eight cases, and mean cable expenditure was lower in six.
- Open Access
- 24 August 2026
- Published by Springer Nature in Journal of King Saud University Computer and Information Sciences
- Vol. 38 (7) , 749
Research on industrial defect detection and localization method based on small-sized objects
- 24 August 2026
- Published by Springer Nature in Journal of King Saud University Computer and Information Sciences
- Vol. 38 (7) , 749
Open AccessResearch on industrial defect detection and localization method based on small-sized objects
- Open Access
- 27 November 2025
- Published by Springer Nature in International Journal of Computational Intelligence Systems
- Vol. 19 (1)
An Improved Artificial Bee Colony Algorithm with Differential Analysis and Deduplication for Feature Selection
- 27 November 2025
- Published by Springer Nature in International Journal of Computational Intelligence Systems
- Vol. 19 (1)
Open AccessAn Improved Artificial Bee Colony Algorithm with Differential Analysis and Deduplication for Feature Selection
- 27 February 2025
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 81 (4) , 1-34
An enhanced LSHADE with generalized Pareto distribution selection for escaping local optima
- 27 February 2025
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 81 (4) , 1-34
An enhanced LSHADE with generalized Pareto distribution selection for escaping local optima
- Open Access
- 23 January 2025
- Published by MDPI AG in Electronics
- Vol. 14 (3) , 456
Boston Consulting Group Matrix-Based Equilibrium Optimizer for Numerical Optimization and Dynamic Economic Dispatch
Numerous optimization problems exist in the design and operation of power systems, critical for efficient energy use, cost minimization, and system stability. With increasing energy demand and diversifying energy structures, these problems grow increasingly complex. Metaheuristic algorithms have been highlighted for their flexibility and effectiveness in addressing such complex problems. To further explore the theoretical support of metaheuristic algorithms for optimization problems in power systems, this paper proposes a novel algorithm, the Boston Consulting Group Matrix-based Equilibrium Optimizer (BCGEO), which integrates the Equilibrium Optimizer (EO) with the classic economic decision-making model, the Boston Consulting Group Matrix. This matrix is utilized to construct a model for evaluating the potential of individuals, aiding in the rational allocation of computational resources, thereby achieving a better balance between exploration and exploitation. In comparative experiments across various dimensions on CEC2017, the BCGEO demonstrated superior search performance over its peers. Furthermore, in dynamic economic dispatch, the BCGEO has shown strong optimization capabilities and potential in power system optimization problems. Additionally, the experimental results in the spacecraft trajectory optimization problem suggest its potential for broader application across various fields.
- 23 January 2025
- Published by MDPI AG in Electronics
- Vol. 14 (3) , 456
Open AccessBoston Consulting Group Matrix-Based Equilibrium Optimizer for Numerical Optimization and Dynamic Economic Dispatch
Numerous optimization problems exist in the design and operation of power systems, critical for efficient energy use, cost minimization, and system stability. With increasing energy demand and diversifying energy structures, these problems grow increasingly complex. Metaheuristic algorithms have been highlighted for their flexibility and effectiveness in addressing such complex problems. To further explore the theoretical support of metaheuristic algorithms for optimization problems in power systems, this paper proposes a novel algorithm, the Boston Consulting Group Matrix-based Equilibrium Optimizer (BCGEO), which integrates the Equilibrium Optimizer (EO) with the classic economic decision-making model, the Boston Consulting Group Matrix. This matrix is utilized to construct a model for evaluating the potential of individuals, aiding in the rational allocation of computational resources, thereby achieving a better balance between exploration and exploitation. In comparative experiments across various dimensions on CEC2017, the BCGEO demonstrated superior search performance over its peers. Furthermore, in dynamic economic dispatch, the BCGEO has shown strong optimization capabilities and potential in power system optimization problems. Additionally, the experimental results in the spacecraft trajectory optimization problem suggest its potential for broader application across various fields.
- Open Access
An Improved Equilibrium Optimizer with a Decreasing Equilibrium Pool
Big Data is impacting and changing the way we live, and its core lies in the use of machine learning to extract valuable information from huge amounts of data. Optimization problems are a common problem in many steps of machine learning. In the face of complex optimization problems, evolutionary computation has shown advantages over traditional methods. Therefore, many researchers are working on improving the performance of algorithms for solving various optimization problems in machine learning. The equilibrium optimizer (EO) is a member of evolutionary computation and is inspired by the mass balance model in environmental engineering. Using particles and their concentrations as search agents, it simulates the process of finding equilibrium states for optimization. In this paper, we propose an improved equilibrium optimizer (IEO) based on a decreasing equilibrium pool. IEO provides more sources of information for particle updates and maintains a higher population diversity. It can discard some exploration in later stages to enhance exploitation, thus achieving a better search balance. The performance of IEO is verified using 29 benchmark functions from IEEE CEC2017, a dynamic economic dispatch problem, a spacecraft trajectory optimization problem, and an artificial neural network model training problem. In addition, the changes in population diversity and computational complexity brought by the proposed method are analyzed.
Open AccessAn Improved Equilibrium Optimizer with a Decreasing Equilibrium Pool
Big Data is impacting and changing the way we live, and its core lies in the use of machine learning to extract valuable information from huge amounts of data. Optimization problems are a common problem in many steps of machine learning. In the face of complex optimization problems, evolutionary computation has shown advantages over traditional methods. Therefore, many researchers are working on improving the performance of algorithms for solving various optimization problems in machine learning. The equilibrium optimizer (EO) is a member of evolutionary computation and is inspired by the mass balance model in environmental engineering. Using particles and their concentrations as search agents, it simulates the process of finding equilibrium states for optimization. In this paper, we propose an improved equilibrium optimizer (IEO) based on a decreasing equilibrium pool. IEO provides more sources of information for particle updates and maintains a higher population diversity. It can discard some exploration in later stages to enhance exploitation, thus achieving a better search balance. The performance of IEO is verified using 29 benchmark functions from IEEE CEC2017, a dynamic economic dispatch problem, a spacecraft trajectory optimization problem, and an artificial neural network model training problem. In addition, the changes in population diversity and computational complexity brought by the proposed method are analyzed.