An optimization algorithm inspired by membrane computing

Authors:
Liang Huang;Ning Wang
Affiliations:
National Laboratory of Industrial Control Technology, Institute of Advanced Process Control, Zhejiang University, Hangzhou, P.R. China;National Laboratory of Industrial Control Technology, Institute of Advanced Process Control, Zhejiang University, Hangzhou, P.R. China
Venue:
ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part II
Year:
2006

Citing 3
Cited 6

Computing with membranes

Journal of Computer and System Sciences
An orthogonal genetic algorithm with quantization for globalnumerical optimization

IEEE Transactions on Evolutionary Computation
Intelligent evolutionary algorithms for large parameter optimization problems

IEEE Transactions on Evolutionary Computation

A Quantum-Inspired Evolutionary Algorithm Based on P systems for Knapsack Problem

Fundamenta Informaticae
Membrane computing as a modeling framework: cellular systems case studies

SFM'08 Proceedings of the Formal methods for the design of computer, communication, and software systems 8th international conference on Formal methods for computational systems biology
Dynamic multi-objective optimization based on membrane computing for control of time-varying unstable plants

Information Sciences: an International Journal
An improved membrane algorithm for solving time-frequency atom decomposition

WMC'09 Proceedings of the 10th international conference on Membrane Computing
A Quantum-Inspired Evolutionary Algorithm Based on P systems for Knapsack Problem

Fundamenta Informaticae
A membrane algorithm with quantum-inspired subalgorithms and its application to image processing

Natural Computing: an international journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Inspired by Membrane Computing, this paper presents an optimization algorithm for the problems with large feasible space and large parameters. The algorithm consists of two parts. One is to determine the good area and another is a fast searching tool.The comparisons among some evolutionary algorithms illuminate that the algorithm is simple and computes fast with high precision on optimal problems.