Travelling salesman problem in tissue P systems with costs

被引：0
作者：
Bogdan Aman
Gabriel Ciobanu
机构：
[1] Romanian Academy,
[2] Institute of Computer Science,undefined
[3] Alexandru Ioan Cuza University,undefined
来源：
Journal of Membrane Computing | 2021年 / 3卷
关键词：
Membrane computing; Travelling salesman problem; Rewriting engine (Priced-Timed) Maude;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We define tissue P systems with costs assigning execution costs to the synapses that are used to transport the objects between cells. We use the Priced-Timed Maude rewriting engine to provide an implementation of tissue P systems with costs. The implementation allows us to analyze and verify some behavioural aspects of tissue P systems with costs. We illustrate an application of these tissue P systems with costs by providing a solution to the Travelling Salesman Problem.
引用
收藏
页码：97 / 104
页数：7
相关论文
共 54 条
  • [1] Agrigoroaiei O(2009)Rewriting logic specification of membrane systems with promoters and inhibitors Electronic Notes in Theoretical Computer Science 238 5-22
  • [2] Ciobanu G(2009)Turing completeness using three mobile membranes Lecture Notes in Computer Science 5715 42-55
  • [3] Aman B(2009)Simple, enhanced and mutual mobile membranes Lecture Notes in Computer Science 5750 26-44
  • [4] Ciobanu G(2011)Time delays in Membrane systems and Petri nets Electronic Proceeding in Theoretical Computer Science 57 47-60
  • [5] Aman B(2020)Mobile Membranes. IEEE Access 8 147439-147450
  • [6] Ciobanu G(2009)The Priced-Timed Maude tool Lecture Notes in Computer Science 5728 443-448
  • [7] Aman B(2000)Specification and proof in membership equational logic Theoretical Computer Science 236 35-132
  • [8] Ciobanu G(2009)New strategies of using the rules of a P system in a maximal way: power and complexity Romanian Journal of Information Science and Technology 12 157-173
  • [9] Aman B(2002)Maude: specification and programming in rewriting logic Theoretical Computer Science 285 187-243
  • [10] Ciobanu G(2019)The Hamiltonian cycle and travelling salesman problems in cP systems Fundamenta Informaticae 164 157-180
123456