Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Linkage in Evolutionary Computation

Linkage in Evolutionary Computation

Chen, Ying-Ping

Hardcover

Series: Studies in Computational Intelligence, Book 157

General ComputersGeneral Mathematics

ISBN10: 3540850678
ISBN13: 9783540850670
Publisher: Springer
Published: Sep 26 2008
Pages: 488
Weight: 1.85
Height: 1.30 Width: 6.20 Depth: 9.30
Language: English

In recent years, the issue of linkage in GEAs has garnered greater attention and recognition from researchers. Conventional approaches that rely much on ad hoc tweaking of parameters to control the search by balancing the level of exploitation and exploration are grossly inadequate. As shown in the work reported here, such parameters tweaking based approaches have their limits; they can be easily fooled by cases of triviality or peculiarity of the class of problems that the algorithms are designed to handle. Furthermore, these approaches are usually blind to the interactions between the decision variables, thereby disrupting the partial solutions that are being built up along the way.

Also from

Chen, Ying-Ping

View All

Also in

General Mathematics

View All