科研之友
微信
新浪微博
Facebook
分享链接
摘要
The quadratic assignment problem (QAP) is one of the fundamental combinatorial optimization problems, which models many real-life problems. However, it is considered as one of the most difficult NP-hard problems, which means that no polynomial-time algorithm is known to solve this intractable problem effectively. Even small instances of QAP may require vast computation time. In this work, a uniform cellular solution to QAP is proposed in the framework of membrane computing by using a family of recognizer tissue P systems with cell division. In the design of the solution, we encode the given instances in binary notations. The paper can be considered as a contribution to the study of considering a binary encoding of the information in P systems.
- 出版日期2012-11
