Cantitate/Preț
Produs

Evolutionary Optimization: International Series in Operations Research & Management Science, cartea 48

Editat de Ruhul Sarker, Masoud Mohammadian, Xin Yao
en Limba Engleză Hardback – 31 ian 2002
Evolutionary computation techniques have attracted increasing att- tions in recent years for solving complex optimization problems. They are more robust than traditional methods based on formal logics or mathematical programming for many real world OR/MS problems. E- lutionary computation techniques can deal with complex optimization problems better than traditional optimization techniques. However, most papers on the application of evolutionary computation techniques to Operations Research /Management Science (OR/MS) problems have scattered around in different journals and conference proceedings. They also tend to focus on a very special and narrow topic. It is the right time that an archival book series publishes a special volume which - cludes critical reviews of the state-of-art of those evolutionary com- tation techniques which have been found particularly useful for OR/MS problems, and a collection of papers which represent the latest devel- ment in tackling various OR/MS problems by evolutionary computation techniques. This special volume of the book series on Evolutionary - timization aims at filling in this gap in the current literature. The special volume consists of invited papers written by leading - searchers in the field. All papers were peer reviewed by at least two recognised reviewers. The book covers the foundation as well as the practical side of evolutionary optimization.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 95114 lei  6-8 săpt.
  Springer Us – 23 mar 2013 95114 lei  6-8 săpt.
Hardback (1) 95732 lei  6-8 săpt.
  Springer Us – 31 ian 2002 95732 lei  6-8 săpt.

Din seria International Series in Operations Research & Management Science

Preț: 95732 lei

Preț vechi: 116745 lei
-18% Nou

Puncte Express: 1436

Preț estimativ în valută:
18320 18762$ 15240£

Carte tipărită la comandă

Livrare economică 19 martie-02 aprilie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780792376545
ISBN-10: 0792376544
Pagini: 418
Ilustrații: XIV, 418 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.79 kg
Ediția:2002
Editura: Springer Us
Colecția Springer
Seria International Series in Operations Research & Management Science

Locul publicării:New York, NY, United States

Public țintă

Research

Cuprins

Conventional Optimization Techniques.- Evolutionary Computation.- Single Objective Optimization.- Evolutionary Algorithms and Constrained Optimization.- Constrained Evolutionary Optimization.- Multi-Objective Optimization.- Evolutionary Multi-Objective Optimization: A Critical Review.- Multi-Objective Evolutionary Algorithms for Engineering Shape Design.- Assessment Methodologies for Multiobjective Evolutionary Algorithms.- Hybrid Algorithms.- Utilizing Hybrid Genetic Algorithms.- Using Evolutionary Algorithms to Solve Problems by Combining Choices of Heuristics.- Constrained Genetic Algorithms and Their Applications in Nonlinear Constrained Optimization.- Parameter Selection in EAs.- Parameter Selection.- Application of EAs to Practical Problems.- Design of Production Facilities Using Evolutionary Computing.- Virtual Population and Acceleration Techniques for Evolutionary Power Flow Calculation in Power Systems.- Application of EAs to Theoretical Problems.- Methods for the Analysis of Evolutionary Algorithms on Pseudo-Boolean Functions.- A Genetic Algorithm Heuristic for Finite Horizon Partially Observed Markov Decision Problems.- Using Genetic Algorithms to Find Good K-Tree Subgraphs.

Recenzii

From the reviews:
"The book contains 17 chapters written by leading experts in evolutionary computation. … Of special value is the analysis of evolutionary algorithms on pseudo-Boolean functions, given by Ingo Wegener. He and his coauthors are the first, who proved substantially sharp results on the expected run time and the success probability for evolutionary algorithms with (respectively without) crossover, giving sharp upper and lower bounds." (Hartmut Noltemeier, Zentralblatt MATH, Vol. 1072 (23), 2005)