An extensive review of computational intelligence-based optimization algorithms: trends and applications
L Goel - Soft Computing, 2020 - Springer
Area of computational intelligence is gaining researcher's attention in ongoing trend of
technology and evolution due to their high capability to deliver near-optimal solutions. A new …
technology and evolution due to their high capability to deliver near-optimal solutions. A new …
Binary multi-verse optimization algorithm for global optimization and discrete problems
Multi-verse optimizer is one of the recently proposed nature-inspired algorithms that has
proven its efficiency in solving challenging optimization problems. The original version of …
proven its efficiency in solving challenging optimization problems. The original version of …
Task scheduling based on modified grey wolf optimizer in cloud computing environment
A Alzaqebah, R Al-Sayyed… - 2019 2nd International …, 2019 - ieeexplore.ieee.org
Task scheduling is considered as one of the most critical problems in cloud computing
environment. The main target of task scheduling includes scheduling jobs on virtual …
environment. The main target of task scheduling includes scheduling jobs on virtual …
A binary ancient-inspired Giza Pyramids Construction metaheuristic algorithm for solving 0-1 knapsack problem
S Harifi - Soft Computing, 2022 - Springer
The knapsack problem is one of the combinational optimization issues. This problem is an
NP-hard problem. Soft computing methods, including the use of metaheuristic algorithms …
NP-hard problem. Soft computing methods, including the use of metaheuristic algorithms …
WGW: A hybrid approach based on whale and grey wolf optimization algorithms for requirements prioritization
Requirement engineering is the base phase of any software project, since this phase is
concerned about requirements identification, processing and manipulation. The main source …
concerned about requirements identification, processing and manipulation. The main source …
A logarithmic descent direction algorithm for the quadratic knapsack problem
Z Wu, B Jiang, HR Karimi - Applied Mathematics and Computation, 2020 - Elsevier
The quadratic knapsack problem is an NP-hard optimization problem with many diverse
applications in industrial and management engineering. However, computational …
applications in industrial and management engineering. However, computational …
Whale optimization algorithm for requirements prioritization
A Alzaqebah, R Masadeh… - 2018 9th International …, 2018 - ieeexplore.ieee.org
In software projects, the requirement engineering phase is the base of any project and this
phase is concerned in software requirements processes. Stakeholders are the main source …
phase is concerned in software requirements processes. Stakeholders are the main source …
[PDF][PDF] Grey wolf algorithm for requirements prioritization
Requirement prioritization is one of the most important approach in the process of
requirement engineering due to use it in order to prioritize the execution sort of requirements …
requirement engineering due to use it in order to prioritize the execution sort of requirements …
Binary Honey Badger Algorithm for 0-1 Knapsack Problem
GO Büyüköz, H Haklı - Journal of Intelligent Systems: Theory and …, 2023 - dergipark.org.tr
Honey Badger Algorithm (HBA) is one of the recently proposed optimization techniques
inspired by the foraging behavior of honey badger. Although it has been successfully …
inspired by the foraging behavior of honey badger. Although it has been successfully …
List-based simulated annealing algorithm with hybrid greedy repair and optimization operator for 0–1 knapsack problem
SH Zhan, ZJ Zhang, LJ Wang, YW Zhong - IEEE Access, 2018 - ieeexplore.ieee.org
List-based simulated annealing (LBSA) algorithm, which uses list-based cooling scheme to
control the change of parameter temperature, was first proposed for traveling salesman …
control the change of parameter temperature, was first proposed for traveling salesman …