menu
{ "item_title" : "Self-Adaptive Heuristics for Evolutionary Computation", "item_author" : [" Oliver Kramer "], "item_description" : "Evolutionary algorithms are successful biologically inspired meta-heuristics. Their success depends on adequate parameter settings. The question arises: how can evolutionary algorithms learn parameters automatically during the optimization? Evolution strategies gave an answer decades ago: self-adaptation. Their self-adaptive mutation control turned out to be exceptionally successful. But nevertheless self-adaptation has not achieved the attention it deserves. This book introduces various types of self-adaptive parameters for evolutionary computation. Biased mutation for evolution strategies is useful for constrained search spaces. Self-adaptive inversion mutation accelerates the search on combinatorial TSP-like problems. After the analysis of self-adaptive crossover operators the book concentrates on premature convergence of self-adaptive mutation control at the constraint boundary. Besides extensive experiments, statistical tests and some theoretical investigations enrich the analysis of the proposed concepts.", "item_img_path" : "https://covers2.booksamillion.com/covers/bam/3/54/069/280/3540692800_b.jpg", "price_data" : { "retail_price" : "109.99", "online_price" : "109.99", "our_price" : "109.99", "club_price" : "109.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Self-Adaptive Heuristics for Evolutionary Computation|Oliver Kramer

Self-Adaptive Heuristics for Evolutionary Computation

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

Evolutionary algorithms are successful biologically inspired meta-heuristics. Their success depends on adequate parameter settings. The question arises: how can evolutionary algorithms learn parameters automatically during the optimization? Evolution strategies gave an answer decades ago: self-adaptation. Their self-adaptive mutation control turned out to be exceptionally successful. But nevertheless self-adaptation has not achieved the attention it deserves. This book introduces various types of self-adaptive parameters for evolutionary computation. Biased mutation for evolution strategies is useful for constrained search spaces. Self-adaptive inversion mutation accelerates the search on combinatorial TSP-like problems. After the analysis of self-adaptive crossover operators the book concentrates on premature convergence of self-adaptive mutation control at the constraint boundary. Besides extensive experiments, statistical tests and some theoretical investigations enrich the analysis of the proposed concepts.

This item is Non-Returnable

Details

  • ISBN-13: 9783540692805
  • ISBN-10: 3540692800
  • Publisher: Springer
  • Publish Date: August 2008
  • Dimensions: 9.4 x 6.2 x 0.6 inches
  • Shipping Weight: 0.9 pounds
  • Page Count: 182

Related Categories

You May Also Like...

    1

BAM Customer Reviews