Results 251 to 260 of about 57,703 (300)

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, Hamid Reza Ghaffary, Saeed Balochian   +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, Parimala Thulasiraman   +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

Performance Measures of Metaheuristic Algorithms

2015
Generally speaking, it is not fully understood why and how metaheuristic algorithms work very well under what conditions. It is the intention of this paper to clarify the performance characteristics of some of popular algorithms depending on the fitness landscape of specific problems. This study shows the performance of each considered algorithm on the
Joong Hoon Kim, Ho Min Lee, Donghwi Jung, Ali Sadollah   +3 more
openaire   +1 more source

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

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, López-Ibáñez, Manuel   +1 more
openaire   +2 more sources

A Metaheuristic Algorithm for the Probabilistic Orienteering Problem

Proceedings of the 2019 2nd International Conference on Machine Learning and Machine Intelligence, 2019
The Probabilistic Orienteering Problem (POP) is a variant of the orienteering problem where customers are available with a certain probability. In a previous work, we approximated its objective function value by using a Monte Carlo Sampling method. A heuristic speed-up criterion is considered in the objective function evaluator.
Xiaochen Chou, Luca Maria Gambardella, Roberto Montemanni   +2 more
openaire   +3 more sources

Metaheuristic Optimization Algorithms

2021
In this introductory chapter, specific state-of-the-art metaheuristic optimization algorithms are outlined. The presented algorithms belong to the broad trajectory-based and population-based categories, and they are particularly selected as they constitute the building blocks of algorithm portfolios presented in the forthcoming chapters.
Jitendra Kumar, Ashutosh Kumar Singh, Anand Mohan, Rajkumar Buyya   +3 more
openaire   +2 more sources

A Metaheuristic Algorithm for Hiding Sensitive Itemsets

2018
In this paper, we first present a multi-objective algorithm for hiding the sensitive information with transaction deletion based on the NSGAII framework. The proposed can efficiently sort the non-dominated solutions and find the set of Pareto results for later process.
Jerry Chun-Wei Lin, Yuyu Zhang, Philippe Fournier-Viger, Youcef Djenouri, Ji Zhang 0001   +4 more
openaire   +1 more source