Algorithm selection for black-box continuous optimization problems: A survey on methods and challenges

MA Muñoz, Y Sun, M Kirley, SK Halgamuge - Information Sciences, 2015 - Elsevier
Selecting the most appropriate algorithm to use when attempting to solve a black-box
continuous optimization problem is a challenging task. Such problems typically lack …

Variance ranking attributes selection techniques for binary classification problem in imbalance data

SH Ebenuwa, MS Sharif, M Alazab, A Al-Nemrat - IEEE access, 2019 - ieeexplore.ieee.org
Data are being generated and used to support all aspects of healthcare provision, from
policy formation to the delivery of primary care services. Particularly, with the change of …

Exploratory landscape analysis of continuous space optimization problems using information content

MA Muñoz, M Kirley… - IEEE transactions on …, 2014 - ieeexplore.ieee.org
Data-driven analysis methods, such as the information content of a fitness sequence,
characterize a discrete fitness landscape by quantifying its smoothness, ruggedness, or …

Statistical genetic programming for symbolic regression

MA Haeri, MM Ebadzadeh, G Folino - Applied Soft Computing, 2017 - Elsevier
In this paper, a new genetic programming (GP) algorithm for symbolic regression problems
is proposed. The algorithm, named statistical genetic programming (SGP), uses statistical …

Analyzing randomness effects on the reliability of exploratory landscape analysis

MA Muñoz, M Kirley, K Smith-Miles - Natural Computing, 2022 - Springer
The inherent difficulty of solving a continuous, static, bound-constrained and single-objective
black-box optimization problem depends on the characteristics of the problem's fitness …

The algorithm selection problem on the continuous optimization domain

MA Munoz, M Kirley, SK Halgamuge - Computational intelligence in …, 2013 - Springer
The problem of algorithm selection, that is identifying the most efficient algorithm for a given
computational task, is non-trivial. Meta-learning techniques have been used successfully for …

Genetic programming performance prediction and its application for symbolic regression problems

SSM Astarabadi, MM Ebadzadeh - Information Sciences, 2019 - Elsevier
Predicting the performance of Genetic Programming (GP) helps us identify whether it is an
appropriate approach to solve the problem at hand. However, previous studies show that …

An adaptive approach for solving dynamic scheduling with time-varying number of tasks—Part II

MB Abello, LT Bui, Z Michalewicz - 2011 IEEE Congress of …, 2011 - ieeexplore.ieee.org
Changes in environment are common in daily activities and can introduce new problems. To
be adaptive to these changes, new solutions are to be found every time change occur. This …

Models to classify the difficulty of genetic algorithms to solve continuous optimization problems

NE Rodríguez-Maya, JJ Flores, S Verel, M Graff - Natural Computing, 2024 - Springer
What constitutes a hard optimization problem to an Evolutionary Algorithm (EA)? To answer
the question, the study of Fitness Landscape (FL) has emerged as one of the most …

Time series forecasting with genetic programming

M Graff, HJ Escalante, F Ornelas-Tellez, ES Tellez - Natural Computing, 2017 - Springer
Genetic programming (GP) is an evolutionary algorithm that has received a lot of attention
lately due to its success in solving hard world problems. There has been a lot of interest in …