A novel improved elephant herding optimization for path planning of a mobile robot

Swarm intelligence algorithms have been in recent years one of the most used tools for planning the trajectory of a mobile robot. Researchers are applying those algorithms to find the optimal path, which reduces the time required to perform a task by the mobile robot. In this paper, we propose a new method based on the grey wolf optimizer algorithm (GWO) and the improved elephant herding optimization algorithm (IEHO) for planning the optimal trajectory of a mobile robot. The proposed solution consists of developing an IEHO algorithm by improving the basic EHO algorithm and then hybridizing it with the GWO algorithm to take advantage of the exploration and exploitation capabilities of both algorithms. The comparison of the IEHO-GWO hybrid proposed in this work with the GWO, EHO, and cuckoo-search (CS) algorithms via simulation shows its effectiveness in finding an optimal trajectory by avoiding obstacles around the mobile robot

Evolutionary Computation 2020

Intelligent optimization is based on the mechanism of computational intelligence to refine a suitable feature model, design an effective optimization algorithm, and then to obtain an optimal or satisfactory solution to a complex problem. Intelligent algorithms are key tools to ensure global optimization quality, fast optimization efficiency and robust optimization performance. Intelligent optimization algorithms have been studied by many researchers, leading to improvements in the performance of algorithms such as the evolutionary algorithm, whale optimization algorithm, differential evolution algorithm, and particle swarm optimization. Studies in this arena have also resulted in breakthroughs in solving complex problems including the green shop scheduling problem, the severe nonlinear problem in one-dimensional geodesic electromagnetic inversion, error and bug finding problem in software, the 0-1 backpack problem, traveler problem, and logistics distribution center siting problem. The editors are confident that this book can open a new avenue for further improvement and discoveries in the area of intelligent algorithms. The book is a valuable resource for researchers interested in understanding the principles and design of intelligent algorithms

Energy-Based Acoustic Localization by Improved Elephant Herding Optimization

UIDB/EEA/50008/2020The present work proposes a new approach to address the energy-based acoustic localization problem. The proposed approach represents an improved version of evolutionary optimization based on Elephant Herding Optimization (EHO), where two major contributions are introduced. Firstly, instead of random initialization of elephant population, we exploit particularities of the problem at hand to develop an intelligent initialization scheme. More precisely, distance estimates obtained at each reference point are used to determine the regions in which a source is most likely to be located. Secondly, rather than letting elephants to simply wander around in their search for an update of the source location, we base their motion on a local search scheme which is found on a discrete gradient method. Such a methodology significantly accelerates the convergence of the proposed algorithm, and comes at a very low computational cost, since discretization allows us to avoid the actual gradient computations. Our simulation results show that, in terms of localization accuracy, the proposed approach significantly outperforms the standard EHO one for low noise settings and matches the performance of an existing enhanced version of EHO (EEHO). Nonetheless, the proposed scheme achieves this accuracy with significantly less number of function evaluations, which translates to greatly accelerated convergence in comparison with EHO and EEHO. Finally, it is also worth mentioning that the proposed methodology can be extended to any population-based metaheuristic method (it is not only restricted to EHO), which tackles the localization problem indirectly through distance measurements.publishersversionpublishe

A Survey on Natural Inspired Computing (NIC): Algorithms and Challenges

Nature employs interactive images to incorporate end users2019; awareness and implication aptitude form inspirations into statistical/algorithmic information investigation procedures. Nature-inspired Computing (NIC) is an energetic research exploration field that has appliances in various areas, like as optimization, computational intelligence, evolutionary computation, multi-objective optimization, data mining, resource management, robotics, transportation and vehicle routing. The promising playing field of NIC focal point on managing substantial, assorted and self-motivated dimensions of information all the way through the incorporation of individual opinion by means of inspiration as well as communication methods in the study practices. In addition, it is the permutation of correlated study parts together with Bio-inspired computing, Artificial Intelligence and Machine learning that revolves efficient diagnostics interested in a competent pasture of study. This article intend at given that a summary of Nature-inspired Computing, its capacity and concepts and particulars the most significant scientific study algorithms in the field

A NOVEL APPROACH BASED ON ELEPHANT HERDING OPTIMIZATION FOR CONSTRAINED OPTIMIZATION PROBLEMS

Many real-world problems can be formulated as an optimization problem and they have some constraints generally. To overcome these constraints, bio-inspired algorithms are adapted to constrained optimization using constraint handling methods and some modifications. In this study, a new approach is developed to solve constrained optimization problems with elephant herding optimization algorithm which is a newly-emerging optimization technique. Besides the basic EHO, two EHO variants (EHO-NoB and GL-EHO) are adapted to constrained optimization with this approach. The well-known thirteen constrained benchmark functions are used to analysis the performances of algorithms. Experimental results show that the GL-EHO has a better performance than the basic EHO and other algorithms. In addition, the results of GL-EHO are comparable level with the result of another EHO variant in the literature

A New Enhanced Hybrid Grey Wolf Optimizer (GWO) Combined with Elephant Herding Optimization (EHO) Algorithm for Engineering Optimization

Although the exploitation of GWO advances sharply, it has limitations for continuous implementing exploration. On the other hand, the EHO algorithm easily has shown its capability to prevent local optima. For hybridization and by considering the advantages of GWO and the abilities of EHO, it would be impressive to combine these two algorithms. In this respect, the exploitation and exploration performances and the convergence speed of the GWO algorithm are improved by combining it with the EHO algorithm. Therefore, this paper proposes a new hybrid Grey Wolf Optimizer (GWO) combined with Elephant Herding Optimization (EHO) algorithm. Twenty-three benchmark mathematical optimization challenges and six constrained engineering challenges are used to validate the performance of the suggested GWOEHO compared to both the original GWO and EHO algorithms and some other well-known optimization algorithms. Wilcoxon's rank-sum test outcomes revealed that GWOEHO outperforms others in most function minimization. The results also proved that the convergence speed of GWOEHO is faster than the original algorithms

A Feed-Forward Neural Network Approach for Energy-Based Acoustic Source Localization

N/

Hybrid Elephant Herding and Particle Swarm Optimizations for Optimal DG Integration in Distribution Networks

In this article, the amalgamation of two well-established meta-heuristic optimization methods is presented to solve the multi-objective distributed generation (DG) allocation problem of distribution systems. To overcome some of the shortcomings of newly developed elephant herding optimization (EHO), an improvement is suggested and then, a prominent feature of particle swarm optimization is introduced to the modified version of EHO. The suggested modifications are validated by solving a single objective DG integration problem where various performance parameters of the proposed hybrid method are compared with their individual standard variants. After validation, the proposed technique is exploited to solve a multi-objective DG allocation problem of distribution systems, aiming to minimize power loss and node voltage deviation while simultaneously maximizing the voltage stability index of three benchmark distribution systems namely, 33-bus, 69-bus and 118-bus. The obtained simulation results are further compared with that of the same available in the existing literature. This comparison reveals that the proposed hybrid approach is promising to solve the multi-objective DG integration problem of distribution systems as compared to many existing methods

Introductory Review of Swarm Intelligence Techniques

With the rapid upliftment of technology, there has emerged a dire need to fine-tune or optimize certain processes, software, models or structures, with utmost accuracy and efficiency. Optimization algorithms are preferred over other methods of optimization through experimentation or simulation, for their generic problem-solving abilities and promising efficacy with the least human intervention. In recent times, the inducement of natural phenomena into algorithm design has immensely triggered the efficiency of optimization process for even complex multi-dimensional, non-continuous, non-differentiable and noisy problem search spaces. This chapter deals with the Swarm intelligence (SI) based algorithms or Swarm Optimization Algorithms, which are a subset of the greater Nature Inspired Optimization Algorithms (NIOAs). Swarm intelligence involves the collective study of individuals and their mutual interactions leading to intelligent behavior of the swarm. The chapter presents various population-based SI algorithms, their fundamental structures along with their mathematical models.Comment: Submitted to Springe

A Survey on Natural Inspired Computing (NIC): Algorithms and Challenges

Nature employs interactive images to incorporate end users’ awareness and implication aptitude form inspirations into statistical/algorithmic information investigation procedures. Nature-inspired Computing (NIC) is an energetic research exploration field that has appliances in various areas, like as optimization, computational intelligence, evolutionary computation, multi-objective optimization, data mining, resource management, robotics, transportation and vehicle routing. The promising playing field of NIC focal point on managing substantial, assorted and self-motivated dimensions of information all the way through the incorporation of individual opinion by means of inspiration as well as communication methods in the study practices. In addition, it is the permutation of correlated study parts together with Bio-inspired computing, Artificial Intelligence and Machine learning that revolves efficient diagnostics interested in a competent pasture of study. This article intend at given that a summary of Nature-inspired Computing, its capacity and concepts and particulars the most significant scientific study algorithms in the field