國立虎尾科技大學 |

Stable Mutations for Evolutionary Algorithms

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Stable Mutations for Evolutionary Algorithms/ by Andrzej Obuchowicz.
作者:	Obuchowicz, Andrzej.
面頁冊數:	XIV, 164 p. 69 illus., 11 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Computational intelligence. -
電子資源:	https://doi.org/10.1007/978-3-030-01548-0
ISBN:	9783030015480

Stable Mutations for Evolutionary Algorithms
Obuchowicz, Andrzej.

Stable Mutations for Evolutionary Algorithms[electronic resource] /by Andrzej Obuchowicz. - 1st ed. 2019. - XIV, 164 p. 69 illus., 11 illus. in color.online resource. - Studies in Computational Intelligence,7971860-949X ;. - Studies in Computational Intelligence,564.

Chapter 1. Introduction -- Chapter 2. Foundations of evolutionary algorithms -- Chapter 3. Stable distributions -- Chapter 4. Non-isotropic stable mutation etc.

This book presents a set of theoretical and experimental results that describe the features of the wide family of α-stable distributions (the normal distribution also belongs to this class) and their various applications in the mutation operator of evolutionary algorithms based on real-number representation of the individuals, and, above all, equip these algorithms with features that enrich their effectiveness in solving multi-modal, multi-dimensional global optimization problems. The overall conclusion of the research presented is that the appropriate choice of probabilistic model of the mutation operator for an optimization problem is crucial. Mutation is one of the most important operations in stochastic global optimization algorithms in the n-dimensional real space. It determines the method of search space exploration and exploitation. Most applications of these algorithms employ the normal mutation as a mutation operator. This choice is justified by the central limit theorem but is associated with a set of important limitations. Application of α-stable distributions allows more flexible evolutionary models to be obtained than those with the normal distribution. The book presents theoretical analysis and simulation experiments, which were selected and constructed to expose the most important features of the examined mutation techniques based on α-stable distributions. It allows readers to develop a deeper understanding of evolutionary processes with stable mutations and encourages them to apply these techniques to real-world engineering problems.

ISBN: 9783030015480

Standard No.: 10.1007/978-3-030-01548-0doiSubjects--Topical Terms:

568984
Computational intelligence.

LC Class. No.: Q342

Dewey Class. No.: 006.3

Stable Mutations for Evolutionary Algorithms
LDR:03185nam a22004095i 4500 001 1008494
003 DE-He213
005 20200705004549.0
007 cr nn 008mamaa
008 210106s2019 gw | s |||| 0|eng d
020 $a 9783030015480 $9 978-3-030-01548-0
024 7 $a 10.1007/978-3-030-01548-0 $2 doi
035 $a 978-3-030-01548-0
050 4 $a Q342
072 7 $a UYQ $2 bicssc
072 7 $a TEC009000 $2 bisacsh
072 7 $a UYQ $2 thema
082 0 4 $a 006.3 $2 23
100 1 $a Obuchowicz, Andrzej. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1302315
245 1 0 $a Stable Mutations for Evolutionary Algorithms $h [electronic resource] / $c by Andrzej Obuchowicz.
250 $a 1st ed. 2019.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a XIV, 164 p. 69 illus., 11 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Studies in Computational Intelligence, $x 1860-949X ; $v 797
505 0 $a Chapter 1. Introduction -- Chapter 2. Foundations of evolutionary algorithms -- Chapter 3. Stable distributions -- Chapter 4. Non-isotropic stable mutation etc.
520 $a This book presents a set of theoretical and experimental results that describe the features of the wide family of α-stable distributions (the normal distribution also belongs to this class) and their various applications in the mutation operator of evolutionary algorithms based on real-number representation of the individuals, and, above all, equip these algorithms with features that enrich their effectiveness in solving multi-modal, multi-dimensional global optimization problems. The overall conclusion of the research presented is that the appropriate choice of probabilistic model of the mutation operator for an optimization problem is crucial. Mutation is one of the most important operations in stochastic global optimization algorithms in the n-dimensional real space. It determines the method of search space exploration and exploitation. Most applications of these algorithms employ the normal mutation as a mutation operator. This choice is justified by the central limit theorem but is associated with a set of important limitations. Application of α-stable distributions allows more flexible evolutionary models to be obtained than those with the normal distribution. The book presents theoretical analysis and simulation experiments, which were selected and constructed to expose the most important features of the examined mutation techniques based on α-stable distributions. It allows readers to develop a deeper understanding of evolutionary processes with stable mutations and encourages them to apply these techniques to real-world engineering problems.
650 0 $a Computational intelligence. $3 568984
650 0 $a Artificial intelligence. $3 559380
650 1 4 $a Computational Intelligence. $3 768837
650 2 4 $a Artificial Intelligence. $3 646849
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030015473
776 0 8 $i Printed edition: $z 9783030015497
776 0 8 $i Printed edition: $z 9783030131845
830 0 $a Studies in Computational Intelligence, $x 1860-949X ; $v 564 $3 1253640
856 4 0 $u https://doi.org/10.1007/978-3-030-01548-0
912 $a ZDB-2-INR
912 $a ZDB-2-SXIT
950 $a Intelligent Technologies and Robotics (SpringerNature-42732)
950 $a Intelligent Technologies and Robotics (R0) (SpringerNature-43728)