Skip to main content
SpringerLink
Log in

Efficiently solving the Bin Packing problem through bio-inspired mobility

  • Original Article
  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

Recently we have considered the possibility of using bio-inspired mobility for solving a weak NP-complete problem (Partition). In this paper we provide a semi-uniform polynomial solution for a strong NP-complete problem (Bin Packing) by means of membrane computing techniques. The solution employs mobile membranes and elementary membrane division.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Notes

  1. A membrane system without membrane division can be simulated by a Turing machine with a polynomial slowdown [12].

References

  1. Aman, B., Ciobanu, G.: Turing completeness using three mobile membranes. Lect. Notes Comput. Sci. 5715, 42–55 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  2. Aman, B., Ciobanu, G.: Simple, enhanced and mutual mobile membranes. Trans. Comput. Syst. Biol. XI, 26–44 (2009)

  3. Aman, B., Ciobanu, G.: Solving a weak NP-complete problem in polynomial time with mutual mobile membrane systems. Acta Inf. 48(7–8), 409–415 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  4. Aman, B., Ciobanu, G.: Mobility in Process Calculi and Natural Computing. Natural Computing Series. Springer, New York (2011)

    Book  MATH  Google Scholar 

  5. Garey, M., Johnson, D.: Computers and Intractability. A Guide to the Theory of NP-Completeness. Freeman, New York (1979)

    MATH  Google Scholar 

  6. Păun, G.H.: Membrane Computing. An Introduction. Springer, New York (2002)

    Book  MATH  Google Scholar 

  7. Păun, G.H., Rozenberg, G., Salomaa, A. (eds.): The Oxford Handbook of Membrane Computing. Oxford University Press, Oxford (2010)

    MATH  Google Scholar 

  8. Pérez-Jiménez, M.J.: An approach to computational complexity in membrane computing. Lect. Notes Comput. Sci. 3365, 85–109 (2005)

    Article  MATH  Google Scholar 

  9. Pérez-Jiménez, M.J., Riscos-Núñez, A., Romero-Jiménez, A., Woods, D.: Complexity-Membrane Division, Membrane Creation. Păun, G.H., Rozenberg, G., Salomaa, A. (eds.): The Oxford Handbook of Membrane Computing, pp 302–336. Oxford University Press, Oxford (2010)

  10. Porreca, A.E., Leporati, A., Mauri, G., Zandron, C.: Elementary active membranes have the power of counting. Int. J. Nat. Comput. Res. 2(3), 329–342 (2011)

    Article  Google Scholar 

  11. Sosk, P.: The computational power of cell division in P systems: beating down parallel computers? Nat. Comput. 2(3), 287–298 (2003)

    Article  MathSciNet  Google Scholar 

  12. Zandron, C., Ferretti, C., Mauri, G.: Solving NP-complete problems using P systems with active membranes. In: Antoniou, I., Calude, C.S., Dinneen M.J. (eds.) Unconventional Models of Computation, pp. 289–301. Springer, New York (2001)

Download references

Acknowledgments

The work was supported by a grant of the Romanian National Authority for Scientific Research, Project Number PN-II-ID-PCE-2011-3-0919.

Author information

Authors and Affiliations

  1. Institute of Computer Science, Romanian Academy, Blvd. Carol I no.8, 700505, Iaşi, Romania

    Bogdan Aman & Gabriel Ciobanu

Authors
  1. Bogdan Aman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gabriel Ciobanu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gabriel Ciobanu.

Additional information

Dedicated to the 150th anniversary of the Romanian Academy.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Aman, B., Ciobanu, G. Efficiently solving the Bin Packing problem through bio-inspired mobility. Acta Informatica 54, 435–445 (2017). https://doi.org/10.1007/s00236-016-0264-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00236-016-0264-3

Keywords

Search

Navigation