QEAM: An Approximate Algorithm Using P Systems with Active Membranes

被引:10
|
作者
Zhang, G. [1 ]
Chen, J. [1 ]
Gheorghe, M. [2 ]
Ipate, F. [3 ]
Wang, X. [4 ]
机构
[1] Southwest Jiaotong Univ, Sch Elect Engn, Chengdu 610031, Peoples R China
[2] Univ Bradford, Fac Engn & Informat, Bradford BD7 1DP, W Yorkshire, England
[3] Univ Bucharest, Fac Math & Comp Sci, Bucharest, Romania
[4] Southwest Univ Sci & Technol, Sch Informat Engn, MianYang 621010, Peoples R China
基金
中国国家自然科学基金;
关键词
Membrane computing; active membranes; approximate optimization approach; quantum-inspired evolutionary algorithm; satisfiability problem; INSPIRED EVOLUTIONARY ALGORITHM; DIFFERENTIAL EVOLUTION; OPTIMIZATION;
D O I
10.15837/ijccc.2015.2.1757
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper proposes an approximate optimization approach, called QEAM, which combines a P system with active membranes and a quantum-inspired evolutionary algorithm. QEAM uses the hierarchical arrangement of the compartments and developmental rules of a P system with active membranes, and the objects consisting of quantum-inspired bit individuals, a probabilistic observation and the evolutionary rules designed with quantum-inspired gates to specify the membrane algorithms. A large number of experiments carried out on benchmark instances of satisfiability problem show that QEAM outperforms QEPS (quantum-inspired evolutionary algorithm based on P systems) and its counterpart quantum-inspired evolutionary algorithm.
引用
收藏
页码:263 / 279
页数:17
相关论文
共 50 条
  • [41] ROCK clustering algorithm based on the P system with active membranes
    Zhao, Yuzhen
    Liu, Xiyu
    Wang, Wenping
    WSEAS Transactions on Computers, 2014, 13 : 289 - 299
  • [42] Time-free solution to SAT problem using P systems with active membranes
    Song, Tao
    Macias-Ramos, Luis F.
    Pan, Linqiang
    Perez-Jimenez, Mario J.
    THEORETICAL COMPUTER SCIENCE, 2014, 529 : 61 - 68
  • [43] Distributed computation of a k P systems with active membranes for SAT using clause completion
    Buno, Kelvin
    Adorna, Henry
    JOURNAL OF MEMBRANE COMPUTING, 2020, 2 (02) : 108 - 120
  • [44] A linear-time solution to the knapsack problem using P systems with active membranes
    Pérez-Jiménez, MJ
    Riscos-Núñez, A
    MEMBRANE COMPUTING, 2004, 2933 : 250 - 268
  • [45] Distributed computation of a k P systems with active membranes for SAT using clause completion
    Kelvin Buño
    Henry Adorna
    Journal of Membrane Computing, 2020, 2 : 108 - 120
  • [46] On the power of membrane dissolution in polarizationless P systems with active membranes
    Gazdag, Zsolt
    Hajagos, Karoly
    NATURAL COMPUTING, 2023, 22 (01) : 95 - 104
  • [47] P Systems with Elementary Active Membranes: Beyond NP and coNP
    Porreca, Antonio E.
    Leporati, Alberto
    Mauri, Giancarlo
    Zandron, Claudio
    MEMBRANE COMPUTING, 2010, 6501 : 338 - 347
  • [48] Computational efficiency and universality of timed P systems with active membranes
    Song, Bosheng
    Pan, Linqiang
    THEORETICAL COMPUTER SCIENCE, 2015, 567 : 74 - 86
  • [49] On the power of membrane dissolution in polarizationless P systems with active membranes
    Zsolt Gazdag
    Károly Hajagos
    Natural Computing, 2023, 22 : 95 - 104
  • [50] On the power of P systems with active membranes using weak non-elementary membrane division
    Zsolt Gazdag
    Károly Hajagos
    Szabolcs Iván
    Journal of Membrane Computing, 2021, 3 : 258 - 269