• Journal of Information Processing Systems
• /
• 제18권3호
• /
• pp.332-343
• /
• 2022

To address the problems of the gravitational search algorithm (GSA) in which the population is prone to converge prematurely and fall into the local solution when solving the single-objective optimization problem, a sine map jumping gravity search algorithm based on asynchronous learning is proposed. First, a learning mechanism is introduced into the GSA. The agents keep learning from the excellent agents of the population while they are evolving, thus maintaining the memory and sharing of evolution information, addressing the algorithm's shortcoming in evolution that particle information depends on the current position information only, improving the diversity of the population, and avoiding premature convergence. Second, the sine function is used to map the change of the particle velocity into the position probability to improve the convergence accuracy. Third, the Levy flight strategy is introduced to prevent particles from falling into the local optimization. Finally, the proposed algorithm and other intelligent algorithms are simulated on 18 benchmark functions. The simulation results show that the proposed algorithm achieved improved the better performance.

• 전기전자학회논문지
• /
• 제28권2호
• /
• pp.187-198
• /
• 2024

Estimating the phase boundary in two-phase flow is crucial for designing and optimizing industrial processes. Electrical impedance tomography (EIT) is a promising technique for imaging phase distribution in such flows. This paper proposes using a cuckoo search (CS) optimization algorithm to estimate the phase boundary with EIT. The boundary is parameterized using the Fourier series, and the coefficients are determined by the CS algorithm. The CS algorithm iteratively seeks the phase boundary configuration by minimizing a cost function. Computer simulations and phantom experiments demonstrate the effectiveness of this method in estimating phase boundaries in two-phase flow.