A membrane algorithm for the min storage problem

Authors:
Alberto Leporati;Dario Pagani
Affiliations:
Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano – Bicocca, Milano, Italy;Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano – Bicocca, Milano, Italy
Venue:
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Year:
2006

Citing 8
Cited 7

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Membrane Computing: An Introduction

Membrane Computing: An Introduction
A guide to membrane computing

Theoretical Computer Science - Natural computing
AllelesLociand the Traveling Salesman Problem

Proceedings of the 1st International Conference on Genetic Algorithms
Computing with Membranes

Computing with Membranes
Membrane algorithms

WMC'05 Proceedings of the 6th international conference on Membrane Computing
Conservative computations in energy–based p systems

WMC'04 Proceedings of the 5th international conference on Membrane Computing

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

Fundamenta Informaticae
Distributed evolutionary algorithms inspired by membranes in solving continuous optimization problems

WMC'06 Proceedings of the 7th international conference on Membrane Computing
An improved membrane algorithm for solving time-frequency atom decomposition

WMC'09 Proceedings of the 10th international conference on Membrane Computing
Analyzing radar emitter signals with membrane algorithms

Mathematical and Computer Modelling: An International Journal
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
A hybrid approach based on differential evolution and tissue membrane systems for solving constrained manufacturing parameter optimization problems

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Min Storage is an NP–hard optimization problem that arises in a natural way when one considers computations in which the amount of energy provided with the input values is preserved during the computation. In this paper we propose a polynomial time membrane algorithm that computes approximate solutions to the instances of Min Storage, and we study its behavior on (almost) uniformly randomly chosen instances. Moreover, we compare the (estimated) coefficient of approximation of this algorithm with the ones obtained from several other polynomial time heuristics. The result of this comparison indicates the superiority of the membrane algorithm with respect to many other traditional approximation techniques.