Nature-Inspired Algorithms and Applied Optimization [electronic resource] / edited by Xin-She Yang.

Colaborador(es): Yang, Xin-She [editor.] | SpringerLink (Online service)Tipo de material: TextoTextoSeries Studies in Computational Intelligence ; 744Editor: Cham : Springer International Publishing : Imprint: Springer, 2018Edición: 1st ed. 2018Descripción: XI, 330 p. 42 illus., 28 illus. in color. online resourceTipo de contenido: text Tipo de medio: computer Tipo de portador: online resourceISBN: 9783319676692Tema(s): Computational intelligence | Artificial intelligence | Algorithms | Mathematical optimization | Computational Intelligence | Artificial Intelligence | Algorithms | OptimizationFormatos físicos adicionales: Printed edition:: Sin título; Printed edition:: Sin título; Printed edition:: Sin títuloClasificación CDD: 006.3 Clasificación LoC:Q342Recursos en línea: Libro electrónicoTexto
Contenidos:
Mathematical Analysis of Nature-Inspired Algorithms -- A Review of No Free Lunch Theorems, and their Implications for Metaheuristic Optimisation -- Global Convergence Analysis of Cuckoo Search Using Markov Theory -- On Effeciently Solving the Vehicle Routing Problem with Time Windows Using the Bat Algorithm -- Variants of the Flower Pollination Algorithm: A Review.
En: Springer Nature eBookResumen: This book reviews the state-of-the-art developments in nature-inspired algorithms and their applications in various disciplines, ranging from feature selection and engineering design optimization to scheduling and vehicle routing. It introduces each algorithm and its implementation with case studies as well as extensive literature reviews, and also includes self-contained chapters featuring theoretical analyses, such as convergence analysis and no-free-lunch theorems so as to provide insights into the current nature-inspired optimization algorithms. Topics include ant colony optimization, the bat algorithm, B-spline curve fitting, cuckoo search, feature selection, economic load dispatch, the firefly algorithm, the flower pollination algorithm, knapsack problem, octonian and quaternion representations, particle swarm optimization, scheduling, wireless networks, vehicle routing with time windows, and maximally different alternatives. This timely book serves as a practical guide and reference resource for students, researchers and professionals.
Star ratings
    Valoración media: 0.0 (0 votos)
Existencias
Tipo de ítem Biblioteca actual Colección Signatura Copia número Estado Fecha de vencimiento Código de barras
Libro Electrónico Biblioteca Electrónica
Colección de Libros Electrónicos 1 No para préstamo

Acceso multiusuario

Mathematical Analysis of Nature-Inspired Algorithms -- A Review of No Free Lunch Theorems, and their Implications for Metaheuristic Optimisation -- Global Convergence Analysis of Cuckoo Search Using Markov Theory -- On Effeciently Solving the Vehicle Routing Problem with Time Windows Using the Bat Algorithm -- Variants of the Flower Pollination Algorithm: A Review.

This book reviews the state-of-the-art developments in nature-inspired algorithms and their applications in various disciplines, ranging from feature selection and engineering design optimization to scheduling and vehicle routing. It introduces each algorithm and its implementation with case studies as well as extensive literature reviews, and also includes self-contained chapters featuring theoretical analyses, such as convergence analysis and no-free-lunch theorems so as to provide insights into the current nature-inspired optimization algorithms. Topics include ant colony optimization, the bat algorithm, B-spline curve fitting, cuckoo search, feature selection, economic load dispatch, the firefly algorithm, the flower pollination algorithm, knapsack problem, octonian and quaternion representations, particle swarm optimization, scheduling, wireless networks, vehicle routing with time windows, and maximally different alternatives. This timely book serves as a practical guide and reference resource for students, researchers and professionals.

UABC ; Temporal ; 01/01/2021-12/31/2023.

Con tecnología Koha