A Hyperheuristic Approach to Scheduling a Sales Summit
PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
Introduction to Evolutionary Computing
Introduction to Evolutionary Computing
A Tabu-Search Hyperheuristic for Timetabling and Rostering
Journal of Heuristics
Completely Derandomized Self-Adaptation in Evolution Strategies
Evolutionary Computation
Linkage Problem, Distribution Estimation, and Bayesian Networks
Evolutionary Computation
Proceedings of the 9th annual conference on Genetic and evolutionary computation
A comprehensive analysis of hyper-heuristics
Intelligent Data Analysis
Soft Computing - A Fusion of Foundations, Methodologies and Applications
There Is a Free Lunch for Hyper-Heuristics, Genetic Programming and Computer Scientists
EuroGP '09 Proceedings of the 12th European Conference on Genetic Programming
Influence of crossover on the behavior of Differential Evolution Algorithms
Applied Soft Computing
SATzilla: portfolio-based algorithm selection for SAT
Journal of Artificial Intelligence Research
Self-adaptive multimethod search for global optimization in real-parameter spaces
IEEE Transactions on Evolutionary Computation
Differential evolution algorithm with strategy adaptation for global numerical optimization
IEEE Transactions on Evolutionary Computation
JADE: adaptive differential evolution with optional external archive
IEEE Transactions on Evolutionary Computation
Memetic algorithms for continuous optimisation based on local search chains
Evolutionary Computation
Ensemble strategies with adaptive evolutionary programming
Information Sciences: an International Journal
Research frontier: memetic computation-past, present & future
IEEE Computational Intelligence Magazine
Towards a memetic feature selection paradigm
IEEE Computational Intelligence Magazine
Population-based algorithm portfolios for numerical optimization
IEEE Transactions on Evolutionary Computation - Special issue on preference-based multiobjective evolutionary algorithms
Disturbed Exploitation compact Differential Evolution for limited memory optimization problems
Information Sciences: an International Journal
Exploratory landscape analysis
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Tradeoffs in the empirical evaluation of competing algorithm designs
Annals of Mathematics and Artificial Intelligence
Communications of the ACM
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Neural Computing and Applications - Special Issue on WCCI2008
Ockham's Razor in memetic computing: Three stage optimal memetic exploration
Information Sciences: an International Journal
Self-adaptive differential evolution algorithm using population size reduction and three strategies
Soft Computing - A Fusion of Foundations, Methodologies and Applications - Special Issue on scalability of evolutionary algorithms and other metaheuristics for large-scale continuous optimization problems
No free lunch theorems for optimization
IEEE Transactions on Evolutionary Computation
A tutorial for competent memetic algorithms: model, taxonomy, and design issues
IEEE Transactions on Evolutionary Computation
Comprehensive learning particle swarm optimizer for global optimization of multimodal functions
IEEE Transactions on Evolutionary Computation
Autonomous Search
A Fast Adaptive Memetic Algorithm for Online and Offline Control Design of PMSM Drives
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Coevolving Memetic Algorithms: A Review and Progress Report
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Estimating meme fitness in adaptive memetic algorithms for combinatorial problems
Evolutionary Computation
Hyper-heuristics with low level parameter adaptation
Evolutionary Computation
A Multi-Agent Memetic System for Human-Based Knowledge Selection
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
DNA Sequence Compression Using Adaptive Particle Swarm Optimization-Based Memetic Algorithm
IEEE Transactions on Evolutionary Computation
Information Sciences: an International Journal
Differential evolution and differential ant-stigmergy on dynamic optimisation problems
International Journal of Systems Science
Compact Particle Swarm Optimization
Information Sciences: an International Journal
Nonlinear Programming: Theory and Algorithms
Nonlinear Programming: Theory and Algorithms
Algorithm runtime prediction: Methods & evaluation
Artificial Intelligence
Hi-index | 0.07 |
This paper proposes a computational prototype for automatic design of optimization algorithms. The proposed scheme makes an analysis of the problem that estimates the degree of separability of the optimization problem. The separability is estimated by computing the Pearson correlation indices between pairs of variables. These indices are then manipulated to generate a unique index that estimates the separability of the entire problem. The separability analysis is thus used to design the optimization algorithm that addresses the needs of the problem. This prototype makes use of two operators arranged in a Parallel Memetic Structure. The first operator performs moves along the axes while the second simultaneously perturbs all the variables to follow the gradient of the fitness landscape. The resulting algorithmic implementation, namely Separability Prototype for Automatic Memes (SPAM), has been tested on multiple testbeds and various dimensionality levels. The proposed computational prototype proved to be a flexible and intelligent framework capable to learn from a problem and, thanks to this learning, to outperform modern meta-heuristics representing the-state-of-the-art in optimization.