Valdez / Carreon-Ortiz / Castillo Mycorrhiza Optimization Algorithm

1. Auflage 2023
ISBN: 978-3-031-47369-2
Verlag: Springer International Publishing
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, 78 Seiten, eBook

Reihe: SpringerBriefs in Computational Intelligence

This book provides two new optimization algorithms to address real optimization problems. Optimization is a fundamental concept in engineering and science, and its applications are needed in many fields. From designing products and systems to developing algorithms and models, optimization plays a critical role in achieving efficient and effective solutions to complex problems. Optimization algorithms inspired by nature have proven effective in solving a wide range of problems, including those in engineering, finance, and machine learning. These algorithms are often used when traditional optimization techniques are impractical due to the size or complexity of the problem. In this book, we are presenting two new optimization algorithms inspired by plant roots and the Mycorrhiza Network. The first algorithm is called the Continuous Mycorrhiza Optimization Algorithm (CMOA), which was proposed based on the model of the Continuous Lotka-Volterra System Equations. The second algorithm is called the Discrete Mycorrhiza Optimization Algorithm (DMOA), which design based on the model of Discrete Lotka-Volterra System Equations. By mastering the proposed algorithms, the readers able to develop innovative solutions that improve efficiency, reduce costs, and improve performance in the corresponding field of work.

Zielgruppe

Research

Autoren/Hrsg.

Valdez, Fevrier

Carreon-Ortiz, Hector

Castillo, Oscar

Inhaltsverzeichnis

Introduction to the Mycorrhiza Optimization Algorithm.- Theory for the Mycorrhiza Optimization Algorithm.- Background for the Mycorrhiza Algorithm.- Problem Definition.- CMOA – Continuous Mycorrhiza Optimization Algorithm.- DMOA – Discrete Mycorrhiza Optimization Algorithm.- Conclusions of the Mycorrhiza Optimization Algorithm.