Genetic local search with adaptive crossover probability and its application to maximum diversity problem

被引:0
|
作者
Asada H. [1 ]
Toyama F. [1 ]
Shoji K. [1 ]
Miyamichi J. [1 ]
机构
[1] Graduate School of Engineering, Utsunomiya University, Utsunomiya-city, Tochigi 321-8585, 7-1-2, Yoto
关键词
Genetic local search; Maximum diversity problem; Metaheuristics;
D O I
10.1541/ieejeiss.130.519
中图分类号
学科分类号
摘要
This paper proposes a genetic local search (GLS) with crossover probability based on the distance between parent individuals. According to the distance between two selected parent individuals, the probability of crossover is decided. This probability is varied depending on the fitness values of parents and their child. By using adaptively varying the probability, the optimal distance between two parents for crossover is estimated. The proposed method is applied to the maximum diversity problem and compared with the previous GLS. © 2010 The Institute of Electrical Engineers of Japan.
引用
收藏
页码:519 / 520
页数:1
相关论文
共 50 条
  • [1] Comparing local search metaheuristics for the maximum diversity problem
    Aringhieri, R.
    Cordone, R.
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2011, 62 (02) : 266 - 280
  • [2] Biased Random-Key Genetic Algorithm with Local Search Applied to the Maximum Diversity Problem
    Silva, Geiza
    Leite, Andre
    Ospina, Raydonal
    Leiva, Victor
    Figueroa-Zuniga, Jorge
    Castro, Cecilia
    MATHEMATICS, 2023, 11 (14)
  • [3] Genetic, iterated and multistart local search for the maximum clique problem
    Marchiori, E
    APPLICATIONS OF EVOLUTIONARY COMPUTING, PROCEEDINGS, 2002, 2279 : 112 - 121
  • [4] Priority-based genetic local search and its application to the traveling salesman problem
    Wei, Jyh-Da
    Lee, D. T.
    SIMULATED EVOLUTION AND LEARNING, PROCEEDINGS, 2006, 4247 : 424 - 432
  • [5] Experimental comparison of greedy randomized adaptive search procedures for the maximum diversity problem
    Silva, GC
    Ochi, LS
    Martins, SL
    EXPERIMENTAL AND EFFICIENT ALGORITHMS, 2004, 3059 : 498 - 512
  • [6] Local search for the maximum parsimony problem
    Goëffon, A
    Richer, JM
    Hao, JK
    ADVANCES IN NATURAL COMPUTATION, PT 3, PROCEEDINGS, 2005, 3612 : 678 - 683
  • [7] Tabu search and GRASP for the maximum diversity problem
    Duarte, Abraham
    Marti, Rafael
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 178 (01) : 71 - 84
  • [8] Iterated tabu search for the maximum diversity problem
    Palubeckis, Gintaras
    APPLIED MATHEMATICS AND COMPUTATION, 2007, 189 (01) : 371 - 383
  • [9] Guided local search and its application to the traveling salesman problem
    Voudouris, C
    Tsang, E
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 113 (02) : 469 - 499
  • [10] Dynamic local search for the maximum clique problem
    Pullan, W
    Hoos, HH
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2006, 25 (159-185): : 159 - 185