Robot 3D (three‐dimension) path planning targets for finding an optimal and collision‐free
path in a 3D workspace while taking into account kinematic constraints (including geometric …

This e-book is devoted to global optimization algorithms, which are methods to find optimal
solutions for given problems. It especially focuses on Evolutionary Computation by …

Memetic Algorithms (MAs) are computational intelligence structures combining multiple and
various operators in order to address optimization problems. The combination and …

Genetic algorithms (GAs) have become popular as a means of solving hard combinatorial
optimization problems. The first part of this chapter briefly traces their history, explains the …

The term 'Memetic Algorithms'[74](MAs) was introduced in the late 80s to denote a family of
metaheuristics that have as central theme the hybridization of different algorithmic …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

This paper addresses how to apply firefly algorithm (FA) for travelling salesman problem
(TSP). Two schemes are studied, ie discrete distance between two fireflies and the …

The present paper applies a heuristic and genetic algorithms approaches to the path
planning problem for Unmanned Aerial Vehicles (UAVs), during an emergency landing …

This chapter reviews applications of Memetic Algorithms in the areas of business analytics
and data science. This approach originates from the need to address optimization problems …

Priority rules combined with schedule generation schemes are a usual approach to online
scheduling. These rules are commonly designed by experts on the problem domain …