Evaluation of stochastic global optimization methods for modeling vapor–liquid equilibrium data

A reconsideration on the resolution of phase stability analysis using stochastic global optimization methods: Proposal of a reliable set of benchmark problems

Application of fast analytical approach and AI optimization techniques to hydraulic fracture stage placement in shale gas reservoirs

The optimal power flow (OPF) problem was introduced by Carpentier in 1962 as a network constrained economic dispatch problem. Since then, it has been intensively studied and widely used in power system operation and planning. In the past few decades, many stochastic optimization methods such as Genetic Algorithm (GA), Evolutionary Programming (EP), and Particle Swarm Optimization (PSO) have been applied to solve the OPF problem. In particular, PSO is a newly proposed population based stochastic optimization algorithm. The main idea behind it is based on the food-searching behavior of birds and fish. Compared with other stochastic optimization methods, PSO has comparable or even superior search performance for some hard optimization problems in real power systems. Nowadays, some modifications such as breeding and selection operators are considered to make the PSO superior and robust. In this paper, we propose the Modified PSO (MPSO), in which the mutation operator of GA is incorporated into the conventional PSO to improve the search performance. To verify the optimal solution searching ability, the proposed approach has been evaluated on an IEEE 30-bus test system. The results showed that performance of the proposed approach is better than that of the standard PSO.

This paper presents a hybrid optimization strategy for wideband antenna design that leverages the strengths of both Random Forest (RF) and Differential Evolution (DE) algorithms. The strategy employs DE for iteratively updating antenna parameters and RF for feature selection in the process of antenna performance optimization. Initially, DE is applied to update antenna parameters for a predetermined number of iterations, generating a dataset of antenna performance metrics. This dataset is then used to train an RF model, which identifies the importance of each design variable. Feature selection, guided by the RF-derived importance, is applied to reduce the dimensionality of the search space. DE subsequently continues the optimization process within this reduced parameter space. Validation of this hybrid approach is performed through the design of a wideband slot antenna and compared against standalone DE, Genetic Algorithm (GA), Particle Swarm Optimization (PSO), and Simulated Annealing (SA). Results demonstrate that the proposed strategy significantly accelerates convergence, achieving the target reflection coefficient and gain with substantially fewer iterations than the other methods (reductions of 75.56%, 45%, 42.11%, and 50% compared to DE, GA, SA, and PSO, respectively). Furthermore, the hybrid strategy consistently finds superior solutions exhibiting lower loss values compared to the benchmark algorithms. The method offers a computationally efficient, interpretable, and effective approach to antenna optimization.

A comparative study of various meta-heuristic techniques applied to the multilevel thresholding problem

Performance of different metaheuristics in EEG source localization compared to the Cramér–Rao bound

This chapter describes and discusses stochastic optimization methods for solving problems involved in process intensification, given an emphasis in multiobjective optimization due to its increasing importance in the chemical engineering community. A brief description of the multiobjective optimization strategies such as genetic algorithms, simulated annealing, tabu search, differential evolution, ant colony and particle swarm optimization is provided, including several applications of evolutionary optimization methods in the intensification of separation processes.

The research and development of metaheuristic methods are critical issues in computer science. In the past decade, metaheuristic algorithms have been used in many engineering applications such as optimization of engineering problems, telecommunications, information security, and image processing. Many metaheuristic algorithms such as particle swarm optimization (PSO), ant colony optimization (ACO), and genetic algorithm (GA) are recently becoming very popular.There are many studies conducted in the literature on the comparison of PSO with other metaheuristic algorithms. In this chapter, various studies carried out between the years of 2010 and 2020 about the comparison of PSO with the other metaheuristic algorithms will be examined. The metaheuristic algorithms to be considered are simulated annealing (SA), genetic algorithm (GA), differential evolution (DE), ant colony optimization (ACO), artificial bee colony (ABC) algorithm, particle swarm optimization (PSO), tabu search (TS), harmony search (HS), firefly algorithm (FF), cuckoo search (CS), bat-inspired algorithm (BA), water wave optimization (WWO), clonal selection algorithm (CLONALG), chemical reaction optimization (CRO), sine cosine algorithm (SCA), glowworm swarm optimization (GSO), and grey wolf optimizer (GWO). This study aims to evaluate and analyze the covered papers according to several criteria such as (a) rates of studies according to publishing years, (b) the metaheuristic algorithms that are compared to PSO, (c) performance evaluation of compared algorithms, (d) the metaheuristic algorithms with their inspirational approaches and their initial proposed studies and years, (e) the field of subjects where the algorithms are applied in the reviewed studies, and (f) used databases in the examined studies.This study is a comprehensive literature review of the comparison of PSO with the most popular metaheuristic algorithms. The intention of this review is to be useful for researchers who want to conduct a survey on this area of the subject as this chapter will cover the essential and helpful analysis of the related research.

A novel dynamic recirculating apparatus for vapour–liquid equilibrium measurements at moderate pressures and temperatures

An implementation of differential evolution algorithm for inversion of geoelectrical data

Orthogonal variable spreading factor (OVSF) codes are widely used to provide variable data rates for supporting different bandwidth requirements in wideband code division multiple access (WCDMA) systems. Many works in the literature have intensively investigated to find an optimal dynamic code assignment scheme for OVSF codes. Unlike earlier studies, which assign OVSF codes using conventional (CCA) or dynamic (DCA) code allocation schemes, in this paper, stochastic optimization methods which are genetic algorithm (GA) and simulated annealing (SA) were applied which population is adaptively constructed according to existing traffic density in the OVSF code-tree. Also, the influences of the GA (selection, crossover and mutation techniques) and the SA (cooling schedules, number of inner loop) parameters were examined on the dynamic OVSF code allocation problem. Simulation results show that the GA and SA provide reduced code blocking probability and improved spectral efficiency when compared to the CCA and DCA schemes.

Achieving high stable Power Transfer Efficiency (PTE) in Wireless Power Transfer (WPT) systems remains challenging due to the nonlinear, multimodal nature of the optimization space. Conventional algorithms such as Genetic Algorithms (GA), Differential Evolution (DE), and Simulated Annealing (SA) often face premature convergence, sensitivity to parameter settings, and inconsistent performance across runs. To overcome these issues, this study introduces the Evolutionary-Swarm Hybrid Algorithm (ESHA), which integrates DE for directional exploration, GA crossover for population diversity, SA for adaptive convergence, and Lévy Flights for stochastic global search. ESHA was implemented on a WPT system with a fixed 20 cm transmission distance and compared with GA, DE, and SA using three performance indicators: PTE, convergence speed, and computational efficiency. Results show that ESHA achieved a maximum PTE of 97.18%, surpassing GA (96.81%), DE (96.65%), and SA (96.19%), while maintaining zero variance across independent runs. It converged in an average of 31.2 iterations, slightly faster than GA (33.15) and SA (32.1), and comparable to DE (31.3). Execution time was 0.4738 s, close to GA (0.4654 s) and only marginally higher than DE (0.4262 s) and SA (0.4329 s). Statistical validation confirmed significant improvements in PTE (p < 0.05).

Fuel cells are complex multiphysical systems characterized by a stratified geometry consisting of thin layers of different materials. Their full characterization involves a number of physical parameters, which are important for quantifying and comparing the performance of the materials. The physical parameters are also used in fuel cell models, which allow the fast exploration of different operating scenarios and can be implemented in optimization procedures aimed at achieving the best structural and operating conditions. The system of equations involved in these models, e.g. the Nernst equation, the Butler-Volmer equation and the diffusion equation, are strongly non-linear; thus, the model itself is extremely sensitive to parameter variations. Careful ex-situ measurements of such parameters can be performed by means of a number of diagnostic techniques, whose results are however not completely consistent with fuel cell operation due to several effects, e.g. variable interactions and boundary effects in the thin layers of the fuel cell. Conversely, “in situ” measurements can provide meaningful operational values, but a very few techniques are available to determine a limited number of parameters.A solution can consist in multiple parameter identification from multiple fundamental measurements, such as polarization curve and electrochemical impedance spectroscopy, performed in different conditions, e.g. at different temperature, pressure, concentration, and humidification.If there is only one unknown parameter, the solution is easy, requiring just a statistical interpolating technique. In the case of multiple unknown parameters, which is the most frequent condition, the problem becomes increasingly difficult as the number of parameters increases as duplicity problem emerges, i.e., several groups of parameters may lead to the same performance (e.g. polarization curve).Recently, a number of numerical tools are under development to face this kind of problems, some based on stochastic mathematical models, each presenting specific features in terms of accuracy, convergence, stability, robustness, and calculation speed [1]. Among the most promising methods, some of which have already been applied to multiple fuel cell parameter identification, are the Ishibashi–Kimura method [2], the Lambert W-function method [3], the Levenberg-Marquardt algorithm (LMA), the Gauss-Newton algorithm (GNA), the hybrid artificial bee colony algorithm [4], the trust region method, the current switching method [5], the simulated annealing method [6], and the particle swarm optimization (PSO) [7], and the differential evolution method [8].The presentation will focus on the application of a particular class of stochastic optimization methods to the problem of multiple parameters identification. These methods have already been widely tested and applied successfully to the simultaneous search of sets of optimal parameters with different physical dimensions, making them ideal tools to cope with the present problem. Their recent relevant literature is vast. They are especially suited for multimodal and noisy functions over large search spaces, which makes them particularly appealing for the problem at hand. The main drawback of such methods is the high number of objective function evaluations needed for convergence; however, thanks to a particular formulation of the PEMFC model, such drawback can be of minor impact, i.e. the overall computational times are on the order of a few tens of seconds.We are going to present the application of two of the most well-known metaheuristic methods, namely Particle Swarm Optimization (PSO) and Differential Evolution (DE), developed in previous work and suitably adapted. It should be noted that PSO has already been applied to parameter identification for FCs, while the application of DE is novel in this context. This is somewhat surprising since, as results will show, DE provides better results and offers higher robustness. We will present the implementation details regarding PSO and DE. The optimization algorithms have not been tuned to the specific problem and algorithm control parameters have been chosen from reasonable values suggested in literature.

Parameter estimation of solar cells and modules using an improved adaptive differential evolution algorithm

Graphic processing units (GPUs) emerged recently as an exciting new hardware environment for a truly parallel implementation and execution of Nature and Bio-inspired Algorithms with excellent price-to-power ratio. In contrast to common multicore CPUs that contain up to tens of independent cores, the GPUs represent a massively parallel single-instruction multiple-data devices that can nowadays reach peak performance of hundreds and thousands of giga floating-point operations per second. Nature and Bio-inspired Algorithms implement parallel optimization strategies in which a single candidate solution, a group of candidate solutions (population), or multiple populations seek for optimal solution or set of solutions of given problem. Genetic algorithms (GA) constitute a family of traditional and very well-known nature-inspired populational meta-heuristic algorithms that have proved its usefulness on a plethora of tasks through the years. Differential evolution (DE) is another efficient populational meta-heuristic algorithm for real-parameter optimization. Particle swarm optimization (PSO) can be seen as nature-inspired multiagent method in which the interaction of simple independent agents yields intelligent collective behavior. Simulated annealing (SA) is global optimization algorithm which combines statistical mechanics and combinatorial optimization with inspiration in metallurgy. This survey provides a brief overview of the latest state-of-the-art research on the design, implementation, and applications of parallel GA, DE, PSO, and SA-based methods on the GPUs.