Why Simheuristics?: Benefits, limitations, and best practices when combining metaheuristics with simulation
Many decision-making processes in our society involve NP-hard optimization problems. The
largescale, dynamism, and uncertainty of these problems constrain the potential use of …
largescale, dynamism, and uncertainty of these problems constrain the potential use of …
[HTML][HTML] On improving adaptive problem decomposition using differential evolution for large-scale optimization problems
Modern computational mathematics and informatics for Digital Environments deal with the
high dimensionality when designing and optimizing models for various real-world …
high dimensionality when designing and optimizing models for various real-world …
A novel local search method for LSGO with golden ratio and dynamic search step
Depending on the developing technology, large-scale problems have emerged in many
areas such as business, science, and engineering. Therefore, large-scale optimization …
areas such as business, science, and engineering. Therefore, large-scale optimization …
A Novel Memetic Algorithm Based on Multiparent Evolution and Adaptive Local Search for Large‐Scale Global Optimization
W Zhang, Y Lan - Computational Intelligence and …, 2022 - Wiley Online Library
In many fields, including management, computer, and communication, Large‐Scale Global
Optimization (LSGO) plays a critical role. It has been applied to various applications and …
Optimization (LSGO) plays a critical role. It has been applied to various applications and …
[PDF][PDF] Comparison of swarm intelligence algorithms for high dimensional optimization problems
High dimensional optimization considers being one of the most challenges that face the
algorithms for finding an optimal solution for real-world problems. These problems have …
algorithms for finding an optimal solution for real-world problems. These problems have …
Improved particle swarm optimization by fast simulated annealing algorithm
This paper proposes a hybrid particle swarm optimization with the fast-simulated annealing
(PSO-FSA). The proposed algorithm is meant to solve high dimensional optimization …
(PSO-FSA). The proposed algorithm is meant to solve high dimensional optimization …
A Surrogate Model-based Aquila Optimizer for Solving High-dimensional Computationally Expensive Problems
This paper introduces a variant version of the AO for efficiently solving high-dimensional
computationally expensive problems. Traditional optimization techniques struggle with …
computationally expensive problems. Traditional optimization techniques struggle with …
Improved Multi-Particle Swarm Optimization based on multi-exemplar and forgetting ability
Several variants of particle swarm optimization (PSO) have been created to identify various
solutions to compli-cated optimization problems. Only a few PSO algorithms exist that can …
solutions to compli-cated optimization problems. Only a few PSO algorithms exist that can …
[PDF][PDF] An Improved particle swarm optimization based on lévy flight and simulated annealing for high dimensional optimization problem
Various practical fields rely on optimization mechanisms to achieve high performance. To
solve optimization problems, optimization algorithms are utilized in systems in various …
solve optimization problems, optimization algorithms are utilized in systems in various …
New variable-length data compression scheme for solution representation of meta-heuristics
GYH Chen - Computers & Operations Research, 2021 - Elsevier
Solution representation is an important aspect of the development of a meta-heuristic.
However, most meta-heuristics focus on the algorithm aspect rather than the solution …
However, most meta-heuristics focus on the algorithm aspect rather than the solution …