This paper summaries our recent work on combining estimation of distribution algorithms （EDA） and other techniques for solving hard search and optimization problems： a） guided mutation, an offspring generator in w...This paper summaries our recent work on combining estimation of distribution algorithms （EDA） and other techniques for solving hard search and optimization problems： a） guided mutation, an offspring generator in which the ideas from EDAs and genetic algorithms are combined together, we have shown that an evolutionary algorithm with guided mutation outperforms the best GA for the maximum clique problem, b） evolutionary algorithms refining a heuristic, we advocate a strategy for solving a hard optimization problem with complicated data structure, and c） combination of two different local search techniques and EDA for numerical global optimization problems, its basic idea is that not all the new generated points are needed to be improved by an expensive local search.展开更多
文摘This paper summaries our recent work on combining estimation of distribution algorithms （EDA） and other techniques for solving hard search and optimization problems： a） guided mutation, an offspring generator in which the ideas from EDAs and genetic algorithms are combined together, we have shown that an evolutionary algorithm with guided mutation outperforms the best GA for the maximum clique problem, b） evolutionary algorithms refining a heuristic, we advocate a strategy for solving a hard optimization problem with complicated data structure, and c） combination of two different local search techniques and EDA for numerical global optimization problems, its basic idea is that not all the new generated points are needed to be improved by an expensive local search.
