A mayfly optimization algorithm

K Zervoudakis, S Tsafarakis - Computers & Industrial Engineering, 2020 - Elsevier
This paper introduces a new method called the Mayfly Algorithm (MA) to solve optimization
problems. Inspired from the flight behavior and the mating process of mayflies, the proposed …

Novel binary differential evolution algorithm based on Taper-shaped transfer functions for binary optimization problems

Y He, F Zhang, S Mirjalili, T Zhang - Swarm and Evolutionary Computation, 2022 - Elsevier
In order to efficiently solve the binary optimization problems by using differential evolution
(DE), a class of new transfer functions, Taper-shaped transfer function, is firstly proposed by …

A comprehensive review on scatter search: techniques, applications, and challenges

M Kalra, S Tyagi, V Kumar, M Kaur… - Mathematical …, 2021 - Wiley Online Library
Recent years have witnessed the use of metaheuristic algorithms to solve the optimization
problems that usually require extensive computations and time. Among others, scatter …

A knowledge-driven cooperative scatter search algorithm with reinforcement learning for the distributed blocking flow shop scheduling problem

F Zhao, G Zhou, T Xu, N Zhu - Expert Systems with Applications, 2023 - Elsevier
The distributed flow shop scheduling problem has become one of the key problems related
to the high efficiency impacted factor in the manufacturing industry due to its typical …

A new binary coati optimization algorithm for binary optimization problems

G Yildizdan, E Bas - Neural Computing and Applications, 2024 - Springer
The coati optimization algorithm (COA) is a recently proposed heuristic algorithm. The COA
algorithm, which solved the continuous optimization problems in its original paper, has been …

A binary social spider algorithm for uncapacitated facility location problem

E Baş, E Ülker - Expert Systems with Applications, 2020 - Elsevier
In order to find efficient solutions to real complex world problems, computer sciences and
especially heuristic algorithms are often used. Heuristic algorithms can give optimal …

A new hybrid-heuristic for large-scale combinatorial optimization: A case of quadratic assignment problem

H Wang, B Alidaee - Computers & Industrial Engineering, 2023 - Elsevier
Real world combinatorial optimization problems arise in very-large-scale. Solving such
problems to optimality is impractical. In the past several decades, different heuristics and …

Parameters optimization of taguchi method integrated hybrid harmony search algorithm for engineering design problems

E Uray, S Carbas, ZW Geem, S Kim - Mathematics, 2022 - mdpi.com
Performance of convergence to the optimum value is not completely a known process due to
characteristics of the considered design problem and floating values of optimization …

[HTML][HTML] An adaptive parallel evolutionary algorithm for solving the uncapacitated facility location problem

E Sonuç, E Özcan - Expert Systems with Applications, 2023 - Elsevier
Metaheuristics, providing high level guidelines for heuristic optimisation, have successfully
been applied to many complex problems over the past decades. However, their …

Two level uncapacitated facility location problem with disruptions

M Ramshani, J Ostrowski, K Zhang, X Li - Computers & industrial …, 2019 - Elsevier
Uncapacitated facility location problems (UFLPs) deal with the selection of facilities and
assignment of customers to them. Two level UFLPs (TUFLPs) consider an additional level of …