Quantum-inspired metaheuristic algorithms: comprehensive survey and classification

被引:87
|
作者
Gharehchopogh, Farhad Soleimanian [1 ]
机构
[1] Islamic Azad Univ, Dept Comp Engn, Urmia Branch, Orumiyeh, Iran
关键词
Metaheuristics; Optimization; Quantum Computing; Quantum-Inspired; Combinatorial; PARTICLE SWARM OPTIMIZATION; GRAVITATIONAL SEARCH ALGORITHM; BEE COLONY ALGORITHM; IMMUNE CLONAL ALGORITHM; EVOLUTIONARY ALGORITHM; GENETIC ALGORITHM; NEURAL-NETWORK; TABU SEARCH; COMMUNITY DETECTION; UNIT COMMITMENT;
D O I
10.1007/s10462-022-10280-8
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Metaheuristic algorithms are widely known as efficient solutions for solving problems of optimization. These algorithms supply powerful instruments with significant engineering, industry, and science applications. The Quantum-inspired metaheuristic algorithms were developed by integrating Quantum Computing (QC) concepts into metaheuristic algorithms. The QC-inspired metaheuristic algorithms solve combinational and numerical optimization problems to achieve higher-performing results than conventional metaheuristic algorithms. The QC is used more than any other strategy for accelerating convergence, enhancing exploration, and exploitation, significantly influencing metaheuristic algorithms' performance. The QC is a new field of research that includes elements from mathematics, physics, and computing. QC has attracted increasing attention among scientists, technologists, and industrialists. During the current decade, it has provided a research platform for the scientific, technical, and industrial areas. In QC, metaheuristic algorithms can be improved by the parallel processing feature. This feature helps to find the best solutions for optimization problems. The Quantum-inspired metaheuristic algorithms have been used in the optimization fields. In this paper, a review of different usages of QC in metaheuristics has been presented. This review also shows a classification of the Quantum-inspired metaheuristic algorithms in optimization problems and discusses their applications in science and engineering. This review paper's main aims are to give an overview and review the Quantum-inspired metaheuristic algorithms applications.
引用
收藏
页码:5479 / 5543
页数:65
相关论文
共 50 条
  • [1] Quantum-inspired metaheuristic algorithms: comprehensive survey and classification
    Farhad Soleimanian Gharehchopogh
    [J]. Artificial Intelligence Review, 2023, 56 : 5479 - 5543
  • [2] Scientometric analysis of quantum-inspired metaheuristic algorithms
    Sandeep Kumar Pooja
    [J]. Artificial Intelligence Review, 57
  • [3] Scientometric analysis of quantum-inspired metaheuristic algorithms
    Pooja
    Sood, Sandeep Kumar
    [J]. ARTIFICIAL INTELLIGENCE REVIEW, 2024, 57 (02)
  • [4] A Review of Quantum-Inspired Metaheuristic Algorithms for Automatic Clustering
    Dey, Alokananda
    Bhattacharyya, Siddhartha
    Dey, Sandip
    Konar, Debanjan
    Platos, Jan
    Snasel, Vaclav
    Mrsic, Leo
    Pal, Pankaj
    [J]. MATHEMATICS, 2023, 11 (09)
  • [5] Quantum-inspired evolutionary algorithms: a survey and empirical study
    Gexiang Zhang
    [J]. Journal of Heuristics, 2011, 17 : 303 - 351
  • [6] Quantum-inspired evolutionary algorithms: a survey and empirical study
    Zhang, Gexiang
    [J]. JOURNAL OF HEURISTICS, 2011, 17 (03) : 303 - 351
  • [7] Quantum-inspired genetic algorithms
    Narayanan, A
    Moore, M
    [J]. 1996 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION (ICEC '96), PROCEEDINGS OF, 1996, : 61 - 66
  • [8] Quantum-inspired algorithms in practice
    Arrazola, Juan Miguel
    Delgado, Alain
    Bardhan, Bhaskar Roy
    Lloyd, Seth
    [J]. QUANTUM, 2020, 4
  • [9] Quantum-Inspired Applications for Classification Problems
    Bertini, Cesarino
    Leporini, Roberto
    [J]. ENTROPY, 2023, 25 (03)
  • [10] A Quantum-inspired Version of the Classification Problem
    Sergioli, Giuseppe
    Bosyk, Gustavo Martin
    Santucci, Enrica
    Giuntini, Roberto
    [J]. INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 2017, 56 (12) : 3880 - 3888