A new hybrid genetic algorithm for the maximally diverse grouping problem

被引:0
|
作者
Kavita Singh
Shyam Sundar
机构
[1] National Institute of Technology Raipur,Department of Computer Applications
关键词
Maximally diverse grouping problem; Steady-state genetic algorithm; Crossover; Replacement strategy; Local search;
D O I
暂无
中图分类号
学科分类号
摘要
This paper presents a new hybrid approach (N\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {N}$$\end{document}SGGA) combining steady-state grouping genetic algorithm with a local search for the maximally diverse grouping problem (MDGP) related to equal group-size. The MDGP is a well-known NP\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {NP}$$\end{document}-Hard combinatorial optimization problem and finds numerous applications in real world. N\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {N}$$\end{document}SGGA employs particularly (a) crossover operator (b) the effective way of utilization of local search and (c) the additional replacement strategy, making it different from the existing genetic algorithm for the MDGP. On a set of large benchmark instances, N\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {N}$$\end{document}SGGA is competitive in comparison to the existing best-known approaches in the literature and performs particularly well on large-size instances. Some important ingredients of N\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {N}$$\end{document}SGGA that shed some light on the adequacy of N\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {N}$$\end{document}SGGA are analyzed.
引用
收藏
页码:2921 / 2940
页数:19
相关论文
共 50 条
  • [1] A new hybrid genetic algorithm for the maximally diverse grouping problem
    Singh, Kavita
    Sundar, Shyam
    [J]. INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, 2019, 10 (10) : 2921 - 2940
  • [2] A hybrid genetic algorithmic approach to the maximally diverse grouping problem
    Fan, Z. P.
    Chen, Y.
    Ma, J.
    Zeng, S.
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2011, 62 (01) : 92 - 99
  • [3] An artificial bee colony algorithm for the maximally diverse grouping problem
    Rodriguez, Francisco J.
    Lozano, M.
    Garcia-Martinez, C.
    Gonzalez-Barrera, Jonathan D.
    [J]. INFORMATION SCIENCES, 2013, 230 : 183 - 196
  • [4] A hybrid genetic algorithmic approach to the maximally diverse grouping problem (vol 62, pg 92, 2011)
    Fan, Z. P.
    Chen, Y.
    Ma, J.
    Zeng, S.
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2011, 62 (07) : 1423 - 1430
  • [5] Solving the clique partitioning problem as a maximally diverse grouping problem
    Jack Brimberg
    Stefana Janićijević
    Nenad Mladenović
    Dragan Urošević
    [J]. Optimization Letters, 2017, 11 : 1123 - 1135
  • [6] Solving the clique partitioning problem as a maximally diverse grouping problem
    Brimberg, Jack
    Janicijevic, Stefana
    Mladenovic, Nenad
    Urosevic, Dragan
    [J]. OPTIMIZATION LETTERS, 2017, 11 (06) : 1123 - 1135
  • [7] The balanced maximally diverse grouping problem with block constraints
    Schulz, Arne
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 294 (01) : 42 - 53
  • [8] The balanced maximally diverse grouping problem with attribute values
    Schulz, Arne
    [J]. DISCRETE APPLIED MATHEMATICS, 2023, 335 : 82 - 103
  • [9] Efficient neighborhood evaluation for the maximally diverse grouping problem
    Schulz, Arne
    [J]. ANNALS OF OPERATIONS RESEARCH, 2024,
  • [10] Iterated maxima search for the maximally diverse grouping problem
    Lai, Xiangjing
    Hao, Jin-Kao
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 254 (03) : 780 - 800