Targeted EDA Adapted for a Routing Problem with Variable Length Chromosomes

Citation

Neumann G & Cairns D (2012) Targeted EDA Adapted for a Routing Problem with Variable Length Chromosomes. In: Li X (ed.) Proceedings of the 2012 IEEE Congress on Evolutionary Computation (CEC). 2012 IEEE Congress on Evolutionary Computation (CEC), Brisbane, Australia, 10.06.2012-15.06.2012. Brisbane, Australia: IEEE, pp. 334-341. https://doi.org/10.1109/CEC.2012.6256531

Abstract
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.

Keywords
Genetic Algorithms, Estimation of distribution algorithms