Overview
Over the years, the use and application of evolutionary computation techniques has improved 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. This volume reviews evolutionary computation techniques and surveys the most recent developments in their use for solving complex OR/MS problems.
Full Product Details
Author: Ruhul Sarker ,
Masoud Mohammadian ,
Xin Yao
Publisher: Springer
Imprint: Springer
Edition: 2002 ed.
Volume: 48
Dimensions:
Width: 15.50cm
, Height: 2.30cm
, Length: 23.50cm
Weight: 1.730kg
ISBN: 9780792376545
ISBN 10: 0792376544
Pages: 418
Publication Date: 31 January 2002
Audience:
College/higher education
,
Professional and scholarly
,
Undergraduate
,
Postgraduate, Research & Scholarly
Format: Hardback
Publisher's Status: Active
Availability: Out of print, replaced by POD
We will order this item for you from a manufatured on demand supplier.
Reviews
From the reviews: <p> The book contains 17 chapters written by leading experts in evolutionary computation. a ] 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)
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)
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)
