Population Diversity Measures Based on Variable-Order Markov Models for the Traveling Salesman Problem

被引:4
|
作者
Nagata, Yuichi [1 ]
机构
[1] Univ Tokushima, Grad Sch Sci & Technol, Tokushima, Japan
关键词
GENETIC ALGORITHM; CROSSOVER;
D O I
10.1007/978-3-319-45823-6_91
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper presents entropy-based population diversity measures that take into account dependencies between the variables in order to maintain genetic diversity in a GA for the traveling salesman problem. The first one is formulated as the entropy rate of a variable-order Markov process, where the probability of occurrence of each vertex is assumed to be dependent on the preceding vertices of variable length in the population. Compared to the use of a fixed-order Markov model, the variable-order model has the advantage of avoiding the lack of sufficient statistics for the estimation of the exponentially increasing number of conditional probability components as the order of the Markov process increases. Moreover, we develop a more elaborate population diversity measure by further reducing the problem of the lack of statistics
引用
收藏
页码:973 / 983
页数:11
相关论文
共 50 条
  • [1] High-Order Entropy-Based Population Diversity Measures in the Traveling Salesman Problem
    Nagata, Yuichi
    [J]. EVOLUTIONARY COMPUTATION, 2020, 28 (04) : 595 - 619
  • [2] Goal Recognition with Variable-Order Markov Models
    Armentano, Marcelo G.
    Amandi, Analia
    [J]. 21ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-09), PROCEEDINGS, 2009, : 1635 - 1640
  • [3] High-Order Sequence Entropies for Measuring Population Diversity in the Traveling Salesman Problem
    Nagata, Yuichi
    Ono, Isao
    [J]. EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION (EVOCOP 2013), 2013, 7832 : 179 - +
  • [4] A framework for space-efficient variable-order Markov models
    Cunial, Fabio
    Alanko, Jarno
    Belazzougui, Djamal
    [J]. BIOINFORMATICS, 2019, 35 (22) : 4607 - 4616
  • [5] CONTINUOUS VARIABLE REPRESENTATION OF TRAVELING SALESMAN PROBLEM
    SVESTKA, JA
    [J]. MATHEMATICAL PROGRAMMING, 1978, 15 (02) : 211 - 213
  • [6] ANALYSIS OF A PREFERENCE ORDER TRAVELING SALESMAN PROBLEM
    SNIEDOVICH, M
    [J]. OPERATIONS RESEARCH, 1981, 29 (06) : 1234 - 1237
  • [7] A Novel Diversity-based Evolutionary Algorithm for the Traveling Salesman Problem
    Segura, Carlos
    Botello Rionda, Salvador
    Hernandez Aguirre, Arturo
    Ivvan Valdez Pena, S.
    [J]. GECCO'15: PROCEEDINGS OF THE 2015 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2015, : 489 - 496
  • [8] Variable Neighborhood Search for a Colored Traveling Salesman Problem
    Meng, Xianghu
    Li, Jun
    Dai, Xianzhong
    Dou, Jianping
    [J]. IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2018, 19 (04) : 1018 - 1026
  • [9] BAYESIAN ANALYSIS OF VARIABLE-ORDER, REVERSIBLE MARKOV CHAINS
    Bacallado, Sergio
    [J]. ANNALS OF STATISTICS, 2011, 39 (02): : 838 - 864
  • [10] Kernel-based approximation of variable-order diffusion models
    Uddin, Marjan
    Awais, Muhammad
    [J]. INTERNATIONAL JOURNAL OF COMPUTING SCIENCE AND MATHEMATICS, 2022, 16 (02) : 159 - 169