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
来源：
IEEJ Transactions on Electronics, Information and Systems | 2010年 / 130卷 / 03期
关键词：
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 条
  • [41] Probability learning based tabu search for the budgeted maximum coverage problem
    Li, Liwen
    Wei, Zequn
    Hao, Jin-Kao
    He, Kun
    EXPERT SYSTEMS WITH APPLICATIONS, 2021, 183
  • [42] A Modified Genetic Algorithm with Local Search Strategies and Multi-Crossover Operator for Job Shop Scheduling Problem
    Viana, Monique Simplicio
    Morandin Junior, Orides
    Contreras, Rodrigo Colnago
    SENSORS, 2020, 20 (18) : 1 - 32
  • [43] A Novel Strategy Adaptive Genetic Algorithm with Greedy Local Search for the Permutation Flowshop Scheduling Problem
    Ganguly, Srinjoy
    Mukherjee, Swahum
    Basu, Debabrota
    Das, Swagatam
    SWARM, EVOLUTIONARY, AND MEMETIC COMPUTING, (SEMCCO 2012), 2012, 7677 : 687 - +
  • [44] The local search algorithms for maximum 3-satisfiablility problem
    Zhu D.-M.
    Ma S.-H.
    Zhang P.-P.
    Jisuanji Xuebao/Chinese Journal of Computers, 2010, 33 (07): : 1127 - 1139
  • [45] An Efficient Local Search for the Maximum Edge Weighted Clique Problem
    Li, Ruizhi
    Wu, Xiaoli
    Liu, Huan
    Wu, Jun
    Yin, Minghao
    IEEE ACCESS, 2018, 6 : 10743 - 10753
  • [46] An Efficient Local Search for the Maximum Clique Problem on Massive Graphs
    Kanahara, Kazuho
    Oda, Tetsuya
    Kulla, Elis
    Uejima, Akira
    Katayama, Kengo
    ADVANCES IN INTERNET, DATA & WEB TECHNOLOGIES (EIDWT-2022), 2022, 118 : 201 - 211
  • [47] Reactive Local Search for the Maximum Clique Problem1
    R. Battiti
    M. Protasi
    Algorithmica, 2001, 29 : 610 - 637
  • [48] Large Neighborhood Local Search for the Maximum Set Packing Problem
    Sviridenko, Maxim
    Ward, Justin
    AUTOMATA, LANGUAGES, AND PROGRAMMING, PT I, 2013, 7965 : 792 - 803
  • [49] Smoothed Analysis of Local Search for the Maximum-Cut Problem
    Etscheid, Michael
    Roglin, Heiko
    ACM TRANSACTIONS ON ALGORITHMS, 2017, 13 (02)
  • [50] Genetic Algorithm - Adaptive Crossover Based on Solution Distribution in Search Space
    Maniu, Rares
    Dumitru, Laurentiu Alexandru
    2017 INTERNATIONAL CONFERENCE ON OPTIMIZATION OF ELECTRICAL AND ELECTRONIC EQUIPMENT (OPTIM) & 2017 INTL AEGEAN CONFERENCE ON ELECTRICAL MACHINES AND POWER ELECTRONICS (ACEMP), 2017, : 899 - 904
12345