[HTML][HTML] Constraint handling techniques for metaheuristics: a state-of-the-art review and new variants
ND Lagaros, M Kournoutos, NA Kallioras… - Optimization and …, 2023 - Springer
Metaheuristic optimization algorithms (MOAs) are computational randomized search
processes which draw inspiration from physical and biological phenomena, with an …
processes which draw inspiration from physical and biological phenomena, with an …
A survey of repair methods used as constraint handling techniques in evolutionary algorithms
S Salcedo-Sanz - Computer science review, 2009 - Elsevier
This paper provides a survey of the most important repair heuristics used in evolutionary
algorithms to solve constrained optimization problems. Popular techniques are reviewed …
algorithms to solve constrained optimization problems. Popular techniques are reviewed …
Water cycle algorithm–A novel metaheuristic optimization method for solving constrained engineering optimization problems
This paper presents a new optimization technique called water cycle algorithm (WCA) which
is applied to a number of constrained optimization and engineering design problems. The …
is applied to a number of constrained optimization and engineering design problems. The …
Bat algorithm: a novel approach for global engineering optimization
XS Yang, A Hossein Gandomi - Engineering computations, 2012 - emerald.com
Purpose–Nature‐inspired algorithms are among the most powerful algorithms for
optimization. The purpose of this paper is to introduce a new nature‐inspired metaheuristic …
optimization. The purpose of this paper is to introduce a new nature‐inspired metaheuristic …
Mine blast algorithm: A new population based algorithm for solving constrained engineering optimization problems
A novel population-based algorithm based on the mine bomb explosion concept, called the
mine blast algorithm (MBA), is applied to the constrained optimization and engineering …
mine blast algorithm (MBA), is applied to the constrained optimization and engineering …
A self-adaptive multi-population based Jaya algorithm for engineering optimization
Multi-population algorithms have been widely used for solving the real-world problems.
However, it is not easy to get the number of sub-populations to be used for a given problem …
However, it is not easy to get the number of sub-populations to be used for a given problem …
[图书][B] Design and analysis of simulation experiments
JPC Kleijnen - 2018 - Springer
This contribution summarizes the design and analysis of experiments with computerized
simulation models. It focuses on two metamodel (surrogate, emulator) types, namely first …
simulation models. It focuses on two metamodel (surrogate, emulator) types, namely first …
Constrained optimization by the ε constrained differential evolution with an archive and gradient-based mutation
T Takahama, S Sakai - IEEE congress on evolutionary …, 2010 - ieeexplore.ieee.org
The ε constrained method is an algorithm transformation method, which can convert
algorithms for unconstrained problems to algorithms for constrained problems using the ε …
algorithms for unconstrained problems to algorithms for constrained problems using the ε …
Chance constrained optimization in a home energy management system
Y Huang, L Wang, W Guo, Q Kang… - IEEE Transactions on …, 2016 - ieeexplore.ieee.org
This paper details a proposed demand response (DR) application to optimize the operation
of appliances in an indeterminate environment in a home energy management system. An …
of appliances in an indeterminate environment in a home energy management system. An …