Nature-inspired algorithms and applied optimization.

Tipo de material: TextoTextoSeries Studies in computational intelligence ; ; 744Editor: New York, NY : Springer Berlin Heidelberg, 2017Descripción: xi, 330 páginas ilustracionesTipo de contenido: text Tipo de medio: unmediated Tipo de portador: volumeISBN: 9783319676685Tema(s): ALGORITMOS | OPTIMIZACIÓN MATEMÁTICA | INTELIGENCIA ARTIFICIALClasificación CDD: 006.3
Contenidos:
1.- Mathematical analysis of nature algorithms -- 2.- A review of no free lunch theorems, and their implications for metaheuristic optimization -- 3.- Global convergence analysis of cukoo search using markov theory -- 4.- On efficiently solving the vehicle routing problem with time windows using the bat algorithm with random reinsertion operators -- 5.- Variants of the flower pollination algorithm: a review -- 6.- On the hypercomplex-based search spaces for optimization purpose -- 7.- Lévy flight-driven simulated annealing for B-spline curve fitting -- 8.- A comprensive review of the flower pollination algorithm for solving engeering problems -- 9.- Bat algirthm and directional bat algorithm with case studies -- 10.- Applications of flower pollination algorithm in feature selection and knapsack problems -- 11.- Why the firefly algorithm works -- 12.- An efficient computational procedure for simultaneously generating alternatives to an optimal solution using the firefly algorithm -- 13.- Optimization of relay placement in wireless butterfly networks -- 14.- The bat algorithm, variants and some practical engineering applications: a review.-
Etiquetas de esta biblioteca: No hay etiquetas de esta biblioteca para este título. Ingresar para agregar etiquetas.
Valoración
    Valoración media: 0.0 (0 votos)
Existencias
Tipo de ítem Biblioteca actual Colección número de clasificación Copia número Estado Fecha de vencimiento Código de barras
Libro General Libro General Biblioteca Central
Colección General 006.3 N285 (Navegar estantería(Abre debajo)) 1 Prestado 31/03/2022 3560900258693

1.- Mathematical analysis of nature algorithms -- 2.- A review of no free lunch theorems, and their implications for metaheuristic optimization -- 3.- Global convergence analysis of cukoo search using markov theory -- 4.- On efficiently solving the vehicle routing problem with time windows using the bat algorithm with random reinsertion operators -- 5.- Variants of the flower pollination algorithm: a review -- 6.- On the hypercomplex-based search spaces for optimization purpose -- 7.- Lévy flight-driven simulated annealing for B-spline curve fitting -- 8.- A comprensive review of the flower pollination algorithm for solving engeering problems -- 9.- Bat algirthm and directional bat algorithm with case studies -- 10.- Applications of flower pollination algorithm in feature selection and knapsack problems -- 11.- Why the firefly algorithm works -- 12.- An efficient computational procedure for simultaneously generating alternatives to an optimal solution using the firefly algorithm -- 13.- Optimization of relay placement in wireless butterfly networks -- 14.- The bat algorithm, variants and some practical engineering applications: a review.-