An optimization spiking neural p system for approximately solving combinatorial optimization problems

Membrane systems (also called P systems) refer to the computing models abstracted from the structure and the functioning of the living cell as well as from the cooperation of cells in tissues, organs, and other populations of cells. Spiking neural P systems (SNPS) are a class of distributed and para...

Full description

Saved in:
Bibliographic Details
Published in:International journal of neural systems Vol. 24; no. 5; p. 1440006
Main Authors: Zhang, Gexiang, Rong, Haina, Neri, Ferrante, Pérez-Jiménez, Mario J
Format: Journal Article
Language:English
Published: Singapore 01.08.2014
Subjects:
Action Potentials - physiology
Animals
Computer Simulation
Humans
Models, Neurological
Neurons - physiology
ISSN:0129-0657, 1793-6462, 1793-6462
Online Access:Get more information
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Membrane systems (also called P systems) refer to the computing models abstracted from the structure and the functioning of the living cell as well as from the cooperation of cells in tissues, organs, and other populations of cells. Spiking neural P systems (SNPS) are a class of distributed and parallel computing models that incorporate the idea of spiking neurons into P systems. To attain the solution of optimization problems, P systems are used to properly organize evolutionary operators of heuristic approaches, which are named as membrane-inspired evolutionary algorithms (MIEAs). This paper proposes a novel way to design a P system for directly obtaining the approximate solutions of combinatorial optimization problems without the aid of evolutionary operators like in the case of MIEAs. To this aim, an extended spiking neural P system (ESNPS) has been proposed by introducing the probabilistic selection of evolution rules and multi-neurons output and a family of ESNPS, called optimization spiking neural P system (OSNPS), are further designed through introducing a guider to adaptively adjust rule probabilities to approximately solve combinatorial optimization problems. Extensive experiments on knapsack problems have been reported to experimentally prove the viability and effectiveness of the proposed neural system.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0129-0657
1793-6462
1793-6462
DOI:10.1142/S0129065714400061