scholarly journals Automatic Design of Heuristic Algorithms for Binary Optimization Problems

2021 ◽  
Author(s):  
Marcelo de Souza
Keyword(s):  
Optimization Problem ◽  
Heuristic Algorithms ◽  
Optimization Problems ◽  
State Of The Art ◽  
Algorithm Design ◽  
Automatic Design ◽  
Binary Optimization ◽  
Automatic Algorithm ◽  
Better Than ◽  
Design Techniques

In this work we present AutoBQP, a heuristic solver for binary optimization problems. It applies automatic algorithm design techniques to search for the best heuristics for a given optimization problem. Experiments show that the solver can find algorithms which perform better than or comparable to state-of-the-art methods, and can even find new best solutions for some instances of standard benchmark sets.

scholarly journals A new taxonomy of global optimization algorithms

2020 ◽  
Author(s):  
Jörg Stork ◽  
A. E. Eiben ◽  
Thomas Bartz-Beielstein
Keyword(s):  
Optimization Problems ◽  
State Of The Art ◽  
Algorithm Design ◽  
Search Strategies ◽  
Research Field ◽  
Basic Principles ◽  
Surrogate Based Optimization ◽  
Number Of Classes ◽  
Algorithm Generation ◽  
Automatic Algorithm

AbstractSurrogate-based optimization, nature-inspired metaheuristics, and hybrid combinations have become state of the art in algorithm design for solving real-world optimization problems. Still, it is difficult for practitioners to get an overview that explains their advantages in comparison to a large number of available methods in the scope of optimization. Available taxonomies lack the embedding of current approaches in the larger context of this broad field. This article presents a taxonomy of the field, which explores and matches algorithm strategies by extracting similarities and differences in their search strategies. A particular focus lies on algorithms using surrogates, nature-inspired designs, and those created by automatic algorithm generation. The extracted features of algorithms, their main concepts, and search operators, allow us to create a set of classification indicators to distinguish between a small number of classes. The features allow a deeper understanding of components of the search strategies and further indicate the close connections between the different algorithm designs. We present intuitive analogies to explain the basic principles of the search algorithms, particularly useful for novices in this research field. Furthermore, this taxonomy allows recommendations for the applicability of the corresponding algorithms.

scholarly journals NEW HEURISTIC ALGORITHMS FOR ROLLING AIR FRAME AERODYNAMIC PARAMETERS ESTIMATION

Aviation ◽  
2020 ◽  
Vol 24 (1) ◽  
pp. 20-32 ◽  
Author(s):  
Ayham Mohamad ◽  
Jalal Karimi ◽  
Alireza Naderi
Keyword(s):  
Optimization Problem ◽  
Particle Swarm Optimization Algorithm ◽  
Heuristic Algorithms ◽  
Optimization Problems ◽  
Parameters Estimation ◽  
Modified Particle Swarm Optimization ◽  
Smoothing Filter ◽  
Aerodynamic Parameters ◽  
New Strategies ◽  
Better Than

In this research, based on heuristic optimization algorithms, three new strategies are developed for Aerodynamic Parameters Estimation (APE) of one pair ON-OFF actuator rolling airframe. In the 1st method namely EAM-PSO the aerodynamic parameters are directly estimated. While, the next two algorithms called EBM-PSO and SEBM-PSO are two-step strategies. In the 1st step the aerodynamic forces and moments are estimated, then after passing through a designed smoothing filter, in the 2nd step aerodynamic parameters are estimated. In EBM-PSO all the aerodynamic parameters are estimated at once by solving one optimization problem. In SEBM-PSO the APE is converted to solve four separate optimization problems. A modified particle swarm optimization algorithm is developed and used in estimation process. The performance of proposed algorithms is compared with that of state of the art algorithm EKF. The simulation results show that SEBM-PSO and EBM-PSO are better than EAM-PSO in term of accuracy and run time.

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 Parameterized Nonlinear Least Squares for Unsupervised Nonlinear Spectral Unmixing

2019 ◽  
Vol 11 (2) ◽  
pp. 148 ◽  
Author(s):  
Risheng Huang ◽  
Xiaorun Li ◽  
Haiqiang Lu ◽  
Jing Li ◽  
Liaoying Zhao
Keyword(s):  
Least Squares ◽  
Optimization Problem ◽  
Nonnegative Matrix Factorization ◽  
Optimization Problems ◽  
State Of The Art ◽  
Synthetic Data ◽  
Nonnegative Matrix ◽  
Nonlinear Least Squares ◽  
Hyperspectral Data ◽  
Spectral Unmixing

This paper presents a new parameterized nonlinear least squares (PNLS) algorithm for unsupervised nonlinear spectral unmixing (UNSU). The PNLS-based algorithms transform the original optimization problem with respect to the endmembers, abundances, and nonlinearity coefficients estimation into separate alternate parameterized nonlinear least squares problems. Owing to the Sigmoid parameterization, the PNLS-based algorithms are able to thoroughly relax the additional nonnegative constraint and the nonnegative constraint in the original optimization problems, which facilitates finding a solution to the optimization problems . Subsequently, we propose to solve the PNLS problems based on the Gauss–Newton method. Compared to the existing nonnegative matrix factorization (NMF)-based algorithms for UNSU, the well-designed PNLS-based algorithms have faster convergence speed and better unmixing accuracy. To verify the performance of the proposed algorithms, the PNLS-based algorithms and other state-of-the-art algorithms are applied to synthetic data generated by the Fan model and the generalized bilinear model (GBM), as well as real hyperspectral data. The results demonstrate the superiority of the PNLS-based algorithms.

scholarly journals Evolutionary algorithms, swarm intelligence methods, and their applications in water resources engineering: a state-of-the-art review

2020 ◽  
Vol 3 (1) ◽  
pp. 135-188 ◽  
Author(s):  
M. Janga Reddy ◽  
D. Nagesh Kumar
Keyword(s):  
Water Resources ◽  
Evolutionary Algorithms ◽  
Swarm Intelligence ◽  
Water Resource ◽  
Heuristic Algorithms ◽  
Optimization Problems ◽  
State Of The Art ◽  
Real Life ◽  
Distribution Networks ◽  
Water Resources Engineering

Abstract During the last three decades, the water resources engineering field has received a tremendous increase in the development and use of meta-heuristic algorithms like evolutionary algorithms (EA) and swarm intelligence (SI) algorithms for solving various kinds of optimization problems. The efficient design and operation of water resource systems is a challenging task and requires solutions through optimization. Further, real-life water resource management problems may involve several complexities like nonconvex, nonlinear and discontinuous functions, discrete variables, a large number of equality and inequality constraints, and often associated with multi-modal solutions. The objective function is not known analytically, and the conventional methods may face difficulties in finding optimal solutions. The issues lead to the development of various types of heuristic and meta-heuristic algorithms, which proved to be flexible and potential tools for solving several complex water resources problems. This paper provides a review of state-of-the-art methods and their use in planning and management of hydrological and water resources systems. It includes a brief overview of EAs (genetic algorithms, differential evolution, evolutionary strategies, etc.) and SI algorithms (particle swarm optimization, ant colony optimization, etc.), and applications in the areas of water distribution networks, water supply, and wastewater systems, reservoir operation and irrigation systems, watershed management, parameter estimation of hydrological models, urban drainage and sewer networks, and groundwater systems monitoring network design and groundwater remediation. This paper also provides insights, challenges, and need for algorithmic improvements and opportunities for future applications in the water resources field, in the face of rising problem complexities and uncertainties.

Decision Diagram Decomposition for Quadratically Constrained Binary Optimization

2020 ◽  
Author(s):  
David Bergman ◽  
Leonardo Lozano
Keyword(s):  
Benders Decomposition ◽  
Optimization Problems ◽  
State Of The Art ◽  
Cutting Plane Algorithm ◽  
Decision Diagrams ◽  
Quadratic Constraints ◽  
Binary Optimization ◽  
Limited Size ◽  
Quadratic Matrix ◽  
Quadratically Constrained

In recent years the use of decision diagrams within the context of discrete optimization has proliferated. This paper continues this expansion by proposing the use of decision diagrams for modeling and solving binary optimization problems with quadratic constraints. The model proposes the use of multiple decision diagrams to decompose a quadratic matrix so that each individual diagram has provably limited size. The decision diagrams are then linked through channeling constraints to ensure that the solution represented is consistent across the decision diagrams and that the original quadratic constraints are satisfied. The resulting family of decision diagrams are optimized over by a dedicated cutting-plane algorithm akin to Benders decomposition. The approach is general, in that commercial integer programming solvers can readily apply the technique. A thorough experimental evaluation on both benchmark and synthetic instances exhibits that the proposed decision diagram reformulation provides significant improvements over current methods for quadratic constraints in state-of-the-art solvers.

Two Meta-Heuristics for Solving Unconstrained Optimization Problems and Machinery Problems

2014 ◽  
Vol 1044-1045 ◽  
pp. 1418-1423
Author(s):  
Pasura Aungkulanon
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Problem ◽  
Heuristic Algorithms ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Harmony Search ◽  
Particle Swarm ◽  
Finite Sequence ◽  
Swarm Optimization ◽  
Machining Optimization

Machining optimization problem aims to optimize machinery conditions which are important for economic settings. The effective methods for solving these problems using a finite sequence of instructions can be categorized into two groups; exact optimization algorithm and meta-heuristic algorithms. A well-known meta-heuristic approach called Harmony Search Algorithm was used to compare with Particle Swarm Optimization. We implemented and analysed algorithms using unconstrained problems under different conditions included single, multi-peak, curved ridge optimization, and machinery optimization problem. The computational outputs demonstrated the proposed Particle Swarm Optimization resulted in the better outcomes in term of mean and variance of process yields.

An Approach to Determine Important Attributes for Engineering Change Evaluation

2013 ◽  
Vol 135 (4) ◽  
Author(s):  
Chandresh Mehta ◽  
Lalit Patil ◽  
Debasish Dutta
Keyword(s):  
Optimization Problem ◽  
State Of The Art ◽  
Evaluation Criteria ◽  
Engineering Change ◽  
Knowledge Based ◽  
Detailed Evaluation ◽  
Change Impact ◽  
Search Approach ◽  
The Impact ◽  
Better Than

Enterprises plan detailed evaluation of only those engineering change (EC) effects that might have a significant impact. Using past EC knowledge can prove effective in determining whether a proposed EC effect has significant impact. In order to utilize past EC knowledge, it is essential to identify important attributes that should be compared to compute similarity between ECs. This paper presents a knowledge-based approach for determining important EC attributes that should be compared to retrieve similar past ECs so that the impact of proposed EC effect can be evaluated. The problem of determining important EC attributes is formulated as the multi-objective optimization problem. Measures are defined to quantify importance of an attribute set. The knowledge in change database and the domain rules among attribute values are combined for computing the measures. An ant colony optimization (ACO)-based search approach is used for efficiently locating the set of important attributes. An example EC knowledge-base is created and used for evaluating the measures and the overall approach. The evaluation results show that our measures perform better than state-of-the-art evaluation criteria. Our overall approach is evaluated based on manual observations. The results show that our approach correctly evaluates the value of proposed change impact with a success rate of 83.33%.

scholarly journals Stochastic Multiple Chaotic Local Search-Incorporated Gradient-Based Optimizer

2021 ◽  
Vol 2021 ◽  
pp. 1-16
Author(s):  
Hang Yu ◽  
Yu Zhang ◽  
Pengxing Cai ◽  
Junyan Yi ◽  
Sheng Li ◽  
...  
Keyword(s):  
Local Search ◽  
Optimization Problem ◽  
Search Strategy ◽  
State Of The Art ◽  
Population Diversity ◽  
Local Optima ◽  
Gradient Based ◽  
High Level ◽  
Search Rule ◽  
Better Than

In this study, a hybrid metaheuristic algorithm chaotic gradient-based optimizer (CGBO) is proposed. The gradient-based optimizer (GBO) is a novel metaheuristic inspired by Newton’s method which has two search strategies to ensure excellent performance. One is the gradient search rule (GSR), and the other is local escaping operation (LEO). GSR utilizes the gradient method to enhance ability of exploitation and convergence rate, and LEO employs random operators to escape the local optima. It is verified that gradient-based metaheuristic algorithms have obvious shortcomings in exploration. Meanwhile, chaotic local search (CLS) is an efficient search strategy with randomicity and ergodicity, which is usually used to improve global optimization algorithms. Accordingly, we incorporate GBO with CLS to strengthen the ability of exploration and keep high-level population diversity for original GBO. In this study, CGBO is tested with over 30 CEC2017 benchmark functions and a parameter optimization problem of the dendritic neuron model (DNM). Experimental results indicate that CGBO performs better than other state-of-the-art algorithms in terms of effectiveness and robustness.

SOSPD Controllers Tuning by Means of an Evolutionary Algorithm

2014 ◽  
Vol 4 (2) ◽  
pp. 40-58 ◽  
Author(s):  
Jesús-Antonio Hernández-Riveros ◽  
Jorge-Humberto Urrea-Quintero
Keyword(s):  
Evolutionary Algorithm ◽  
Optimization Problem ◽  
Heuristic Algorithms ◽  
Operating Mode ◽  
Performance Criterion ◽  
Order System ◽  
Optimal Tuning ◽  
Current Trends ◽  
Controlling Processes ◽  
Better Than

The Proportional Integral Derivative (PID) controller is the most widely used industrial device to monitoring and controlling processes. There are numerous methods for estimating the controller parameters, in general, resolving particular cases. Current trends in parameter estimation minimize an integral performance criterion. Therefore, the calculation of the controller parameters is proposed as an optimization problem. Although there are alternatives to the traditional rules of tuning, there is not yet a study showing that the use of heuristic algorithms it is indeed better than using the classic methods of optimal tuning. In this paper, the evolutionary algorithm MAGO is used as a tool to optimize the controller parameters. The procedure is applied to a range of standard plants modeled as a Second Order System plus Time Delay. Better results than traditional methods of optimal tuning, regardless of the operating mode of the controller, are yielded.

Sign in / Sign up

Export Citation Format

Share Document