scholarly journals A High-Performance Stochastic Fractal Search Algorithm for Optimal Generation Dispatch Problem

Energies ◽  
2019 ◽  
Vol 12 (9) ◽  
pp. 1796 ◽  
Author(s):  
Ly Huu Pham ◽  
Minh Quan Duong ◽  
Van-Duc Phan ◽  
Thang Trung Nguyen ◽  
Hoang-Nam Nguyen
Keyword(s):  
High Performance ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Stability And Convergence ◽  
Major Influence ◽  
Search Performance ◽  
Solution Quality ◽  
Update Process ◽  
Stochastic Fractal Search Algorithm ◽  
Stochastic Fractal Search

This paper proposes applications of a modified stochastic fractal search algorithm (MSFS) to solve the economic load dispatch problem (ELD) in which valve-point effects, prohibited operating zones, power losses in all conductors, multi-fuel sources and other constraints of power system are taken into consideration. The proposed method is first developed in the study by performing two modifications on two procedures of new solution generation from conventional stochastic fractal search (SFS). The first modification is used to change the strategy of producing new solutions of the first and the second update procedures while the second one is to newly update the worst solutions in the first update process and the best solutions in the second update process. These modifications have major influence on the solution search performance of the proposed method. All improvements of the proposed method can be illustrated by solving and analyzing results from various test systems with different system scales including 3-unit, 6-unit, 10-unit, and 20-unit systems. Comparison of results obtained by MSFS, SFS, and other existing methods indicates that the proposed MSFS method is more effective and robust than compared methods in terms of solution quality, high-quality solution search stability and convergence process. Consequently, the proposed method should be used as a very favorable optimization method for the ELD problem and it should be tried for other optimization problems in electrical engineering.

scholarly journals Binary Spring Search Algorithm for Solving Various Optimization Problems

2021 ◽  
Vol 11 (3) ◽  
pp. 1286 ◽  
Author(s):  
Mohammad Dehghani ◽  
Zeinab Montazeri ◽  
Ali Dehghani ◽  
Om P. Malik ◽  
Ruben Morales-Menendez ◽  
...  
Keyword(s):  
Optimization Algorithm ◽  
High Performance ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Gravitational Search Algorithm ◽  
Bat Algorithm ◽  
Search Space ◽  
Binary Particle Swarm Optimization ◽  
Dragonfly Algorithm ◽  
Grasshopper Optimization Algorithm

One of the most powerful tools for solving optimization problems is optimization algorithms (inspired by nature) based on populations. These algorithms provide a solution to a problem by randomly searching in the search space. The design’s central idea is derived from various natural phenomena, the behavior and living conditions of living organisms, laws of physics, etc. A new population-based optimization algorithm called the Binary Spring Search Algorithm (BSSA) is introduced to solve optimization problems. BSSA is an algorithm based on a simulation of the famous Hooke’s law (physics) for the traditional weights and springs system. In this proposal, the population comprises weights that are connected by unique springs. The mathematical modeling of the proposed algorithm is presented to be used to achieve solutions to optimization problems. The results were thoroughly validated in different unimodal and multimodal functions; additionally, the BSSA was compared with high-performance algorithms: binary grasshopper optimization algorithm, binary dragonfly algorithm, binary bat algorithm, binary gravitational search algorithm, binary particle swarm optimization, and binary genetic algorithm. The results show the superiority of the BSSA. The results of the Friedman test corroborate that the BSSA is more competitive.

scholarly journals Ls-II: An Improved Locust Search Algorithm for Solving Optimization Problems

2018 ◽  
Vol 2018 ◽  
pp. 1-15 ◽  
Author(s):  
Octavio Camarena ◽  
Erik Cuevas ◽  
Marco Pérez-Cisneros ◽  
Fernando Fausto ◽  
Adrián González ◽  
...  
Keyword(s):  
Optimization Problems ◽  
Search Algorithm ◽  
Search Space ◽  
Optimization Method ◽  
Superior Performance ◽  
Solution Quality ◽  
Original Algorithm ◽  
Motion Models ◽  
Search Mechanism ◽  
Solitary Phase

The Locust Search (LS) algorithm is a swarm-based optimization method inspired in the natural behavior of the desert locust. LS considers the inclusion of two distinctive nature-inspired search mechanism, namely, their solitary phase and social phase operators. These interesting search schemes allow LS to overcome some of the difficulties that commonly affect other similar methods, such as premature convergence and the lack of diversity on solutions. Recently, computer vision experiments in insect tracking methods have conducted to the development of more accurate locust motion models than those produced by simple behavior observations. The most distinctive characteristic of such new models is the use of probabilities to emulate the locust decision process. In this paper, a modification to the original LS algorithm, referred to as LS-II, is proposed to better handle global optimization problems. In LS-II, the locust motion model of the original algorithm is modified incorporating the main characteristics of the new biological formulations. As a result, LS-II improves its original capacities of exploration and exploitation of the search space. In order to test its performance, the proposed LS-II method is compared against several the state-of-the-art evolutionary methods considering a set of benchmark functions and engineering problems. Experimental results demonstrate the superior performance of the proposed approach in terms of solution quality and robustness.

scholarly journals Identification of an Epidemiological Model to Simulate the COVID-19 Epidemic Using Robust Multiobjective Optimization and Stochastic Fractal Search

2020 ◽  
Vol 2020 ◽  
pp. 1-8
Author(s):  
Fran Sérgio Lobato ◽  
Gustavo Barbosa Libotte ◽  
Gustavo Mendes Platt
Keyword(s):  
Multiobjective Optimization ◽  
Optimization Problem ◽  
Search Algorithm ◽  
Real Data ◽  
The Novel ◽  
Estimation Process ◽  
Design Variables ◽  
Novel Coronavirus ◽  
Stochastic Fractal Search Algorithm ◽  
Stochastic Fractal Search

Traditionally, the identification of parameters in the formulation and solution of inverse problems considers that models, variables, and mathematical parameters are free of uncertainties. This aspect simplifies the estimation process, but does not consider the influence of relatively small changes in the design variables in terms of the objective function. In this work, the SIDR (Susceptible, Infected, Dead, and Recovered) model is used to simulate the dynamic behavior of the novel coronavirus disease (COVID-19), and its parameters are estimated by formulating a robust inverse problem, that is, considering the sensitivity of design variables. For this purpose, a robust multiobjective optimization problem is formulated, considering the minimization of uncertainties associated with the estimation process and the maximization of the robustness parameter. To solve this problem, the Multiobjective Stochastic Fractal Search algorithm is associated with the Effective Mean concept for the evaluation of robustness. The results obtained considering real data of the epidemic in China demonstrate that the evaluation of the sensitivity of the design variables can provide more reliable results.

Sign in / Sign up

Export Citation Format

Share Document