[PDF][PDF] A review of population-based meta-heuristic algorithms
Exact optimization algorithms are not able to provide an appropriate solution in solving
optimization problems with a high-dimensional search space. In these problems, the search …
optimization problems with a high-dimensional search space. In these problems, the search …
A review on algorithms for maximum clique problems
Q Wu, JK Hao - European Journal of Operational Research, 2015 - Elsevier
The maximum clique problem (MCP) is to determine in a graph a clique (ie, a complete
subgraph) of maximum cardinality. The MCP is notable for its capability of modeling other …
subgraph) of maximum cardinality. The MCP is notable for its capability of modeling other …
A review of methodological approaches for the design and optimization of wind farms
This article presents a review of the state of the art of the Wind Farm Design and
Optimization (WFDO) problem. The WFDO problem refers to a set of advanced planning …
Optimization (WFDO) problem. The WFDO problem refers to a set of advanced planning …
[HTML][HTML] A comprehensive review on meta-heuristic algorithms and their classification with novel approach
H Rajabi Moshtaghi, A Toloie Eshlaghy… - Journal of Applied …, 2021 - journal-aprie.com
Conventional and classical optimization methods are not efficient enough to deal with
complicated, NP-hard, high-dimensional, non-linear, and hybrid problems. In recent years …
complicated, NP-hard, high-dimensional, non-linear, and hybrid problems. In recent years …
[HTML][HTML] A review on discrete diversity and dispersion maximization from an OR perspective
The problem of maximizing diversity or dispersion deals with selecting a subset of elements
from a given set in such a way that the distance among the selected elements is maximized …
from a given set in such a way that the distance among the selected elements is maximized …
[HTML][HTML] Solution-based tabu search for the capacitated dispersion problem
Given a weighted graph with a capacity associated to each node (element), the capacitated
dispersion problem (CDP) consists in selecting a subset of elements satisfying a capacity …
dispersion problem (CDP) consists in selecting a subset of elements satisfying a capacity …
Opposition-based memetic search for the maximum diversity problem
As a usual model for a variety of practical applications, the maximum diversity problem
(MDP) is computational challenging. In this paper, we present an opposition-based memetic …
(MDP) is computational challenging. In this paper, we present an opposition-based memetic …
State of the art in the optimisation of wind turbine performance using CFD
A Shourangiz-Haghighi, MA Haghnegahdar… - … Methods in Engineering, 2020 - Springer
Wind energy has received increasing attention in recent years due to its sustainability and
geographically wide availability. The efficiency of wind energy utilisation highly depends on …
geographically wide availability. The efficiency of wind energy utilisation highly depends on …
Heuristics and metaheuristics for the maximum diversity problem
This paper presents extensive computational experiments to compare 10 heuristics and 20
metaheuristics for the maximum diversity problem (MDP). This problem consists of selecting …
metaheuristics for the maximum diversity problem (MDP). This problem consists of selecting …
Measuring diversity. A review and an empirical analysis
Maximum diversity problems arise in many practical settings from facility location to social
networks, and constitute an important class of NP-hard problems in combinatorial …
networks, and constitute an important class of NP-hard problems in combinatorial …