The Travelling Salesman Problem in cP Systems

ResearchSpace/Manakin Repository

Show simple item record

dc.contributor.author Cooper, J en
dc.contributor.author Nicolescu, R en
dc.date.accessioned 2018-07-18T04:42:52Z en
dc.date.available 2018-07-18T04:42:52Z en
dc.date.issued 2017 en
dc.identifier.citation CDMTCS Research Reports CDMTCS-510 (2017) en
dc.identifier.issn 1178-3540 en
dc.identifier.uri http://hdl.handle.net/2292/37497 en
dc.description.abstract The Travelling Salesman Problem (TSP) is a long-standing and well-known NP-hard problem, concerned with computing the lowest cost Hamiltonian cycle on a weighted graph. Many solutions to the problem exist, including some from the perspective of P Systems, almost all of which have combined membrane computing with other approaches for approximate solution algorithms. A recent paper presented a brute-force style P Systems solution to the TSP, exploiting the ability of P Systems to reduce time complexity in exchange for space complexity, but the resultant system had a relatively high number of rules. en
dc.publisher Department of Computer Science, The University of Auckland, New Zealand en
dc.relation.ispartofseries CDMTCS Research Report Series en
dc.rights Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. en
dc.rights.uri https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm en
dc.source.uri https://www.cs.auckland.ac.nz/research/groups/CDMTCS/researchreports/index.php en
dc.title The Travelling Salesman Problem in cP Systems en
dc.type Technical Report en
dc.subject.marsden Fields of Research en
dc.rights.holder The author(s) en


Full text options

This item appears in the following Collection(s)

Show simple item record

Share

Search ResearchSpace


Advanced Search

Browse