Harmony search algorithm is the recently developed metaheuristic in the last decade. It
mimics the behavior of a musician producing a perfect harmony. It has been used to solve …

This paper presents a comprehensive overview of the development of the harmony search
(HS) algorithm and its applications. HS is a well-known human-based meta-heuristic …

The 0-1 knapsack problem, a prevalent combinatorial optimisation problem, aims to
maximise the benefits of a chosen subset of items while ensuring the total capacity is not …

This paper proposed an enhanced hybrid Jaya algorithm, called AEHJ. The proposed AEHJ
is a new improvisation of the Jaya algorithm (Jaya) and the differential evolution algorithm …

Joint aeronautical and maritime search and rescue is the most effective way of performing
rescues at sea. The value and effectiveness of a search and rescue (SAR) are far greater …

The knapsack problem is a well-known strongly NP-complete problem where the profits of
collection of items in knapsack is maximized under a certain weight capacity constraint. In …

This paper presents a simple and mighty metaheuristic algorithm, Jaya, which is applied to
solve the team formation (TF) problem and it is a very fundamental problem in many …

Harmony search algorithm (HSA) is relatively considered as one of the most recent
metaheuristic algorithms. HSA is a modern-nature algorithm that simulates the musicians' …

One of the key reasons for delivering a high quality software system is to meet the core
requirements of the stakeholder. Software requirements prioritization (RP) is being used to …

The 0/1 Knapsack problem is one of the most popular real-world optimization problems that
arise in searching space and finding the most optimum solution. Theoretically, the optimum …