Accelerated execution of P systems with active membranes to solve the N-queens problem

被引:8
|
作者
Maroosi, Ali [1 ]
Muniyandi, Ravie Chandren [1 ]
机构
[1] Natl Univ Malaysia, Res Ctr Software Technol & Management, Fac Technol & Informat Sci, Bangi 43600, Selangor, Malaysia
关键词
Active membrane systems; Membrane computing; Local search; Multi-core processing; N-queens problem; 3-COL; CELL;
D O I
10.1016/j.tcs.2014.05.004
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The N-queens problem has attracted increasing attention because of its potential applications in different areas, such as parallel memory storage approaches, image processing, and physical and chemical studies. Local search is a powerful method for solving real problems, such as the N-queens problem. Recently, models of P systems with active membranes have been used for local search to solve the N-queens problem. However, there have been insufficient studies of the parallelism of the P-system models with active membranes. In addition, the active membrane systems defined for N queens have several individual membranes that contain one object and no internal rules in each membrane, as well as several communication rules among membranes, which reduce the execution speed. In this study, a new P system model with active membranes is defined for solving the N-queens problem, and multi-core simulation of the proposed membrane system allows the execution of alternative computations in parallel, thus reducing the average time for finding a successful computation. The speed of the proposed model was compared with previous models that used P systems with active membranes for local search. The model contains two membranes, but the inclusion of several objects and rules within each membrane increases the parallelism and performance. This model reduces the number of communication rules required among membranes, and increases the execution speed. This model also increases the parallelism of previous P systems with active membranes when several rules evolve concurrently and more than one queen is exchanged during each step to reach a solution. Multi-core processing has been used to decrease the probability of restarting the P systems and to decrease processing time by distributing the processing of the active membrane on the multi-core. The speed of the proposed model when solving N = 200 queens was almost 1000 times faster than previous methods. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码:39 / 54
页数:16
相关论文
共 50 条
  • [31] Development of neurofuzzy architecture for solving the N-Queens problem
    Da Silva, IN
    Ulson, JA
    De Souza, AN
    INTERNATIONAL JOURNAL OF GENERAL SYSTEMS, 2005, 34 (06) : 717 - 734
  • [32] A DYNAMIC-PROGRAMMING SOLUTION TO THE N-QUEENS PROBLEM
    RIVIN, I
    ZABIH, R
    INFORMATION PROCESSING LETTERS, 1992, 41 (05) : 253 - 256
  • [33] A novel assembly evolutionary algorithm for n-queens problem
    Zeng, Congwen
    Gu, Tianlong
    CIS WORKSHOPS 2007: INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY WORKSHOPS, 2007, : 171 - 174
  • [34] Application of Hopfield Neural Network to the N-Queens Problem
    Lapushkin, Andrei A.
    BIOLOGICALLY INSPIRED COGNITIVE ARCHITECTURES (BICA) FOR YOUNG SCIENTISTS, 2016, 449 : 115 - 120
  • [35] AN ANALYTICAL EVIDENCE FOR KALE HEURISTIC FOR THE N-QUEENS PROBLEM
    OH, SB
    INFORMATION PROCESSING LETTERS, 1993, 46 (01) : 51 - 54
  • [36] MODELING THE N-QUEENS PROBLEM USING MATHEMATICAL SOFTWARE
    Alberdi Celaya, Elisabete
    Munoz Matute, Judit
    9TH INTERNATIONAL CONFERENCE ON EDUCATION AND NEW LEARNING TECHNOLOGIES (EDULEARN17), 2017, : 1321 - 1330
  • [37] Enhancing the Simulation of Membrane System on the GPU for the N-Queens Problem
    Muniyandi, Ravie Chandren
    Maroosi, All
    CHINESE JOURNAL OF ELECTRONICS, 2015, 24 (04) : 740 - 743
  • [38] Landscape analysis and efficient metaheuristics for solving the n-queens problem
    Masehian, Ellips
    Akbaripour, Hossein
    Mohabbati-Kalejahi, Nasrin
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2013, 56 (03) : 735 - 764
  • [39] A Linear Time Pattern Based Algorithm for N-Queens Problem
    Karabulut, Bergen
    Erguzen, Atilla
    Unver, Halil Murat
    JOURNAL OF POLYTECHNIC-POLITEKNIK DERGISI, 2022, 25 (02): : 615 - 622
  • [40] Landscape analysis and efficient metaheuristics for solving the n-queens problem
    Ellips Masehian
    Hossein Akbaripour
    Nasrin Mohabbati-Kalejahi
    Computational Optimization and Applications, 2013, 56 : 735 - 764