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 条
  • [31] The multiple flying sidekicks traveling salesman problem with variable drone speeds
    Raj, Ritwik
    Murray, Chase
    [J]. TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2020, 120
  • [32] Heuristics using a variable neighborhood approach for the clustered traveling salesman problem
    Mestria, Mario
    [J]. REVISTA DE GESTAO E SECRETARIADO-GESEC, 2023, 14 (07): : 12085 - 12098
  • [33] Memetic algorithm based on sequential variable neighborhood descent for the minmax multiple traveling salesman problem
    Wang, Yongzhen
    Chen, Yan
    Lin, Yan
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 106 : 105 - 122
  • [34] On multistep tumor growth models of fractional variable-order
    Valentim, Carlos A.
    Rabi, Jose A.
    David, Sergio A.
    Tenreiro Machado, Jose A.
    [J]. BIOSYSTEMS, 2021, 199
  • [35] Efficient method for solving variable-order pantograph models
    Hoda F Ahmed
    Marina B Melad
    [J]. Pramana, 2021, 95
  • [36] Optimization Models and Heuristic Method Based on Simulated Annealing Strategy for Traveling Salesman Problem
    Hao, Xu
    [J]. MECHANICAL ENGINEERING AND GREEN MANUFACTURING, PTS 1 AND 2, 2010, : 1180 - 1184
  • [37] Efficient method for solving variable-order pantograph models
    Sohail, Muhammad
    Alrabaiah, Hussam
    Ali, Umair
    Zohra, Fatema Tuz
    Selim, Mahmoud M.
    Thounthong, Phatiphat
    [J]. PRAMANA-JOURNAL OF PHYSICS, 2021, 95 (04):
  • [38] Joint Modeling of User Behaviors Based on Variable-Order Additive Markov Chain for POI Recommendation
    Li, RuiChang
    [J]. WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2021, 2021
  • [39] Dynamic traveling salesman problem based on evolutionary computation
    Huang, ZC
    Hu, XL
    Chen, SD
    [J]. PROCEEDINGS OF THE 2001 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2, 2001, : 1283 - 1288
  • [40] Fast EAX algorithm considering population diversity for traveling salesman problems
    Nagata, Yuichi
    [J]. EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2006, 3906 : 171 - 182