A review of population-based metaheuristics for large-scale black-box global optimization—Part I

MN Omidvar, X Li, X Yao - IEEE Transactions on Evolutionary …, 2021 - ieeexplore.ieee.org
Scalability of optimization algorithms is a major challenge in coping with the ever-growing
size of optimization problems in a wide range of application areas from high-dimensional …

Deep clustering of the traveling salesman problem to parallelize its solution

VV Romanuke - Computers & Operations Research, 2024 - Elsevier
A method of heuristically solving large traveling salesman problems is suggested, where a
dramatic computational speedup is guaranteed. A specific genetic algorithm is the solver …

An efficient ensemble of GA and PSO for real function optimization

X Lai, M Zhang - 2009 2nd IEEE International Conference on …, 2009 - ieeexplore.ieee.org
Wolpert and Macready asserted that no single search algorithm is best on average for all
problems, which is confirmed by most practical experiences. Therefore, optimization results …

A decomposition framework based on memorized binary search for large-scale optimization problems

Q Liang, JS Pan, SC Chu, L Kong, W Li - Information Sciences, 2024 - Elsevier
Cooperative co-evolution (CC) is an evolutionary framework for dealing with large-scale
optimization problems. The divide-and-conquer strategy is widely used in CC. The large …

The bi-objective active-scan agile earth observation satellite scheduling problem: Modeling and solution approach

W Yang, Y Chen, R He, Z Chang… - 2018 IEEE Congress on …, 2018 - ieeexplore.ieee.org
The active-scan agile earth observation satellite (AS-AEOS) is highly agile in three axis
which enables in-motion imaging, allowing any imaging direction for a given ground target …

[PDF][PDF] A framework for hybrid dynamic evolutionary algorithms: multiple offspring sampling (MOS)

ALT de la Fuente, JMP Sánchez - 2009 - oa.upm.es
Abstract Evolutionary Algorithms (EAs) are a set of optimization techniques that have
become incredibly popular in the last decades. As they are general purpose algorithms, they …

Mapping the performance of heuristics for constraint satisfaction

JC Ortiz-Bayliss, E Özcan, AJ Parkes… - IEEE Congress on …, 2010 - ieeexplore.ieee.org
Hyper-heuristics are high level search methodologies that operate over a set of heuristics
which operate directly on the problem domain. In one of the hyper-heuristic frameworks, the …

Learning hybridization strategies in evolutionary algorithms

A LaTorre, JM Pena, S Muelas… - Intelligent Data …, 2010 - content.iospress.com
Evolutionary Algorithms are powerful optimization techniques which have been applied to
many different problems, from complex mathematical functions to real-world applications …

Fast approximation of the traveling salesman problem shortest route by rectangular cell clustering pattern to parallelize solving

V Romanuke - Statistics, Optimization & Information Computing, 2024 - iapress.org
A method of quickly obtaining an approximate solution to the traveling salesman problem
(TSP) is suggested, where a dramatic computational speedup is guaranteed. The initial TSP …

[PDF][PDF] Algoritmos distribuidos heterogéneos para problemas de optimización continua

S Muelas, J Pena, A LaTorre, V Robles - Proceedings of the VI …, 2009 - sci2s.ugr.es
Este trabajo analiza el comportamiento de dos algoritmos distribuidos heterogéneos que
combinan las siguientes técnicas evolutivas: Algoritmos Genéticos (GA), Algoritmos de …