A Membrane Algorithm for the Min Storage Problem
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.
KeywordsFeasible Solution Polynomial Time Candidate Solution Travelling Salesman Problem Positive Element
Unable to display preview. Download preview PDF.
- 2.Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory on NP–Completeness. W.H. Freeman and Company, New York (1979)Google Scholar
- 3.Gens, G.V., Levner, E.V.: Computational complexity of approximation algorithms for combinatorial problems. In: Becvar, J. (ed.) MFCS 1979. LNCS, vol. 74, pp. 292–300. Springer, Heidelberg (1979)Google Scholar
- 4.Goldberg, D.E., Lingle, R.: Alleles, Loci and the Traveling Salesman Problem. In: Proceedings of the International Conference on Genetic Algorithms, pp. 154–159 (1985)Google Scholar
- 7.Păun, G.: Computing with membranes. Journal of Computer and System Sciences 1(61), 108–143 (2000); See also Turku Centre for Computer Science — TUCS Report No. 208 (1998)Google Scholar
- 11.The P systems Web page: http://psystems.disco.unimib.it/