Browse
Submit Data
Databases
API
Help

Dataset Information

39 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

An improved Wolf pack algorithm for optimization problems: Design and evaluation.

ABSTRACT: Wolf Pack Algorithm (WPA) is a swarm intelligence algorithm that simulates the food searching process of wolves. It is widely used in various engineering optimization problems due to its global convergence and computational robustness. However, the algorithm has some weaknesses such as low convergence speed and easily falling into local optimum. To tackle the problems, we introduce an improved approach called OGL-WPA in this work, based on the employments of Opposition-based learning and Genetic algorithm with Levy's flight. Specifically, in OGL-WPA, the population of wolves is initialized by opposition-based learning to maintain the diversity of the initial population during global search. Meanwhile, the leader wolf is selected by genetic algorithm to avoid falling into local optimum and the round-up behavior is optimized by Levy's flight to coordinate the global exploration and local development capabilities. We present the detailed design of our algorithm and compare it with some other nature-inspired metaheuristic algorithms using various classical test functions. The experimental results show that the proposed algorithm has better global and local search capability, especially in the presence of multi-peak and high-dimensional functions.

SUBMITTER: Chen X

PROVIDER: S-EPMC8389437 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Similar Datasets

Flexible Wolf Pack Algorithm for Dynamic Multidimensional Knapsack Problems.

Project description:Optimization problems especially in a dynamic environment is a hot research area that has attracted notable attention in the past decades. It is clear from the dynamic optimization literatures that most of the efforts have been devoted to continuous dynamic optimization problems although the majority of the real-life problems are combinatorial. Moreover, many algorithms shown to be successful in stationary combinatorial optimization problems commonly have mediocre performance in a dynamic environment. In this study, based on binary wolf pack algorithm (BWPA), combining with flexible population updating strategy, a flexible binary wolf pack algorithm (FWPA) is proposed. Then, FWPA is used to solve a set of static multidimensional knapsack benchmarks and several dynamic multidimensional knapsack problems, which have numerous practical applications. To the best of our knowledge, this paper constitutes the first study on the performance of WPA on a dynamic combinatorial problem. By comparing two state-of-the-art algorithms with the basic BWPA, the simulation experimental results demonstrate that FWPA can be considered as a feasibility and competitive algorithm for dynamic optimization problems.

| S-EPMC7049380 | biostudies-literature

A hybrid algorithm of grey wolf optimizer and harris hawks optimization for solving global optimization problems with improved convergence performance.

Project description:The grey wolf optimizer is an effective and well-known meta-heuristic algorithm, but it also has the weaknesses of insufficient population diversity, falling into local optimal solutions easily, and unsatisfactory convergence speed. Therefore, we propose a hybrid grey wolf optimizer (HGWO), based mainly on the exploitation phase of the harris hawk optimization. It also includes population initialization with Latin hypercube sampling, a nonlinear convergence factor with local perturbations, some extended exploration strategies. In HGWO, the grey wolves can have harris hawks-like flight capabilities during position updates, which greatly expands the search range and improves global searchability. By incorporating a greedy algorithm, grey wolves will relocate only if the new location is superior to the current one. This paper assesses the performance of the hybrid grey wolf optimizer (HGWO) by comparing it with other heuristic algorithms and enhanced schemes of the grey wolf optimizer. The evaluation is conducted using 23 classical benchmark test functions and CEC2020. The experimental results reveal that the HGWO algorithm performs well in terms of its global exploration ability, local exploitation ability, convergence speed, and convergence accuracy. Additionally, the enhanced algorithm demonstrates considerable advantages in solving engineering problems, thus substantiating its effectiveness and applicability.

| S-EPMC10739963 | biostudies-literature

An Adaptive, Discrete Space Oriented Wolf Pack Optimization Algorithm for a Movable Wireless Sensor Network.

Project description:Recently, many related algorithms have been proposed to find an efficient wireless sensor network with good sustainability, a stable connection, and a high covering rate. To further improve the coverage rate of movable wireless sensor networks under the condition of guaranteed connectivity, this paper proposes an adaptive, discrete space oriented wolf pack optimization algorithm for a movable wireless sensor network (DSO-WPOA). Firstly, a strategy of adaptive expansion based on a minimum overlapping full-coverage model is designed to achieve minimum overlap and no-gap coverage for the monitoring area. Moreover, the adaptive shrinking grid search wolf pack optimization algorithm (ASGS-CWOA) is improved to optimize the movable wireless sensor network, which is a discrete space oriented problem. This improvement includes the usage of a target-node probability matrix and the design of an adaptive step size method, both of which work together to enhance the convergence speed and global optimization ability of the algorithm. Theoretical research and experimental results indicate that compared with the coverage algorithm based on particle swarm optimization (PSO-WSN) and classical virtual force algorithm, the newly proposed algorithm possesses the best coverage rate, better stability, acceptable performance in terms of time, advantages in energy savings, and no gaps.

| S-EPMC6806117 | biostudies-literature

AOBLMOA: A Hybrid Biomimetic Optimization Algorithm for Numerical Optimization and Engineering Design Problems.

Project description:The Mayfly Optimization Algorithm (MOA), as a new biomimetic metaheuristic algorithm with superior algorithm framework and optimization methods, plays a remarkable role in solving optimization problems. However, there are still shortcomings of convergence speed and local optimization in this algorithm. This paper proposes a metaheuristic algorithm for continuous and constrained global optimization problems, which combines the MOA, the Aquila Optimizer (AO), and the opposition-based learning (OBL) strategy, called AOBLMOA, to overcome the shortcomings of the MOA. The proposed algorithm first fuses the high soar with vertical stoop method and the low flight with slow descent attack method in the AO into the position movement process of the male mayfly population in the MOA. Then, it incorporates the contour flight with short glide attack and the walk and grab prey methods in the AO into the positional movement of female mayfly populations in the MOA. Finally, it replaces the gene mutation behavior of offspring mayfly populations in the MOA with the OBL strategy. To verify the optimization ability of the new algorithm, we conduct three sets of experiments. In the first experiment, we apply AOBLMOA to 19 benchmark functions to test whether it is the optimal strategy among multiple combined strategies. In the second experiment, we test AOBLMOA by using 30 CEC2017 numerical optimization problems and compare it with state-of-the-art metaheuristic algorithms. In the third experiment, 10 CEC2020 real-world constrained optimization problems are used to demonstrate the applicability of AOBLMOA to engineering design problems. The experimental results show that the proposed AOBLMOA is effective and superior and is feasible in numerical optimization problems and engineering design problems.

| S-EPMC10452254 | biostudies-literature

Pufferfish Optimization Algorithm: A New Bio-Inspired Metaheuristic Algorithm for Solving Optimization Problems.

Project description:A new bio-inspired metaheuristic algorithm named the Pufferfish Optimization Algorithm (POA), that imitates the natural behavior of pufferfish in nature, is introduced in this paper. The fundamental inspiration of POA is adapted from the defense mechanism of pufferfish against predators. In this defense mechanism, by filling its elastic stomach with water, the pufferfish becomes a spherical ball with pointed spines, and as a result, the hungry predator escapes from this threat. The POA theory is stated and then mathematically modeled in two phases: (i) exploration based on the simulation of a predator's attack on a pufferfish and (ii) exploitation based on the simulation of a predator's escape from spiny spherical pufferfish. The performance of POA is evaluated in handling the CEC 2017 test suite for problem dimensions equal to 10, 30, 50, and 100. The optimization results show that POA has achieved an effective solution with the appropriate ability in exploration, exploitation, and the balance between them during the search process. The quality of POA in the optimization process is compared with the performance of twelve well-known metaheuristic algorithms. The simulation results show that POA provides superior performance by achieving better results in most of the benchmark functions in order to solve the CEC 2017 test suite compared to competitor algorithms. Also, the effectiveness of POA to handle optimization tasks in real-world applications is evaluated on twenty-two constrained optimization problems from the CEC 2011 test suite and four engineering design problems. Simulation results show that POA provides effective performance in handling real-world applications by achieving better solutions compared to competitor algorithms.

| S-EPMC10887113 | biostudies-literature

Interaction prediction optimization in multidisciplinary design optimization problems.

Project description:The distributed strategy of Collaborative Optimization (CO) is suitable for large-scale engineering systems. However, it is hard for CO to converge when there is a high level coupled dimension. Furthermore, the discipline objectives cannot be considered in each discipline optimization problem. In this paper, one large-scale systems control strategy, the interaction prediction method (IPM), is introduced to enhance CO. IPM is utilized for controlling subsystems and coordinating the produce process in large-scale systems originally. We combine the strategy of IPM with CO and propose the Interaction Prediction Optimization (IPO) method to solve MDO problems. As a hierarchical strategy, there are a system level and a subsystem level in IPO. The interaction design variables (including shared design variables and linking design variables) are operated at the system level and assigned to the subsystem level as design parameters. Each discipline objective is considered and optimized at the subsystem level simultaneously. The values of design variables are transported between system level and subsystem level. The compatibility constraints are replaced with the enhanced compatibility constraints to reduce the dimension of design variables in compatibility constraints. Two examples are presented to show the potential application of IPO for MDO.

| S-EPMC3950588 | biostudies-other

Belief Propagation Algorithm for Portfolio Optimization Problems.

Project description:The typical behavior of optimal solutions to portfolio optimization problems with absolute deviation and expected shortfall models using replica analysis was pioneeringly estimated by S. Ciliberti et al. [Eur. Phys. B. 57, 175 (2007)]; however, they have not yet developed an approximate derivation method for finding the optimal portfolio with respect to a given return set. In this study, an approximation algorithm based on belief propagation for the portfolio optimization problem is presented using the Bethe free energy formalism, and the consistency of the numerical experimental results of the proposed algorithm with those of replica analysis is confirmed. Furthermore, the conjecture of H. Konno and H. Yamazaki, that the optimal solutions with the absolute deviation model and with the mean-variance model have the same typical behavior, is verified using replica analysis and the belief propagation algorithm.

| S-EPMC4549256 | biostudies-literature

Firefly Mating Algorithm for Continuous Optimization Problems.

Project description:This paper proposes a swarm intelligence algorithm, called firefly mating algorithm (FMA), for solving continuous optimization problems. FMA uses genetic algorithm as the core of the algorithm. The main feature of the algorithm is a novel mating pair selection method which is inspired by the following 2 mating behaviors of fireflies in nature: (i) the mutual attraction between males and females causes them to mate and (ii) fireflies of both sexes are of the multiple-mating type, mating with multiple opposite sex partners. A female continues mating until her spermatheca becomes full, and, in the same vein, a male can provide sperms for several females until his sperm reservoir is depleted. This new feature enhances the global convergence capability of the algorithm. The performance of FMA was tested with 20 benchmark functions (sixteen 30-dimensional functions and four 2-dimensional ones) against FA, ALC-PSO, COA, MCPSO, LWGSODE, MPSODDS, DFOA, SHPSOS, LSA, MPDPGA, DE, and GABC algorithms. The experimental results showed that the success rates of our proposed algorithm with these functions were higher than those of other algorithms and the proposed algorithm also required fewer numbers of iterations to reach the global optima.

| S-EPMC5541822 | biostudies-other

Improved multi-objective differential evolution algorithm based on a decomposition strategy for multi-objective optimization problems.

Project description:Many real-world engineering problems need to balance different objectives and can be formatted as multi-objective optimization problem. An effective multi-objective algorithm can achieve a set of optimal solutions that can make a tradeoff between different objectives, which is valuable to further explore and design. In this paper, an improved multi-objective differential evolution algorithm (MOEA/D/DEM) based on a decomposition strategy is proposed to improve the performance of differential evolution algorithm for practical multi-objective nutrition decision problems. Firstly, considering the neighborhood characteristic, a neighbor intimacy factor is designed in the search process for enhancing the diversity of the population, then a new Gaussian mutation strategy with variable step size is proposed to reduce the probability of escaping local optimum area and improve the local search ability. Finally, the proposed algorithm is tested by classic test problems (DTLZ1-7 and WFG1-9) and applied to the multi-objective nutrition decision problems, compared to the other reported multi-objective algorithms, the proposed algorithm has a better search capability and obtained competitive results.

| S-EPMC9729643 | biostudies-literature

A whale optimization algorithm based on atom-like structure differential evolution for solving engineering design problems.

Project description:The whale optimization algorithm has received much attention since its introduction due to its outstanding performance. However, like other algorithms, the whale optimization algorithm still suffers from some classical problems. To address the issues of slow convergence, low optimization precision, and susceptibility to local convergence in the whale optimization algorithm (WOA). Defining the optimization behavior of whale individuals as quantum mechanical behavior, a whale optimization algorithm based on atom-like structure differential evolution (WOAAD) is proposed. Enhancing the spiral update mechanism by introducing a sine strategy guided by the electron orbital center. Improving the random-walk foraging mechanism by applying mutation operations to both the electron orbital center and random individuals. Performing crossover operations between the newly generated individuals from the improved mechanisms and random dimensions, followed by a selection process to retain superior individuals. This accelerates algorithm convergence, enhances optimization precision, and prevents the algorithm from falling into local convergence. Finally, implementing a scouting bee strategy, where whale individuals progressively increase the number of optimization failures within a limited parameter L. When a threshold is reached, random initialization is carried out to enhance population diversity. Conducting simulation experiments to compare the improved algorithm with the whale optimization algorithm, other optimization algorithms, and other enhanced whale optimization algorithms. The experimental results indicate that the improved algorithm significantly accelerates convergence, enhances optimization precision, and prevents the algorithm from falling into local convergence. Applying the improved algorithm to five engineering design problems, the experimental results demonstrate that the improved algorithm exhibits good applicability.

| S-EPMC10774322 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data