A binary reptile search algorithm based on transfer functions with a new stochastic repair method for 0–1 knapsack problems

B Ervural, H Hakli - Computers & Industrial Engineering, 2023 - Elsevier
Abstract The Reptile Search Algorithm (RSA), inspired by crocodiles' hunting behavior, is a
recently introduced nature-inspired algorithm. Although the original version of the RSA …

A comparative study of meta-heuristic optimization algorithms for 0–1 knapsack problem: Some initial results

AE Ezugwu, V Pillay, D Hirasen, K Sivanarain… - IEEE …, 2019 - ieeexplore.ieee.org
In this paper, we present some initial results of several meta-heuristic optimization
algorithms, namely, genetic algorithms, simulated annealing, branch and bound, dynamic …

A wrapper-based approach for feature selection and classification of major depressive disorder–bipolar disorders

TT Erguzel, C Tas, M Cebi - Computers in biology and medicine, 2015 - Elsevier
Feature selection (FS) and classification are consecutive artificial intelligence (AI) methods
used in data analysis, pattern classification, data mining and medical informatics. Beside …

[HTML][HTML] Modeling and optimization of ultrasonic metal welding on dissimilar sheets using fuzzy based genetic algorithm approach

MP Satpathy, BR Moharana, S Dewangan… - Engineering Science and …, 2015 - Elsevier
Ultrasonic welding has been used in the market over the past twenty years and serving to
the manufacturing industries like aviation, medical, microelectronics and many more due to …

An improved Henry gas optimization algorithm for joint mining decision and resource allocation in a MEC-enabled blockchain networks

RM Hussien, AA Abohany, N Moustafa… - Neural Computing and …, 2023 - Springer
This paper investigates a wireless blockchain network with mobile edge computing in which
Internet of Things (IoT) devices can behave as blockchain users (BUs). This blockchain …

A hybrid binary particle swarm optimization with tabu search for the set-union knapsack problem

G Lin, J Guan, Z Li, H Feng - Expert Systems with Applications, 2019 - Elsevier
The set-union knapsack problem (SUKP) is a generalization of the standard 0–1 knapsack
problem. It is NP-hard, and has several industrial applications. Several approximation and …

The importance of transfer function in solving set-union knapsack problem based on discrete moth search algorithm

Y Feng, H An, X Gao - Mathematics, 2018 - mdpi.com
Moth search (MS) algorithm, originally proposed to solve continuous optimization problems,
is a novel bio-inspired metaheuristic algorithm. At present, there seems to be little concern …

A holistic fuzzy approach to create competitive advantage via quality management in services industry (case study: life-insurance services)

J Vaziri, MA Beheshtinia - Management decision, 2016 - emerald.com
Purpose In today's highly competitive business environment, the main approach of all
businesses is to optimally provide customers' requirements and gain their satisfaction and …

[HTML][HTML] A sustainable supply chain model with two inspection errors and carbon emissions under uncertain demand

B Karthick, R Uthayakumar - Cleaner Engineering and Technology, 2021 - Elsevier
This study analyzes a two-level sustainable supply chain model using the meta-heuristic
evolutionary algorithm. Defective items are exposed due to malfunctions in the equipment …

An enhanced multi-operator differential evolution algorithm for tackling knapsack optimization problem

KM Sallam, AA Abohany, RM Rizk-Allah - Neural Computing and …, 2023 - Springer
The knapsack problem (KP) is a discrete combinatorial optimization problem that has
different utilities in many fields. It is described as a non-polynomial time (NP) problem and …