Tags
Language
Tags
June 2025
Su Mo Tu We Th Fr Sa
1 2 3 4 5 6 7
8 9 10 11 12 13 14
15 16 17 18 19 20 21
22 23 24 25 26 27 28
29 30 1 2 3 4 5
    Attention❗ To save your time, in order to download anything on this site, you must be registered 👉 HERE. If you do not have a registration yet, it is better to do it right away. ✌

    ( • )( • ) ( ͡⚆ ͜ʖ ͡⚆ ) (‿ˠ‿)
    SpicyMags.xyz

    Evolutionary Optimization (International Series in Operations Research & Management Science)

    Posted By: mox1x2
    Evolutionary Optimization (International Series in Operations Research & Management Science)

    Ruhul Sarker (Editor), Masoud Mohammadian (Editor), Xin Yao (Editor), "Evolutionary Optimization (International Series in Operations Research & Management Science)"
    Pages: 432 | Publisher: Springer; 1 edition (January 1, 2002) |ISBN-10: 0792376544 | English | PDF | 8.9 MB

    The use of evolutionary computation techniques has grown considerably over the past several years. Over this time, the use and applications of these techniques have been further enhanced resulting in a set of computational intelligence (also known as modern heuristics) tools that are particularly adept for solving complex optimization problems. Moreover, they are characteristically more robust than traditional methods based on formal logics or mathematical programming for many real world OR/MS problems. Hence, evolutionary computation techniques have dealt with complex optimization problems better than traditional optimization techniques although they can be applied to easy and simple problems where conventional techniques work well. Clearly there is a need for a volume that both reviews state-of-the-art evolutionary computation techniques, and surveys the most recent developments in their use for solving complex OR/MS problems. This volume on Evolutionary Optimization seeks to fill this need.

    Review:
    "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)