dc.creator | Ye, Lian | es |
dc.creator | Zheng, Jinhang | es |
dc.creator | Guo, Ping | es |
dc.creator | Pérez Jiménez, Mario de Jesús | es |
dc.date.accessioned | 2021-07-22T07:56:07Z | |
dc.date.available | 2021-07-22T07:56:07Z | |
dc.date.issued | 2019 | |
dc.identifier.citation | Ye, L., Zheng, J., Guo, P. y Pérez Jiménez, M.d.J. (2019). Solving the 0-1 Knapsack Problem by Using Tissue P System With Cell Division. IEEE Access, 7 (May 2019), 66055-66067. | |
dc.identifier.issn | 2169-3536 | es |
dc.identifier.uri | https://hdl.handle.net/11441/116340 | |
dc.description.abstract | Membrane computing is a kind of distributed and parallel computing model inspired by a biological cell mechanism. The maximum parallelism of membrane computing improves the computational efficiency of its computational model. In this paper, a tissue P system named Π KP is proposed to solve the 0-1 knapsack problem, which is one of the classic NP-hard problems. Π KP could obtain the accurate solutions of knapsack problem and points out the number of accurate solutions, which mainly consists of three stages: first, generate all the solutions of knapsack problem by a cell division; then calculate the weights and total values in all the candidate membranes, which will be kept or dissolved according to the restriction of knapsack problem; and check out the final solutions. The instances are executed on a membrane simulator named UPSimulator, and the result of the experiments shows the whole searching procedure by the rules and proves the correctness and efficiency of the system. | es |
dc.description.sponsorship | Fundamental Research Funds for the Central Universities (China) 2019CDXYJSJ0021 | es |
dc.format | application/pdf | es |
dc.format.extent | 13 | es |
dc.language.iso | eng | es |
dc.publisher | IEEE Computer Society | es |
dc.relation.ispartof | IEEE Access, 7 (May 2019), 66055-66067. | |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.subject | Tissue P Systems | es |
dc.subject | 0-1 knapsack problem | es |
dc.subject | Membrane Computing | es |
dc.subject | Combinatorial optimization | es |
dc.title | Solving the 0-1 Knapsack Problem by Using Tissue P System With Cell Division | es |
dc.type | info:eu-repo/semantics/article | es |
dcterms.identifier | https://ror.org/03yxnpp24 | |
dc.type.version | info:eu-repo/semantics/submittedVersion | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | es |
dc.contributor.affiliation | Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial | es |
dc.relation.projectID | 2019CDXYJSJ0021 | es |
dc.relation.publisherversion | https://ieeexplore.ieee.org/document/8718669 | es |
dc.identifier.doi | 10.1109/ACCESS.2019.2917889 | es |
dc.contributor.group | Universidad de Sevilla. TIC193: Computación Natural | es |
dc.journaltitle | IEEE Access | es |
dc.publication.volumen | 7 | es |
dc.publication.issue | May 2019 | es |
dc.publication.initialPage | 66055 | es |
dc.publication.endPage | 66067 | es |
dc.contributor.funder | Fundamental Research Funds for the Central Universities (China) | es |