Search

Optimization problems are prevalent in almost all areas and hence optimization algorithms are crucial for a myriad of real-world applications. Deterministic optimization algorithms tend to be computationally costly and time-consuming. Hence, heuristic and metaheuristic algorithms are more favoured as they provide near-optimal solutions in an acceptable amount of time. Swarm intelligence algorithms are being increasingly used for optimization problems owing to their simplicity and good performance. The Dragonfly Algorithm (DA) is one which is inspired by the swarming behaviours of dragonflies, and it has been proven to have a superior performance than other algorithms in multiple applications. Hence, it is worth considering its application to the traveling salesman problem which is a predominant discrete optimization problem. The original DA is only suitable for solving continuous optimization problems and, although there is a binary version of the algorithm, it is not easily adapted for solving discrete optimization problems like TSP. We have previously proposed a discrete adapted DA algorithm suitable for TSP. However, it has low effectiveness, and it has not been used for large TSP problems. In this paper, we propose an optimized discrete adapted DA by using the steepest ascent hill climbing algorithm as a local search. The algorithm is applied to a TSP problem modelling a package delivery system in the Kuala Lumpur area and to benchmark TSP problems, and it is found to have a higher effectiveness than the discrete adapted DA and some other swarm intelligence algorithms. It also has a higher efficiency than the discrete adapted DA. [ABSTRACT FROM AUTHOR]

In recent years, many researchers have utilized metaheuristic optimization algorithms along with fuzzy logic theory in their studies for various purposes. The harmony search (HS) algorithm is one of the metaheuristic optimization algorithms that is widely employed in different studies along with fuzzy logic (FL) theory. FL theory is a mathematical approach to expressing uncertainty by applying the conceptualization of fuzziness in a system. This review paper presents an extensive review of published papers based on the combination of HS and FL systems. In this regard, the functional characteristics of models obtained from integration of FL and HS have been reported in various articles, and the performance of each study is investigated. The basic concept of the FL approach and its derived models are introduced to familiarize readers with the principal mechanisms of FL models. Moreover, appropriate descriptions of the primary classifications acquired from the coexistence of FL and HS methods for specific purposes are reviewed. The results show that the high efficiency of HS to improve the exploration of FL in achieving the optimal solution on the one hand, and the capability of fuzzy inference systems to provide more flexible and dynamic adaptation of the HS parameters based on human perception on the other hand, can be a powerful combination for solving optimization problems. This review paper is believed to be a useful resource for students, engineers, and professionals. [ABSTRACT FROM AUTHOR]

Nature-inspired metaheuristic algorithms remain a strong trend in optimization. Human-inspired optimization algorithms should be more intuitive and relatable. This paper proposes a novel optimization algorithm inspired by a human search party. We hypothesize the behavioral model of a search party searching for a treasure. Motivated by the search party's behavior, we abstract the "Divide, Conquer, Assemble" (DCA) approach. The DCA approach allows us to parallelize the traditional gradient descent algorithm in a strikingly simple manner. Essentially, multiple gradient descent instances with different learning rates are run parallelly, periodically sharing information. We call it the search party gradient descent (SPGD) algorithm. Experiments performed on a diverse set of classical benchmark functions show that our algorithm is good at optimizing. We believe our algorithm's apparent lack of complexity will equip researchers to solve problems efficiently. We compare the proposed algorithm with SciPy's optimize library and it is found to be competent with it. [ABSTRACT FROM AUTHOR]