scholarly journals Lévy-Flight Krill Herd Algorithm

2013 ◽  
Vol 2013 ◽  
pp. 1-14 ◽  
Author(s):  
Gaige Wang ◽  
Lihong Guo ◽  
Amir Hossein Gandomi ◽  
Lihua Cao ◽  
Amir Hossein Alavi ◽  
...  
Keyword(s):  
Optimization Problems ◽  
Computing Time ◽  
Optimization Methods ◽  
Population Based ◽  
Global Optimum ◽  
Lévy Flight ◽  
Levy Flight ◽  
Krill Herd Algorithm ◽  
Krill Herd ◽  
Elitism Scheme

To improve the performance of the krill herd (KH) algorithm, in this paper, a Lévy-flight krill herd (LKH) algorithm is proposed for solving optimization tasks within limited computing time. The improvement includes the addition of a new local Lévy-flight (LLF) operator during the process when updating krill in order to improve its efficiency and reliability coping with global numerical optimization problems. The LLF operator encourages the exploitation and makes the krill individuals search the space carefully at the end of the search. The elitism scheme is also applied to keep the best krill during the process when updating the krill. Fourteen standard benchmark functions are used to verify the effects of these improvements and it is illustrated that, in most cases, the performance of this novel metaheuristic LKH method is superior to, or at least highly competitive with, the standard KH and other population-based optimization methods. Especially, this new method can accelerate the global convergence speed to the true global optimum while preserving the main feature of the basic KH.

scholarly journals Simulated Annealing-Based Krill Herd Algorithm for Global Optimization

2013 ◽  
Vol 2013 ◽  
pp. 1-11 ◽  
Author(s):  
Gai-Ge Wang ◽  
Lihong Guo ◽  
Amir Hossein Gandomi ◽  
Amir Hossein Alavi ◽  
Hong Duan
Keyword(s):  
Global Optimization ◽  
Simulated Annealing ◽  
Optimization Problems ◽  
Optimization Methods ◽  
Greedy Strategy ◽  
Krill Herd Algorithm ◽  
Krill Herd ◽  
Low Probability ◽  
Elitism Scheme ◽  
Reliability And Robustness

Recently, Gandomi and Alavi proposed a novel swarm intelligent method, called krill herd (KH), for global optimization. To enhance the performance of the KH method, in this paper, a new improved meta-heuristic simulated annealing-based krill herd (SKH) method is proposed for optimization tasks. A new krill selecting (KS) operator is used to refine krill behavior when updating krill’s position so as to enhance its reliability and robustness dealing with optimization problems. The introduced KS operator involves greedy strategy and accepting few not-so-good solutions with a low probability originally used in simulated annealing (SA). In addition, a kind of elitism scheme is used to save the best individuals in the population in the process of the krill updating. The merits of these improvements are verified by fourteen standard benchmarking functions and experimental results show that, in most cases, the performance of this improved meta-heuristic SKH method is superior to, or at least highly competitive with, the standard KH and other optimization methods.

scholarly journals Modified Bat Algorithm Based on Lévy Flight and Opposition Based Learning

2016 ◽  
Vol 2016 ◽  
pp. 1-13 ◽  
Author(s):  
Xian Shan ◽  
Kang Liu ◽  
Pei-Liang Sun
Keyword(s):  
Large Scale ◽  
Optimization Problems ◽  
Real Life ◽  
Bat Algorithm ◽  
Global Optimum ◽  
Lévy Flight ◽  
Levy Flight ◽  
Local Optima ◽  
Opposition Based Learning ◽  
Modified Bat Algorithm

Bat Algorithm (BA) is a swarm intelligence algorithm which has been intensively applied to solve academic and real life optimization problems. However, due to the lack of good balance between exploration and exploitation, BA sometimes fails at finding global optimum and is easily trapped into local optima. In order to overcome the premature problem and improve the local searching ability of Bat Algorithm for optimization problems, we propose an improved BA called OBMLBA. In the proposed algorithm, a modified search equation with more useful information from the search experiences is introduced to generate a candidate solution, and Lévy Flight random walk is incorporated with BA in order to avoid being trapped into local optima. Furthermore, the concept of opposition based learning (OBL) is embedded to BA to enhance the diversity and convergence capability. To evaluate the performance of the proposed approach, 16 benchmark functions have been employed. The results obtained by the experiments demonstrate the effectiveness and efficiency of OBMLBA for global optimization problems. Comparisons with some other BA variants and other state-of-the-art algorithms have shown the proposed approach significantly improves the performance of BA. Performances of the proposed algorithm on large scale optimization problems and real world optimization problems are not discussed in the paper, and it will be studied in the future work.

An Adaptive Location-Aware Swarm Intelligence Optimization Algorithm

2021 ◽  
Vol 29 (02) ◽  
pp. 249-279
Author(s):  
Shenghao Jiang ◽  
Saeed Mashdoor ◽  
Hamid Parvin ◽  
Bui Anh Tuan ◽  
Kim-Hung Pho
Keyword(s):  
Optimization Algorithm ◽  
Heuristic Algorithms ◽  
Optimization Problems ◽  
Optimization Methods ◽  
Population Based ◽  
Global Optimum ◽  
Mathematical Programming Problem ◽  
Initial Population ◽  
Instinctive Behavior ◽  
Conventional Optimization

Optimization is an important and decisive task in science. Many optimization problems in science are naturally too complicated and difficult to be modeled and solved by the conventional optimization methods such as mathematical programming problem solvers. Meta-heuristic algorithms that are inspired by nature have started a new era in computing theory to solve the optimization problems. The paper seeks to find an optimization algorithm that learns the expected quality of different places gradually and adapts its exploration-exploitation dilemma to the location of an individual. Using birds’ classical conditioning learning behavior, in this paper, a new particle swarm optimization algorithm has been introduced where particles can learn to perform a natural conditioning behavior towards an unconditioned stimulus. Particles are divided into multiple categories in the problem space and if any of them finds the diversity of its category to be low, it will try to go towards its best personal experience. But if the diversity among the particles of its category is high, it will try to be inclined to the global optimum of its category. We have also used the idea of birds’ sensitivity to the space in which they fly and we have tried to move the particles more quickly in improper spaces so that they would depart these spaces as fast as possible. On the contrary, we reduced the particles’ speed in valuable spaces in order to let them explore those places more. In the initial population, the algorithm has used the instinctive behavior of birds to provide a population based on the particles’ merits. The proposed method has been implemented in MATLAB and the results have been divided into several subpopulations or parts. The proposed method has been compared to the state-of-the-art methods. It has been shown that the proposed method is a consistent algorithm for solving the static optimization problems.

Comparision of the political optimization algorithm, the Archimedes optimization algorithm and the Levy flight algorithm for design optimization in industry

2021 ◽  
Vol 63 (4) ◽  
pp. 356-359
Author(s):  
Betül Sultan Yıldız ◽  
Nantiwat Pholdee ◽  
Sujin Bureerat ◽  
Mehmet Umut Erdaş ◽  
Ali Rıza Yıldız ◽  
...  
Keyword(s):  
Topology Optimization ◽  
Optimization Algorithm ◽  
Optimization Problems ◽  
Optimization Methods ◽  
The Political ◽  
Lévy Flight ◽  
Levy Flight ◽  
Industrial Companies ◽  
And Topology ◽  
Product Costs

Abstract This article focuses on minimizing product costs by using the newly developed political optimization algorithm (POA), the Archimedes ‘optimization algorithm(AOA), and the Levy flight algorithm(LFA) in product development processes. Three structural optimization methods, size optimization, shape optimization, and topology optimization, are extensively applied to create inexpensive structures and render designs efficient. Using size, shape, and topology optimization in an integrated way, It is possible to obtain the most efficient structures in industry. The political optimization algorithm (POA) is a metaheuristic algorithm that can be used to solve many optimization problems. This study investigates the search capability and computational efficiency of POA for optimizing vehicle structures. By examining the results obtained, we prove the apparent superiority of the POA to other recent famous metaheuristics such as the Archimedes optimization algorithm and the Levy flight algorithm. The most important result of this paperwill be to provide an impressive aid for industrial companies to fill the gaps in their product design stages.

Solving Mono- and Multi-Objective Problems Using Hybrid Evolutionary Algorithms and Nelder-Mead Method

2021 ◽  
Vol 12 (4) ◽  
pp. 98-116
Author(s):  
Noureddine Boukhari ◽  
Fatima Debbat ◽  
Nicolas Monmarché ◽  
Mohamed Slimane
Keyword(s):  
Convergence Rate ◽  
Optimization Problem ◽  
Optimization Problems ◽  
State Of The Art ◽  
Hybrid Approach ◽  
Optimization Methods ◽  
Global Optimum ◽  
Stochastic Methods ◽  
Local Optima ◽  
Portfolio Optimization Problem

Evolution strategies (ES) are a family of strong stochastic methods for global optimization and have proved their capability in avoiding local optima more than other optimization methods. Many researchers have investigated different versions of the original evolution strategy with good results in a variety of optimization problems. However, the convergence rate of the algorithm to the global optimum stays asymptotic. In order to accelerate the convergence rate, a hybrid approach is proposed using the nonlinear simplex method (Nelder-Mead) and an adaptive scheme to control the local search application, and the authors demonstrate that such combination yields significantly better convergence. The new proposed method has been tested on 15 complex benchmark functions and applied to the bi-objective portfolio optimization problem and compared with other state-of-the-art techniques. Experimental results show that the performance is improved by this hybridization in terms of solution eminence and strong convergence.

scholarly journals Recent Design Optimization Methods for Energy-Efficient Electric Motors and Derived Requirements for a New Improved Method—Part 1

Proceedings ◽  
2018 ◽  
Vol 2 (22) ◽  
pp. 1400
Author(s):  
Johannes Schmelcher ◽  
Max Kleine Büning ◽  
Kai Kreisköther ◽  
Dieter Gerling ◽  
Achim Kampker
Keyword(s):  
Rare Earth ◽  
Design Optimization ◽  
Energy Efficient ◽  
Degrees Of Freedom ◽  
High Efficiency ◽  
Optimization Problems ◽  
Computing Time ◽  
Optimization Methods ◽  
Electric Motors ◽  
Electric Cars

Energy-efficient electric motors are gathering an increased attention since they are used in electric cars or to reduce operational costs, for instance. Due to their high efficiency, permanent-magnet synchronous motors are used progressively more. However, the need to use rare-earth magnets for such high-efficiency motors is problematic not only in regard to the cost but also in socio-political and environmental aspects. Therefore, an increasing effort has to be put in finding the best design possible. The goals to achieve are, among others, to reduce the amount of rare-earth magnet material but also to increase the efficiency. In the first part of this multipart paper, characteristics of optimization problems in engineering and general methods to solve them are presented. In part two, different approaches to the design optimization problem of electric motors are highlighted. The last part will evaluate the different categories of optimization methods with respect to the criteria: degrees of freedom, computing time and the required user experience. As will be seen, there is a conflict of objectives regarding the criteria mentioned above. Requirements, which a new optimization method has to fulfil in order to solve the conflict of objectives will be presented in this last paper.

Reduced Order Design Optimization of Liquid Cooled Heat Sinks

2021 ◽  
Vol 143 (4) ◽  
Author(s):  
Aniket Ajay Lad ◽  
Kai A. James ◽  
William P. King ◽  
Nenad Miljkovic
Keyword(s):  
Design Optimization ◽  
Power Density ◽  
Building Blocks ◽  
Optimization Methods ◽  
Population Based ◽  
Global Optimum ◽  
Heat Sinks ◽  
Geometrical Parameters ◽  
Power Module ◽  
Reduced Order

Abstract The recent growth in electronics power density has created a significant need for effective thermal management solutions. Liquid-cooled heat sinks or cold plates are typically used to achieve high volumetric power density cooling. A natural tradeoff exists between the thermal and hydraulic performance of a cold plate, creating an opportunity for design optimization. Current design optimization methods rely on computationally expensive and time consuming computational fluid dynamics (CFD) simulations. Here, we develop a rapid design optimization tool for liquid cooled heat sinks based on reduced-order models for the thermal-hydraulic behavior. Flow layout is expressed as a combination of simple building blocks on a divided coarse grid. The flow layout and geometrical parameters are incorporated to optimize designs that can effectively address heterogeneous cooling requirements within electronics packages. We demonstrate that the use of population-based searches for optimal layout selection, while not ensuring a global optimum solution, can provide optimal or near-optimal results for most of the test cases studied. The approach is shown to generate optimal designs within a timescale of 60–120 s. A case study based on cooling of a commercial silicon carbide (SiC) electronics power module is used to demonstrate the application of the developed tool and is shown to improve the performance as compared to an aggressive state-of-the-art single-phase liquid cooling solution by reducing the SiC junction-to-coolant thermal resistance by 25% for the same pressure drop.

scholarly journals An Adaptive Particle Swarm Optimization Algorithm for Unconstrained Optimization

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-18
Author(s):  
Feng Qian ◽  
Mohammad Reza Mahmoudi ◽  
Hamïd Parvïn ◽  
Kim-Hung Pho ◽  
Bui Anh Tuan
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Optimization Methods ◽  
Global Optimum ◽  
Initial Population ◽  
Swarm Optimization ◽  
Conventional Optimization

Conventional optimization methods are not efficient enough to solve many of the naturally complicated optimization problems. Thus, inspired by nature, metaheuristic algorithms can be utilized as a new kind of problem solvers in solution to these types of optimization problems. In this paper, an optimization algorithm is proposed which is capable of finding the expected quality of different locations and also tuning its exploration-exploitation dilemma to the location of an individual. A novel particle swarm optimization algorithm is presented which implements the conditioning learning behavior so that the particles are led to perform a natural conditioning behavior on an unconditioned motive. In the problem space, particles are classified into several categories so that if a particle lies within a low diversity category, it would have a tendency to move towards its best personal experience. But, if the particle’s category is with high diversity, it would have the tendency to move towards the global optimum of that category. The idea of the birds’ sensitivity to its flying space is also utilized to increase the particles’ speed in undesired spaces in order to leave those spaces as soon as possible. However, in desirable spaces, the particles’ velocity is reduced to provide a situation in which the particles have more time to explore their environment. In the proposed algorithm, the birds’ instinctive behavior is implemented to construct an initial population randomly or chaotically. Experiments provided to compare the proposed algorithm with the state-of-the-art methods show that our optimization algorithm is one of the most efficient and appropriate ones to solve the static optimization problems.

A Chaotic Krill Herd Algorithm for Optimal Solution of the Economic Dispatch Problem

2017 ◽  
Vol 31 ◽  
pp. 155-168 ◽  
Author(s):  
Bachir Bentouati ◽  
Saliha Chettih ◽  
Ragab Abdel-Aziz El-Sehiemy
Keyword(s):  
Optimization Problem ◽  
Economic Dispatch ◽  
Optimal Solution ◽  
Operating Conditions ◽  
Krill Herd Algorithm ◽  
Krill Herd ◽  
Conflicting Objectives ◽  
Metaheuristic Search ◽  
Elitism Scheme ◽  
Planning And Operation

The aim of economic dispatch (ED) problem is to provide an efficient utilization of energy resources to produce economic and secure operating conditions for the planning and operation of a power system. ED is formed as a nonlinear optimization problem with conflicting objectives and subjected to both inequality and equality constraints. An efficient improvement of krill herd (KH) algorithm, a powerful metaheuristic method, has been introduced in this paper. The KH algorithm inspired by the Lagrangian and evolutionary behaviour of the krill people in nature, has been investigated to solve ED problem on 6, 13, 20 and 40 generating units. The proposed chaotic krill herd (CKH)) improvement is done by incorporating the chaos approach to KH algorithm for raising the global convergence speed and for enhancing its performance. The elitism scheme serves to save the best krill during the procedure when updating the krill. The results show clearly the superiority of CKH in searching for the best cost value results when compared with well-known metaheuristic search algorithms.

Sign in / Sign up

Export Citation Format

Share Document