Author
Listed:
- Joseph L. Awange
(Curtin University, Department of Spatial Sciences, School of Earth and Planetary Sciences)
- Béla Paláncz
(Budapest University of Technology and Economics, Department of Geodesy and Surveying, Faculty of Civil Engineering)
- Robert H. Lewis
(Fordham University)
- Lajos Völgyesi
(Budapest University of Technology and Economics, Department of Geodesy and Surveying, Faculty of Civil Engineering)
Abstract
The concept of Meta-heuristic algorithms are discussed. Detailed algorithms for the Particle Swarm and Black Hole methods are given and demonstrated by 1D and 2D examples for solving nonlinear systems and polynomial programming. Different global optimization techniques, such as simulated annealing, differential evolution, random search and black hole, are compared. Summary Meta-heuristic algorithms widely used to solve real-life global optimization problems have a number of attractive properties that have ensured their success among engineers and practitioners. First, they have limpid nature-inspired interpretations explaining how these algorithms simulate behaviors of populations of individuals. Other reasons that have led to a wide spread of meta-heuristics are the following; they do not require high level of mathematical preparation to understand them, their implementations are usually simple and many codes are freely available. Finally, they do not need a lot of memory as they work at each moment with only a limited population of points in the search domain. On the flip side, meta-heuristics have some drawbacks, which include usually a high number of parameters to tune, and the absence of rigorously proven global convergence conditions ensuring that sequences of trial points generated by these methods always converge to the global solution x*. In fact, populations used by these methods can degenerate prematurely, returning only a locally optimal solution instead of a global one or even non-locally optimal point if it has been obtained at one of the last evaluations of f(x) and the budget of M evaluations has not allowed it to proceed with an improvement of the obtained solution. Nature Inspired Global Optimization Meta-heuristic algorithms are based on natural phenomenon such as Particle Swarm Optimization simulating fish schools or bird groups, Firefly Algorithm simulating the flashing behavior of the fireflies, Artificial Bee or Ant Colony representing a colony of bees or ants in search of the food sources, Differential Evolution and Genetic algorithms simulating the evolution on a phenotype and genotype levels, respectively, Harmony Search method is inspired by the underlying principles of the musicians’ improvisation of the harmony, Black Hole Algorithm is motivated by the black hole phenomenon, namely if a star gets too close to the black hole, it will be swallowed by the black hole and is gone forever, Immunized Evolutionary Programming where adaptive mutation and selection operations based on adjustment of artificial immune system, Cuckoo Search based on the brood parasitism of some cuckoo species, along with Levy flights random walks, just to mention some of them, see (Haneen et al. 2019). In this section, extending on the works of (Awange et al. in Encyclopedia of mathematical geosciences. Encyclopedia of earth sciences series. Springer, Cham, (2021)), a detailed exposition of the topic is presented.
Suggested Citation
Joseph L. Awange & Béla Paláncz & Robert H. Lewis & Lajos Völgyesi, 2023.
"Nature Inspired Global Optimization,"
Springer Books, in: Mathematical Geosciences, edition 2, chapter 7, pages 239-273,
Springer.
Handle:
RePEc:spr:sprchp:978-3-030-92495-9_7
DOI: 10.1007/978-3-030-92495-9_7
Download full text from publisher
To our knowledge, this item is not available for
download. To find whether it is available, there are three
options:
1. Check below whether another version of this item is available online.
2. Check on the provider's
web page
whether it is in fact available.
3. Perform a
for a similarly titled item that would be
available.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-030-92495-9_7. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.