Ls-II: An Improved Locust Search Algorithm for Solving Optimization Problems

Abstract

The Locust Search (LS) algorithm is a swarm-based optimization method inspired in the natural behavior of the desert locust. LS considers the inclusion of two distinctive nature-inspired search mechanism, namely, their solitary phase and social phase operators. These interesting search schemes allow LS to overcome some of the difficulties that commonly affect other similar methods, such as premature convergence and the lack of diversity on solutions. Recently, computer vision experiments in insect tracking methods have conducted to the development of more accurate locust motion models than those produced by simple behavior observations. The most distinctive characteristic of such new models is the use of probabilities to emulate the locust decision process. In this paper, a modification to the original LS algorithm, referred to as LS-II, is proposed to better handle global optimization problems. In LS-II, the locust motion model of the original algorithm is modified incorporating the main characteristics of the new biological formulations. As a result, LS-II improves its original capacities of exploration and exploitation of the search space. In order to test its performance, the proposed LS-II method is compared against several the state-of-the-art evolutionary methods considering a set of benchmark functions and engineering problems. Experimental results demonstrate the superior performance of the proposed approach in terms of solution quality and robustness.

Enhanced Social Spider Optimization Algorithm for Increasing Performance of Multiple Pursuer Drones in Neutralizing Attacks From Multiple Evader Drones

“…Other than SSO, some possible methods can potentially be used as alternatives for solving our discussed problem. For example, the principle of the artificial bee colony, as explored in [10], or locust search algorithm as improved in [11]. Both methods are based on the swarm-optimization algorithm.…”

Distribution Based Crowd Abnormality Detection

“…Our computed AUC is 99.8, which is 4.909%, 0.4%, 0.2%, 0.3%, 2.78%, 0.3%, and 1.2% more compared to existing approaches LMVD [34], MDT [35], HOG+HOS [36], LS [37], SR [38], CI [39] and SFM [40].…”

“…Fig 5, fig 6, fig 7 and, fig 8 shows the frame level comparison that corresponds to scenario-A, scenario-B, scenario-C and scenario-D. Finally, we computed the Area Under Curve (AUC) and compared with the existing approach as given in fig 9, where our proposed DCAD model is compared with LMVD [34], MDT [35], HOG+HOS [36], LS [37], SR [38], CI [39] and SFM [40].…”

TOPSIS Decision on Approximate Pareto Fronts by Using Evolutionary Algorithms: Application to an Engineering Design Problem

“…The objectives of the design are to minimize the cost of fabrication and to minimize the deflection. This problem is well-studied in both mono- [55][56][57] and multi-objective [52,54,[58][59][60] literature. In the optimization stage, the NSGA-II, GWASF-GA and MOEA/D algorithms and the g-NSGA-II and WASF-GA algorithms (that include DM's partial-preferences as a reference point) were implemented with binary coding.…”