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 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.

Identification, Prediction and Data Analysis of Noncoding RNAs: A Review

2019 ◽  
Vol 15 (3) ◽  
pp. 216-230 ◽  
Author(s):  
Abbasali Emamjomeh ◽  
Javad Zahiri ◽  
Mehrdad Asadian ◽  
Mehrdad Behmanesh ◽  
Barat A. Fakheri ◽  
...  
Keyword(s):  
Computational Methods ◽  
State Of The Art ◽  
Noncoding Rnas ◽  
Research Field ◽  
Design Strategies ◽  
Structural Prediction ◽  
Computational Costs ◽  
Cellular Processes ◽  
Laboratory Techniques ◽  
Fast Prediction

Background:Noncoding RNAs (ncRNAs) which play an important role in various cellular processes are important in medicine as well as in drug design strategies. Different studies have shown that ncRNAs are dis-regulated in cancer cells and play an important role in human tumorigenesis. Therefore, it is important to identify and predict such molecules by experimental and computational methods, respectively. However, to avoid expensive experimental methods, computational algorithms have been developed for accurately and fast prediction of ncRNAs.Objective:The aim of this review was to introduce the experimental and computational methods to identify and predict ncRNAs structure. Also, we explained the ncRNA’s roles in cellular processes and drugs design, briefly.Method:In this survey, we will introduce ncRNAs and their roles in biological and medicinal processes. Then, some important laboratory techniques will be studied to identify ncRNAs. Finally, the state-of-the-art models and algorithms will be introduced along with important tools and databases.Results:The results showed that the integration of experimental and computational approaches improves to identify ncRNAs. Moreover, the high accurate databases, algorithms and tools were compared to predict the ncRNAs.Conclusion:ncRNAs prediction is an exciting research field, but there are different difficulties. It requires accurate and reliable algorithms and tools. Also, it should be mentioned that computational costs of such algorithm including running time and usage memory are very important. Finally, some suggestions were presented to improve computational methods of ncRNAs gene and structural prediction.

scholarly journals Multi-hop assortativities for network classification

2018 ◽  
Vol 7 (4) ◽  
pp. 603-622 ◽  
Author(s):  
Leonardo Gutiérrez-Gómez ◽  
Jean-Charles Delvenne
Keyword(s):  
Machine Learning ◽  
Scientific Collaboration ◽  
State Of The Art ◽  
Medical Engineering ◽  
Research Field ◽  
Classification Task ◽  
Collaboration Network ◽  
Structural Patterns ◽  
Art Methods

Abstract Several social, medical, engineering and biological challenges rely on discovering the functionality of networks from their structure and node metadata, when it is available. For example, in chemoinformatics one might want to detect whether a molecule is toxic based on structure and atomic types, or discover the research field of a scientific collaboration network. Existing techniques rely on counting or measuring structural patterns that are known to show large variations from network to network, such as the number of triangles, or the assortativity of node metadata. We introduce the concept of multi-hop assortativity, that captures the similarity of the nodes situated at the extremities of a randomly selected path of a given length. We show that multi-hop assortativity unifies various existing concepts and offers a versatile family of ‘fingerprints’ to characterize networks. These fingerprints allow in turn to recover the functionalities of a network, with the help of the machine learning toolbox. Our method is evaluated empirically on established social and chemoinformatic network benchmarks. Results reveal that our assortativity based features are competitive providing highly accurate results often outperforming state of the art methods for the network classification task.

scholarly journals Investigation of Improved Cooperative Coevolution for Large-Scale Global Optimization Problems

Algorithms ◽  
2021 ◽  
Vol 14 (5) ◽  
pp. 146
Author(s):  
Aleksei Vakhnin ◽  
Evgenii Sopov
Keyword(s):  
Global Optimization ◽  
Evolutionary Algorithms ◽  
Numerical Experiments ◽  
Large Scale ◽  
Optimization Problems ◽  
State Of The Art ◽  
Fixed Number ◽  
High Dimensional ◽  
Cooperative Coevolution ◽  
Large Scale Problems

Modern real-valued optimization problems are complex and high-dimensional, and they are known as “large-scale global optimization (LSGO)” problems. Classic evolutionary algorithms (EAs) perform poorly on this class of problems because of the curse of dimensionality. Cooperative Coevolution (CC) is a high-performed framework for performing the decomposition of large-scale problems into smaller and easier subproblems by grouping objective variables. The efficiency of CC strongly depends on the size of groups and the grouping approach. In this study, an improved CC (iCC) approach for solving LSGO problems has been proposed and investigated. iCC changes the number of variables in subcomponents dynamically during the optimization process. The SHADE algorithm is used as a subcomponent optimizer. We have investigated the performance of iCC-SHADE and CC-SHADE on fifteen problems from the LSGO CEC’13 benchmark set provided by the IEEE Congress of Evolutionary Computation. The results of numerical experiments have shown that iCC-SHADE outperforms, on average, CC-SHADE with a fixed number of subcomponents. Also, we have compared iCC-SHADE with some state-of-the-art LSGO metaheuristics. The experimental results have shown that the proposed algorithm is competitive with other efficient metaheuristics.

An Electrochemical Model Based Optimal Charging Algorithm for Lithium-Ion Batteries

2015 ◽  
Author(s):  
Sourav Pramanik ◽  
Sohel Anwar
Keyword(s):  
Management System ◽  
Optimization Problems ◽  
Optimal Algorithm ◽  
Algorithm Design ◽  
Lithium Ion ◽  
Cell Voltage ◽  
Realistic Model ◽  
Constant Current ◽  
Battery Management System ◽  
Model Based

In recent years, Lithium-Ion battery has gathered lot of importance in many forms of energy storage applications due to its overwhelming benefits. Any battery pack alone cannot achieve its optimal performance unless there is a robust and efficient energy management system, commonly known as battery management system or BMS. The Lithium-Ion charger is a voltage-limiting device that is similar to the lead acid system. The difference lies in a higher cell voltage; tighter voltage tolerance and the absence of trickle or float charge at full charge. In this work, we propose the design of a novel optimal strategy for charging the battery that better suits the battery performance. A performance index is defined that aims at minimizing the effort of regeneration along with a minimum deviation from the rated maximum thresholds for cell temperature and charging current. A more realistic model based on battery electrochemistry is used for the optimal algorithm design as opposed to equivalent circuit models. To solve the optimization problem, Pontryagin’s principle is used which is very effective for constrained optimization problems with both state and input constraints. Simulation results show that the proposed optimal charging algorithm is capable of shortening the charging time of a Lithium Ion cell while maintaining the temperature constraint when compared with the standard constant current charging.

A Novel Approach to Designing Surrogate-assisted Genetic Algorithms by Combining Efficient Learning of Walsh Coefficients and Dependencies

2021 ◽  
Vol 1 (2) ◽  
pp. 1-23
Author(s):  
Arkadiy Dushatskiy ◽  
Tanja Alderliesten ◽  
Peter A. N. Bosman
Keyword(s):  
Boolean Functions ◽  
Surrogate Model ◽  
Optimization Problems ◽  
State Of The Art ◽  
Fitness Function ◽  
Optimal Solution ◽  
Problem Structure ◽  
Novel Approach ◽  
Efficient Learning ◽  
Nk Landscapes

Surrogate-assisted evolutionary algorithms have the potential to be of high value for real-world optimization problems when fitness evaluations are expensive, limiting the number of evaluations that can be performed. In this article, we consider the domain of pseudo-Boolean functions in a black-box setting. Moreover, instead of using a surrogate model as an approximation of a fitness function, we propose to precisely learn the coefficients of the Walsh decomposition of a fitness function and use the Walsh decomposition as a surrogate. If the coefficients are learned correctly, then the Walsh decomposition values perfectly match with the fitness function, and, thus, the optimal solution to the problem can be found by optimizing the surrogate without any additional evaluations of the original fitness function. It is known that the Walsh coefficients can be efficiently learned for pseudo-Boolean functions with k -bounded epistasis and known problem structure. We propose to learn dependencies between variables first and, therefore, substantially reduce the number of Walsh coefficients to be calculated. After the accurate Walsh decomposition is obtained, the surrogate model is optimized using GOMEA, which is considered to be a state-of-the-art binary optimization algorithm. We compare the proposed approach with standard GOMEA and two other Walsh decomposition-based algorithms. The benchmark functions in the experiments are well-known trap functions, NK-landscapes, MaxCut, and MAX3SAT problems. The experimental results demonstrate that the proposed approach is scalable at the supposed complexity of O (ℓ log ℓ) function evaluations when the number of subfunctions is O (ℓ) and all subfunctions are k -bounded, outperforming all considered algorithms.

Two Orders of Magnitude Improvement in the Detection Limit of Droplet-Based Micro-Magnetofluidics with Planar Hall Effect Sensors

2021 ◽  
Vol 6 (1) ◽  
pp. 47
Author(s):  
Julian Schütt ◽  
Rico Illing ◽  
Oleksii Volkov ◽  
Tobias Kosub ◽  
Pablo Nicolás Granell ◽  
...  
Keyword(s):  
Detection Limit ◽  
Hall Effect ◽  
State Of The Art ◽  
Limit Of Detection ◽  
Research Field ◽  
High Throughput Analysis ◽  
Planar Hall Effect ◽  
Biologically Relevant ◽  
Sensing Platform ◽  
Order Of Magnitude

The detection, manipulation, and tracking of magnetic nanoparticles is of major importance in the fields of biology, biotechnology, and biomedical applications as labels as well as in drug delivery, (bio-)detection, and tissue engineering. In this regard, the trend goes towards improvements of existing state-of-the-art methodologies in the spirit of timesaving, high-throughput analysis at ultra-low volumes. Here, microfluidics offers vast advantages to address these requirements, as it deals with the control and manipulation of liquids in confined microchannels. This conjunction of microfluidics and magnetism, namely micro-magnetofluidics, is a dynamic research field, which requires novel sensor solutions to boost the detection limit of tiny quantities of magnetized objects. We present a sensing strategy relying on planar Hall effect (PHE) sensors in droplet-based micro-magnetofluidics for the detection of a multiphase liquid flow, i.e., superparamagnetic aqueous droplets in an oil carrier phase. The high resolution of the sensor allows the detection of nanoliter-sized superparamagnetic droplets with a concentration of 0.58 mg cm−3, even when they are only biased in a geomagnetic field. The limit of detection can be boosted another order of magnitude, reaching 0.04 mg cm−³ (1.4 million particles in a single 100 nL droplet) when a magnetic field of 5 mT is applied to bias the droplets. With this performance, our sensing platform outperforms the state-of-the-art solutions in droplet-based micro-magnetofluidics by a factor of 100. This allows us to detect ferrofluid droplets in clinically and biologically relevant concentrations, and even in lower concentrations, without the need of externally applied magnetic fields.

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 Application of TOPSIS and AHP in the Multi-Objective Decision-Making Problems

2018 ◽  
Vol 228 ◽  
pp. 05002 ◽  
Author(s):  
Yihan Wang
Keyword(s):  
Decision Making ◽  
Theoretical Analysis ◽  
Optimization Problems ◽  
Basic Principles ◽  
Multi Objective ◽  
New Methods

The problems of multi-objective decision making are analysed and studied. In order to solve its optimization problems, the basic principles and application steps of TOPSIS and AHP are introduced in this paper. Then some practical examples are given to show how to apply these two new methods in multi-objective decision making problems. Finally, the advantage and feasibility of the TOPSIS and AHP methods are demonstrated by theoretical analysis.

scholarly journals Differential Evolution: A Survey and Analysis

2018 ◽  
Vol 8 (10) ◽  
pp. 1945 ◽  
Author(s):  
Tarik Eltaeib ◽  
Ausif Mahmood
Keyword(s):  
Global Optimization ◽  
Differential Evolution ◽  
Optimization Problems ◽  
State Of The Art ◽  
Population Based ◽  
Vital Role ◽  
Fine Tuning ◽  
Control Parameters ◽  
Hybrid Techniques ◽  
Global Optimizer

Differential evolution (DE) has been extensively used in optimization studies since its development in 1995 because of its reputation as an effective global optimizer. DE is a population-based metaheuristic technique that develops numerical vectors to solve optimization problems. DE strategies have a significant impact on DE performance and play a vital role in achieving stochastic global optimization. However, DE is highly dependent on the control parameters involved. In practice, the fine-tuning of these parameters is not always easy. Here, we discuss the improvements and developments that have been made to DE algorithms. In particular, we present a state-of-the-art survey of the literature on DE and its recent advances, such as the development of adaptive, self-adaptive and hybrid techniques.

Sign in / Sign up

Export Citation Format

Share Document