Advertisement

A Membrane Algorithm for the Min Storage Problem

  • Alberto Leporati
  • Dario Pagani
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4361)

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.

Keywords

Feasible Solution Polynomial Time Candidate Solution Travelling Salesman Problem Positive Element 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti–Spaccamela, A., Protasi, M.: Complexity and Approximation. Combinatorial Optimization Problems and Their Approximability Properties. Springer, Heidelberg (1999)MATHGoogle Scholar
  2. 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. 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. 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
  5. 5.
    Leporati, A., Zandron, C., Mauri, G.: Conservative Computations in Energy–Based P Systems. In: Mauri, G., Păun, G., Jesús Pérez-Jímenez, M., Rozenberg, G., Salomaa, A. (eds.) WMC 2004. LNCS, vol. 3365, pp. 344–358. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  6. 6.
    Nishida, T.Y.: Membrane algorithms. In: Freund, R., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2005. LNCS, vol. 3850, pp. 55–66. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  7. 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
  8. 8.
    Păun, G.: Computing with Membranes. An Introduction. Bulletin of the EATCS 67, 139–152 (1999)MATHGoogle Scholar
  9. 9.
    Păun, G.: Membrane Computing. An Introduction. Springer, Berlin (2002)MATHGoogle Scholar
  10. 10.
    Păun, G., Rozenberg, G.: A Guide to Membrane Computing. Theoretical Computer Science 287(1), 73–100 (2002)MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    The P systems Web page: http://psystems.disco.unimib.it/

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Alberto Leporati
    • 1
  • Dario Pagani
    • 1
  1. 1.Dipartimento di Informatica, Sistemistica e ComunicazioneUniversità degli Studi di Milano – BicoccaMilanoItaly

Personalised recommendations