Genetic algorithm with automatic termination and search space rotation

被引:9
|
作者
Ong B.T. [1 ]
Fukushima M. [1 ]
机构
[1] Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University
关键词
Gene matrix; Genetic algorithms; Mutagenesis; Space decomposition; Space rotation; Termination criteria;
D O I
10.1007/s12293-011-0057-8
中图分类号
学科分类号
摘要
In the last two decades, numerous evolutionary algorithms (EAs) have been developed for solving optimization problems. However, only a few works have focused on the question of the termination criteria. Indeed, EAs still need termination criteria prespecified by the user. In this paper, we develop a genetic algorithm (GA) with automatic termination and acceleration elements which allow the search to end without resort to predefined conditions. We call this algorithm "Genetic Algorithm with Automatic Termination and Search Space Rotation", abbreviated as GATR. This algorithm utilizes the so-called "Gene Matrix" (GM) to equip the search process with a self-check in order to judge how much exploration has been performed, while maintaining the population diversity. The algorithm also implements a mutation operator called "mutagenesis" to achieve more efficient and faster exploration and exploitation processes. Moreover, GATR fully exploits the structure of the GM by calling a novel search space decomposition mechanism combined with a search space rotation procedure. As a result, the search operates strictly within two-dimensional subspaces irrespective of the dimension of the original problem. The computational experiments and comparisons with some state-of-the-art EAs demonstrate the effectiveness of the automatic termination criteria and the space decomposition mechanism of GATR. © 2011 Springer-Verlag.
引用
收藏
页码:111 / 127
页数:16
相关论文
共 50 条
  • [31] Efficient termination test for the Nelder-Mead search algorithm
    Singer, S
    Singer, S
    ICNAAM 2004: INTERNATIONAL CONFERENCE ON NUMERICAL ANALYSIS AND APPLIED MATHEMATICS 2004, 2004, : 348 - 351
  • [32] Search space modulation in genetic algorithms - Evolving the search space by sinusoidal transformations
    Martin H., Jose Antonio
    GECCO 2005: Genetic and Evolutionary Computation Conference, Vols 1 and 2, 2005, : 1559 - 1560
  • [33] Automatic resonant cancellation using genetic search
    Nguyen, EM
    Prasad, NR
    SIGNAL PROCESSING, SENSOR FUSION, AND TARGET RECOGNITION VI, 1997, 3068 : 308 - 315
  • [34] Genetic heuristic for search space exploration
    Clergue, M
    Collard, P
    IJCAI-99: PROCEEDINGS OF THE SIXTEENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS 1 & 2, 1999, : 1218 - 1223
  • [35] New topologies for genetic search space
    Kim, Yong-Hyuk
    Moon, Byung-Ro
    GECCO 2005: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOLS 1 AND 2, 2005, : 1393 - 1399
  • [36] Genetic Programming Proof Search Automatic Improvement
    Kocsis, Zoltan A.
    Swan, Jerry
    JOURNAL OF AUTOMATED REASONING, 2018, 60 (02) : 157 - 176
  • [37] AUTOMATIC ARIMA MODELING BY THE CARTESIAN SEARCH ALGORITHM
    HOGLUND, R
    OSTERMARK, R
    JOURNAL OF FORECASTING, 1991, 10 (05) : 465 - 476
  • [38] A scatter search algorithm for the automatic clustering problem
    Abdule-Wahab, Rasha S.
    Monmarche, Nicolas
    Slimane, Mohamed
    Fahdil, Moaid A.
    Saleh, Hilal H.
    ADVANCES IN DATA MINING: APPLICATIONS IN MEDICINE, WEB MINING, MARKETING, IMAGE AND SIGNAL MINING, 2006, 4065 : 350 - 364
  • [39] Invariants of Grover's algorithm and the rotation in space
    Li, DF
    Li, XX
    Huang, HT
    Li, XR
    PHYSICAL REVIEW A, 2002, 66 (04): : 4
  • [40] An automatic tree search algorithm for the Tisserand graph
    de la Torre Sangra, David
    Fantino, Elena
    Flores, Roberto
    Calvente Lozano, Oscar
    Garcia Estelrich, Celestino
    ALEXANDRIA ENGINEERING JOURNAL, 2021, 60 (01) : 1027 - 1041