Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

High-Order Entropy-Based Population Diversity Measures in the Traveling Salesman Problem

High-Order Entropy-Based Population Diversity Measures in the Traveling Salesman Problem To maintain the population diversity of genetic algorithms (GAs), we are required to employ an appropriate population diversity measure. However, commonly used population diversity measures designed for permutation problems do not consider the dependencies between the variables of the individuals in the population. We propose three types of population diversity measures that address high-order dependencies between the variables to investigate the effectiveness of considering high-order dependencies. The first is formulated as the entropy of the probability distribution of individuals estimated from the population based on an m-th--order Markov model. The second is an extension of the first. The third is similar to the first, but it is based on a variable order Markov model. The proposed population diversity measures are incorporated into the evaluation function of a GA for the traveling salesman problem to maintain population diversity. Experimental results demonstrate the effectiveness of the three types of high-order entropy-based population diversity measures against the commonly used population diversity measures. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Evolutionary Computation MIT Press

High-Order Entropy-Based Population Diversity Measures in the Traveling Salesman Problem

Evolutionary Computation , Volume 28 (4): 25 – Dec 4, 2020

Loading next page...
 
/lp/mit-press/high-order-entropy-based-population-diversity-measures-in-the-0JUiRKCahO

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
MIT Press
Copyright
Copyright © MIT Press
ISSN
1063-6560
eISSN
1530-9304
DOI
10.1162/evco_a_00268
Publisher site
See Article on Publisher Site

Abstract

To maintain the population diversity of genetic algorithms (GAs), we are required to employ an appropriate population diversity measure. However, commonly used population diversity measures designed for permutation problems do not consider the dependencies between the variables of the individuals in the population. We propose three types of population diversity measures that address high-order dependencies between the variables to investigate the effectiveness of considering high-order dependencies. The first is formulated as the entropy of the probability distribution of individuals estimated from the population based on an m-th--order Markov model. The second is an extension of the first. The third is similar to the first, but it is based on a variable order Markov model. The proposed population diversity measures are incorporated into the evaluation function of a GA for the traveling salesman problem to maintain population diversity. Experimental results demonstrate the effectiveness of the three types of high-order entropy-based population diversity measures against the commonly used population diversity measures.

Journal

Evolutionary ComputationMIT Press

Published: Dec 4, 2020

There are no references for this article.