Advances in Metaheuristics Algorithms: Methods and Applications von Cuevas, Erik; Zald�var, Daniel; P�rez-Cisneros, Marco: New (2018)

Beschreibung

Print on Demand pp. XIV, 218 48 illus., 13 illus. in color.

Bestandsnummer des Verk�ufers 379350476

Verk�ufer kontaktieren

Diesen Artikel melden

Bibliografische Details

Titel: Advances in Metaheuristics Algorithms: Methods and Applications
Verlag: Springer
Ver�ffentlichungsdatum: 2018
Sprache: Englisch
ISBN-10: 3319893084
ISBN-13: 9783319893082
Bindung: Hardcover
Zustand: New

�ber diesen Titel

Inhaltsangabe

This book explores new alternative metaheuristic developments that have proved to be effective in their application to several complex problems. Though most of the new metaheuristic algorithms considered offer promising results, they are nevertheless still in their infancy. To grow and attain their full potential, new metaheuristic methods must be applied in a great variety of problems and contexts, so that they not only perform well in their reported sets of optimization problems, but also in new complex formulations. The only way to accomplish this is to disseminate these methods in various technical areas as optimization tools. In general, once a scientist, engineer or practitioner recognizes a problem as a particular instance of a more generic class, he/she can select one of several metaheuristic algorithms that guarantee an expected optimization performance. Unfortunately, the set of options are concentrated on algorithms whose popularity and high proliferation outstrip those of the new developments. This structure is important, because the authors recognize this methodology as the best way to help researchers, lecturers, engineers and practitioners solve their own optimization problems.

Von der hinteren Coverseite

This book explores new alternative metaheuristic developments that have proved to be effective in their application to several complex problems. Though most of the new metaheuristic algorithms considered offer promising results, they are nevertheless still in their infancy. To grow and attain their full potential, new metaheuristic methods must be applied in a great variety of problems and contexts, so that they not only perform well in their reported sets of optimization problems, but also in new complex formulations. The only way to accomplish this is to disseminate these methods in various technical areas as optimization tools. In general, once a scientist, engineer or practitioner recognizes a problem as a particular instance of a more generic class, he/she can select one of several metaheuristic algorithms that guarantee an expected optimization performance. Unfortunately, the set of options are concentrated on algorithms whose popularity and high proliferation outstrip those of the new developments. This structure is important, because the authors recognize this methodology as the best way to help researchers, lecturers, engineers and practitioners solve their own optimization problems.

��ber diesen Titel� kann sich auf eine andere Ausgabe dieses Titels beziehen.