Results 121 to 130 of about 10,782 (162)

A cooperative system for metaheuristic algorithms

Expert Systems with Applications, 2021
Abstract Optimization problems are defined as the functions whereby the target is to find the optimum state depending on the parameters that have certain limitations. In the field of optimization, the aim is to find from among multiple alternative solutions the optimal solution or approximate solution that provides all the restrictions. Metaheuristic
Baris Tekin Tezel, Ali Mert
openaire   +2 more sources

Metaheuristic anopheles search algorithm

Evolutionary Intelligence, 2020
Today, various optimization problems have been solved using different optimization techniques such as linear programming, nonlinear programming and dynamic programming. These methods mainly try to find optimal solution in the proximity of starting point.
Hossein Baloochian   +2 more
openaire   +1 more source

Brick-Up Metaheuristic Algorithms

2016 5th IIAI International Congress on Advanced Applied Informatics (IIAI-AAI), 2016
Metaheuristic algorithms have been a very important topic in computer science since the start of evolutionary computing the Genetic Algorithms 1950s. By now these metaheuristic algorithms have become a very large family with successful applications in industry. A challenge which is always pondered on, is finding the suitable metaheuristic algorithm for
Qun Song 0004, Simon Fong 0001
openaire   +1 more source

Hybrid Metaheuristic Algorithm for Clustering

2018 IEEE Symposium Series on Computational Intelligence (SSCI), 2018
Clustering involves grouping a collection of data objects into meaningful or useful categories such that objects within the same category are similar to one another while objects in different categories are dissimilar. Clustering is a challenging problem with diverse practical applications that span multiple research domains.
Olayinka Idowu Oduntan   +1 more
openaire   +1 more source

Automated Design of Metaheuristic Algorithms

2018
The design and development of metaheuristic algorithms can be time-consuming and difficult for a number of reasons including the complexity of the problems being tackled, the large number of degrees of freedom when designing an algorithm and setting its numerical parameters, and the difficulties of algorithm analysis due to heuristic biases and ...
Stützle, Thomas   +1 more
openaire   +2 more sources

The gradient evolution algorithm: A new metaheuristic

Information Sciences, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ren-Jieh Kuo 0001, Ferani E. Zulvia
openaire   +2 more sources

Handbook of Approximation Algorithms and Metaheuristics

The Computer Journal, 2010
PREFACE BASIC METHODOLOGIES Introduction, Overview, and Notation Basic Methodologies and Applications Restriction Methods Greedy Methods Recursive Greedy Methods Linear Programming LP Rounding and Extensions On Analyzing Semidefinite Programming Relaxations of Complex Quadratic Optimization Problems Polynomial-Time Approximation Schemes Rounding ...
openaire   +1 more source

Home - About - Disclaimer - Privacy