Results 241 to 250 of about 52,555 (294)

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

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

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

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

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