scholarly journals An Improved Flower Pollination Algorithm for Global and Local Optimization

2021 ◽  
Vol 5 (4) ◽  
pp. 461
Author(s):  
M. Iqbal Kamboh ◽  
Nazri Bin Mohd Nawi ◽  
Azizul Azhar Ramli ◽  
Fanni Sukma
Keyword(s):  
Heuristic Algorithms ◽  
Optimization Problems ◽  
Linear Optimization ◽  
Bat Algorithm ◽  
Search Space ◽  
Flower Pollination Algorithm ◽  
Mathematical Functions ◽  
Flower Pollination ◽  
Linear Optimization Problems ◽  
Global And Local Optimization

Meta-heuristic algorithms have emerged as a powerful optimization tool for handling non-smooth complex optimization problems and also to address engineering and medical issues. However, the traditional methods face difficulty in tackling the multimodal non-linear optimization problems within the vast search space. In this paper, the Flower Pollination Algorithm has been improved using Dynamic switch probability to enhance the balance between exploitation and exploration for increasing its search ability, and the swap operator is used to diversify the population, which will increase the exploitation in getting the optimum solution. The performance of the improved algorithm has investigated on benchmark mathematical functions, and the results have been compared with the Standard Flower pollination Algorithm (SFPA), Genetic Algorithm, Bat Algorithm, Simulated annealing, Firefly Algorithm and Modified flower pollination algorithm. The ranking of the algorithms proves that our proposed algorithm IFPDSO has outperformed the above-discussed nature-inspired heuristic algorithms.

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.

A new meta-heuristic optimization algorithm based on a paradigm from physics: string theory

2021 ◽  
Vol 41 (1) ◽  
pp. 1657-1675
Author(s):  
Luis Rodriguez ◽  
Oscar Castillo ◽  
Mario Garcia ◽  
Jose Soria
Keyword(s):  
String Theory ◽  
Optimization Algorithm ◽  
Fuzzy Inference ◽  
Fuzzy Controller ◽  
Optimization Problems ◽  
Flower Pollination Algorithm ◽  
Grey Wolf Optimizer ◽  
Mathematical Functions ◽  
Inference System ◽  
First Case

The main goal of this paper is to outline a new optimization algorithm based on String Theory, which is a relative new area of physics. The String Theory Algorithm (STA) is a nature-inspired meta-heuristic, which is based on studies about a theory stating that all the elemental particles that exist in the universe are strings, and the vibrations of these strings create all particles existing today. The newly proposed algorithm uses equations based on the laws of physics that are stated in String Theory. The main contribution in this proposed method is the new techniques that are devised in order to generate potential solutions in optimization problems, and we are presenting a detailed explanation and the equations involved in the new algorithm in order to solve optimization problems. In this case, we evaluate this new proposed meta-heuristic with three cases. The first case is of 13 traditional benchmark mathematical functions and a comparison with three different meta-heuristics is presented. The three algorithms are: Flower Pollination Algorithm (FPA), Firefly Algorithm (FA) and Grey Wolf Optimizer (GWO). The second case is the optimization of benchmark functions of the CEC 2015 Competition and we are also presenting a statistical comparison of these results with respect to FA and GWO. In addition, we are presenting a third case, which is the optimization of a fuzzy inference system (FIS), specifically finding the optimal design of a fuzzy controller, where the main goal is to optimize the membership functions of the FIS. It is important to mention that we used these study cases in order to analyze the proposed meta-heuristic with: basic problems, complex problems and control problems. Finally, we present the performance, results and conclusions of the new proposed meta-heuristic.

Multirow Intersection Cuts Based on the Infinity Norm

2021 ◽  
Author(s):  
Álinson S. Xavier ◽  
Ricardo Fukasawa ◽  
Laurent Poirrier
Keyword(s):  
Optimization Problems ◽  
Valid Inequalities ◽  
Linear Optimization ◽  
Computational Cost ◽  
General Purpose ◽  
Mixed Integer ◽  
Infinity Norm ◽  
Intersection Cuts ◽  
Linear Optimization Problems ◽  
Mixed Integer Linear Optimization

When generating multirow intersection cuts for mixed-integer linear optimization problems, an important practical question is deciding which intersection cuts to use. Even when restricted to cuts that are facet defining for the corner relaxation, the number of potential candidates is still very large, especially for instances of large size. In this paper, we introduce a subset of intersection cuts based on the infinity norm that is very small, works for relaxations having arbitrary number of rows and, unlike many subclasses studied in the literature, takes into account the entire data from the simplex tableau. We describe an algorithm for generating these inequalities and run extensive computational experiments in order to evaluate their practical effectiveness in real-world instances. We conclude that this subset of inequalities yields, in terms of gap closure, around 50% of the benefits of using all valid inequalities for the corner relaxation simultaneously, but at a small fraction of the computational cost, and with a very small number of cuts. Summary of Contribution: Cutting planes are one of the most important techniques used by modern mixed-integer linear programming solvers when solving a variety of challenging operations research problems. The paper advances the state of the art on general-purpose multirow intersection cuts by proposing a practical and computationally friendly method to generate them.

Sign in / Sign up

Export Citation Format

Share Document