Targeted EDA adapted for a routing problem with variable length chromosomes

IEEE Congress on Evolutionary Computation（2012）

引用 1|浏览3

暂无评分

摘要

Targeted EDA (TEDA), an evolutionary algorithm that combines a targeted intervention principle with Estimation of Distribution Algorithms (EDA), is designed to solve optimal control problems where the number of interventions is an element of solution fitness. This paper applies it to a network routing problem and in doing so adapts it to problems involving variable length chromosomes. We show that TEDA can outperform algorithms using standard crossover techniques such as one and two point crossover on this new problem and in doing so we extend the range of problems that TEDA is effective at solving.

查看译文

关键词

biology computing,cellular biophysics,distributed algorithms,estimation theory,evolutionary computation,optimal control,TEDA,estimation of distribution algorithms,evolutionary algorithm,network routing problem,one point crossover,optimal control problems,solution fitness,standard crossover techniques,targeted EDA,targeted intervention principle,two point crossover,variable length chromosomes

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要