A Novel Osmosis-Inspired Algorithm for Multiobjective Optimization | SpringerLink
Skip to main content

A Novel Osmosis-Inspired Algorithm for Multiobjective Optimization

  • Conference paper
  • First Online:
Neural Information Processing (ICONIP 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10637))

Included in the following conference series:

Abstract

Many real-life difficult problems imply more than one optimization criterion and often require multiobjective optimization techniques. Among these techniques, nature-inspired algorithms, for instance, evolutionary algorithms, mimic various natural process and systems and succeed to perform appropriately for hard optimization problems. Besides, in chemistry, osmosis is the natural process of balancing the concentration of two solutions. This process takes place at the molecular level. Osmosis’s practical applications are multiple and target medicine, food safety, and engineering. However, osmosis process is not yet recognized as a rich source of inspiration for designing computational tools. At first glance, this well-known chemical process seems appropriate as a metaphor in nature-inspired computation as it can underlie the development of a search and optimization procedure. In this paper, we develop a novel algorithm called OSMIA (Osmosis inspired Algorithm) for multiobjective optimization problems. The proposed algorithm is inspired by the well-known physio-chemical osmosis process. For validation purposes, we have realized a case study in that we compared our proposed algorithm with the state-of-art algorithm NSGAII using some well known test problems. The conclusions of the case study emphasize the strengths of the proposed novel OSMIA algorithm.

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

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 11439
Price includes VAT (Japan)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 14299
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing, vol. 53. Springer, Heidelberg (2003)

    Book  MATH  Google Scholar 

  2. Rojas, R.: Neural Networks: a Systematic Introduction. Springer-Verlag New York, Inc., New York (1996)

    Book  MATH  Google Scholar 

  3. Wolfram, S.: Universality and complexity in cellular automata. Phys. D: Nonlinear Phenom. 10(1), 1–35 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  4. Karaboga, D., Celal, O.: A novel clustering approach: artificial bee colony (ABC) algorithm. Appl. Soft Comput. 11(1), 652–657 (2011)

    Article  Google Scholar 

  5. Dorigo, M., Birattari, M., Blum, C., Clerc, M., Stützle, T., Winfield, A.F.T. (eds.): ANTS 2008. LNCS, vol. 5217. Springer, Heidelberg (2008). doi:10.1007/978-3-540-87527-7

    MATH  Google Scholar 

  6. Karaboga, D.: An idea based on honey bee swarm for numerical optimization, vol. 200, Technical report-tr06, Computer Engineering Department, Erciyes University (2005)

    Google Scholar 

  7. De Castro, L.N., Timmis, J.: Artificial immune systems: a new computational intelligence approach. Springer Science & Business Media (2002)

    Google Scholar 

  8. Păun, G.: Computing with membranes. J. Comput. Syst. Sci. 61(1), 108–143 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  9. Ritter, J.: An efficient bounding sphere. In: Glassner, A. (ed.) Graphics Gems. Academic Press, Boston, MA (1990)

    Google Scholar 

  10. Zitzler, E., Deb, K., Thiele, L.: Comparison of multiobjective evolutionary algorithms: empirical results. Evol. Comput. 8(2), 173–195 (2000)

    Article  Google Scholar 

  11. Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182–197 (2002)

    Article  Google Scholar 

  12. Moslemi, S., Zavvar Sabegh, M.H., Mirzazadeh, A., Ozturkoglu, Y., Maass, E.: Int J Syst Assur Eng Manage (2017). doi:10.1007/s13198-017-0650-4

    Google Scholar 

  13. González-Álvarez, D.L., Vega-Rodríguez, M.A., Rubio-Largo, Á.: A hybrid MPI/OpenMP parallel implementation of NSGA-II for finding patterns in protein sequences. Supercomput. 73(6), 2285–2312 (2017). doi:10.1007/s11227-016-1916-3

    Article  Google Scholar 

  14. Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., da Fonseca, V.G.: Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans. Evol. Comput. 7(2), 117–132 (2003)

    Article  Google Scholar 

Download references

Acknowledgements

The authors gratefully acknowledge the financial support provided by the Romanian National Authority for Scientific Research, CNCS – UEFISCDI, under the Bridge Grant PN-III-P2-2.1-BG-2016-0302.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Corina Rotar .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Rotar, C., Iantovics, L.B., Arik, S. (2017). A Novel Osmosis-Inspired Algorithm for Multiobjective Optimization. In: Liu, D., Xie, S., Li, Y., Zhao, D., El-Alfy, ES. (eds) Neural Information Processing. ICONIP 2017. Lecture Notes in Computer Science(), vol 10637. Springer, Cham. https://doi.org/10.1007/978-3-319-70093-9_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-70093-9_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-70092-2

  • Online ISBN: 978-3-319-70093-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics