Research on single cell membrane algorithm and engineering application based on membrane computing theory

Abstract

Abstract Membrane computing is a new computing paradigm with great significance in the field of computer science. The Multi-membrane search algorithm (MSA) is proposed based on the membrane computational population optimization theory. It showed excellent performance in the test. This paper further studies the performance characteristics of a single individual (Single Cell Membrane Algorithm, SCA) of MSA. SCA can generate adaptive solution sets for problems of different dimensions. Through transcription and reprocessing rules, new weakly correlated feasible solutions are formed for global search and local exploration. This paper is based on the unimodal Sphere function and the multimodal Rastrigr function, at dim=3, 5, 10, 20, 30, 40, 50, 60, 70, 80, 90, 100, 300, 500, 1000 and Q=1.00, 0.75, 0.50, 0.40, 0.30, 0.20, 0.10, 0.005, 0.025, 0.010, the SCA was optimized for 1000 iterations. Analyze the impact of the key parameter Q of SCA on the search performance of the algorithm in problems of different dimensions. The results show that under the set conditions, SCA has better performance when Q is 0.010 and 0.025 in the unimodal function test. In the multimodal function test, SCA has better performance when dim≤100 and Q≤0.200, and when dim>100 and Q≥0.200. In addition, this paper employs one engineering problem: I-beams to perform engineering tests on SCA and obtain results superior to other algorithms participating in the comparison. The test and comparison results show that SCA can also be used as a derivative algorithm of MSA, and has good performance.