Quantum-Inspired Genetic Algorithm Based on Simulated Annealing for Combinatorial Optimization Problem

被引:10
|
作者
Shu, Wanneng [1 ]
机构
[1] S Cent Univ Nationalities, Coll Comp Sci, Wuhan 430074, Peoples R China
关键词
Quantum computing; Knapsack problem;
D O I
10.1080/15501320802554992
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Quantum-inspired genetic algorithm (QGA) is applied to simulated annealing (SA) to develop a class of quantum-inspired simulated annealing genetic algorithm (QSAGA) for combinatorial optimization. With the condition of preserving QGA advantages, QSAGA takes advantage of the SA algorithm so as to avoid premature convergence. To demonstrate its effectiveness and applicability, experiments are carried out on the knapsack problem. The results show that QSAGA performs well, without premature convergence as compared to QGA.
引用
收藏
页码:64 / 65
页数:2
相关论文
共 50 条
  • [1] Parallel quantum-inspired genetic algorithm for combinatorial optimization problem
    Han, KH
    Park, KH
    Lee, CH
    Kim, JH
    [J]. PROCEEDINGS OF THE 2001 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2, 2001, : 1422 - 1429
  • [2] GPU-based tuning of quantum-inspired genetic algorithm for a combinatorial optimization problem
    Nowotniak, R.
    Kucharski, J.
    [J]. BULLETIN OF THE POLISH ACADEMY OF SCIENCES-TECHNICAL SCIENCES, 2012, 60 (02) : 323 - 330
  • [3] Analysis of a quantum-inspired simulated annealing genetic algorithm on the 0-1 knapsack problem
    Shu, Wanneng
    [J]. INTERNATIONAL SYMPOSIUM ON ADVANCES IN COMPUTER AND SENSOR NETWORKS AND SYSTEMS, PROCEEDINGS: IN CELEBRATION OF 60TH BIRTHDAY OF PROF. S. SITHARAMA IYENGAR FOR HIS CONTRIBUTIONS TO THE SCIENCE OF COMPUTING, 2008, : 318 - 323
  • [4] Applying genetic algorithm and simulated annealing to a combinatorial optimization problem
    Chakraborty, M
    Chakraborty, UK
    [J]. ICICS - PROCEEDINGS OF 1997 INTERNATIONAL CONFERENCE ON INFORMATION, COMMUNICATIONS AND SIGNAL PROCESSING, VOLS 1-3: THEME: TRENDS IN INFORMATION SYSTEMS ENGINEERING AND WIRELESS MULTIMEDIA COMMUNICATIONS, 1997, : 929 - 933
  • [5] Quantum-inspired evolutionary algorithm for a class of combinatorial optimization
    Han, KH
    Kim, JH
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (06) : 580 - 593
  • [6] Efficient combinatorial optimization by quantum-inspired parallel annealing in analogue memristor crossbar
    Mingrui Jiang
    Keyi Shan
    Chengping He
    Can Li
    [J]. Nature Communications, 14
  • [7] Efficient combinatorial optimization by quantum-inspired parallel annealing in analogue memristor crossbar
    Jiang, Mingrui
    Shan, Keyi
    He, Chengping
    Li, Can
    [J]. NATURE COMMUNICATIONS, 2023, 14 (01)
  • [8] A quantum-inspired Tabu search algorithm for solving combinatorial optimization problems
    Chiang, Hua-Pei
    Chou, Yao-Hsin
    Chiu, Chia-Hui
    Kuo, Shu-Yu
    Huang, Yueh-Min
    [J]. SOFT COMPUTING, 2014, 18 (09) : 1771 - 1781
  • [9] A Quantum-Inspired Tensor Network Algorithm for Constrained Combinatorial Optimization Problems
    Hao, Tianyi
    Huang, Xuxin
    Jia, Chunjing
    Peng, Cheng
    [J]. FRONTIERS IN PHYSICS, 2022, 10
  • [10] A quantum-inspired Tabu search algorithm for solving combinatorial optimization problems
    Hua-Pei Chiang
    Yao-Hsin Chou
    Chia-Hui Chiu
    Shu-Yu Kuo
    Yueh-Min Huang
    [J]. Soft Computing, 2014, 18 : 1771 - 1781