The STUDIA UNIVERSITATIS BABEŞ-BOLYAI issue article summary

The summary of the selected article appears at the bottom of the page. In order to get back to the contents of the issue this article belongs to you have to access the link from the title. In order to see all the articles of the archive which have as author/co-author one of the authors mentioned below, you have to access the link from the author's name.

In this paper a membrane-immune algorithm is proposed, which is inspired from the structure of living cells and the vertebrate immune system. The algorithm is used to solve one of the most famous combinatorial NP-complete problems, namely the Multiple Zero/One Knapsack Problem. Various heuristics, like genetic algorithms, have been devised to solve this class of combinatorial problems. The proposed algorithm is compared with two genetic based algorithms and overcame both of them.The algorithm is evaluated on nine benchmarks test problems and surpassed both of the genetic based algorithms in six problems, equaled with one of them in two problems and lost in one problem, which indicates that our algorithm surpasses in general genetic algorithms. We claim that the proposed algorithm is very useful in solving similar combinatorial NP-complete problems.

Key words and phrases. membrane computing, P systems, arti