Design of a Metaphor-Less Multi-objective Rao Algorithms Using Non-dominated Sorting and Its Application in I-Beam Design Optimization

  • Conference paper
  • First Online:
Advances in Data-driven Computing and Intelligent Systems

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 653))

  • 300 Accesses

Abstract

Recently, Rao has proposed single-objective metaphor-less set of Rao algorithms to solve wide variety of optimization problems. The beauty of these algorithms lies in its simple implementation with no algorithm specific configuration of any parameters for the effective working of the algorithms. In this paper, we have attempted to extend these set of algorithms to multi-objective optimization using non-dominated sorting and crowding distance mechanisms. Subsequently, the proposed three variants, namely, Non-dominated Sorting Rao1 algorithm (abbreviated as NSRao1), Non-dominated Sorting Rao2 algorithm (abbreviated as NSRao2) and Non-dominated Sorting Rao3 algorithm (abbreviated as NSRao3) are successfully applied to solve multi-objective I-Beam optimization problem under various strength and geometric constraints. The three variants differ in the way the new solutions are formed from the best and worst solutions and their arbitrary interactions with other candidate solutions. NSRao1 technique was able to find better set of solutions towards minimizing the displacement area and where as it didn’t perform well towards the other boundary values compared to few standard evolutionary techniques. However, NSRao2 and NSRao3 are able to yield superior results in finding the optimal set of solutions towards both the boundary values with better diversity compared to other evolutionary algorithms.

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

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /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
USD 29.95
Price excludes VAT (Brazil)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 219.00
Price excludes VAT (Brazil)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 279.99
Price excludes VAT (Brazil)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Kaur J, Chauhan SS, Singh P (2019) An improved TLBO leveraging group and experience learning concepts for global functions. In: Advances in intelligent systems and computing, Springer Series, vol 2, pp 1221–1234. https://www.springer.com/in/book/9789811307607

  2. Kaur J, Chauhan SS, Singh P (2019) NSGLTLBOLE: a modified non-dominated sorting TLBO technique using group learning and learning experience of others for multi-objective test problems. Adv Intell Syst Comput 900:243–251. https://doi.org/10.1007/978-981-13-3600-3_23

  3. Kaur J, Chauhan SS, Singh P (2018) Multi-objective optimization of two-bar truss structure using non-dominated sorting TLBO leveraging group based learning and learning experience of others algorithm (NSGLTLBOLE). Int J Mech Eng Technol (IJMET)9:1016–1023

    Google Scholar 

  4. Rao RV (2020) Rao algorithms: three metaphor-less simple algorithms for solving optimization problems. Int J Ind Eng Comput 11:107–130

    Google Scholar 

  5. Yang X-S, Deb S (2011) Multi-objective cuckoo search for design optimization. Comput Operat Res 1:1–9. https://doi.org/10.1016/j.cor.2011.09.026

  6. Martinez-Iranzo M, Herrero JM, Sanchis J, Blasco X, Garcia-Nieto S (2009) Applied Pareto multi-objective optimization by stochastic solvers. Eng Appl Artif Intell 22:455–465

    Google Scholar 

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

    Article  Google Scholar 

  8. Kukkonen S, Lampinen J (2005) GDE3: the third evolution step of generalized differential evolution. IEEE Congr Evol Comput 1:1–11

    Google Scholar 

  9. Knowles J, Corne D (1999) The Pareto archived evolution strategy: a new baseline algorithm for Pareto multiobjective optimisation. Proc Congr Evol Comput 1:98–105

    Google Scholar 

  10. Nebro AJ, Luna F, Alba E, Dorronsoro B, Durillo JJ, Beham A (2008) AbYSS: adapting scatter search to multiobjective optimization. IEEE Trans Evol Comput 12:439–457

    Article  Google Scholar 

  11. Durillo JJ, Nebro AJ, Alba E (2010) The jmetal framework for multiobjective optimization: design and architecture. Proc IEEE Congr Evol Comput (CEC) 1:1–8

    Google Scholar 

  12. Durillo JJ, Nebro AJ (2011) The jmetal: a java framework for multi-objective optimization. Advances in engineering software. IEEE Trans Evol Comput 10:760–771

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jatinder Kaur .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kaur, J., Singh, P. (2023). Design of a Metaphor-Less Multi-objective Rao Algorithms Using Non-dominated Sorting and Its Application in I-Beam Design Optimization. In: Das, S., Saha, S., Coello Coello, C.A., Bansal, J.C. (eds) Advances in Data-driven Computing and Intelligent Systems. Lecture Notes in Networks and Systems, vol 653. Springer, Singapore. https://doi.org/10.1007/978-981-99-0981-0_63

Download citation

  • DOI: https://doi.org/10.1007/978-981-99-0981-0_63

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-99-0980-3

  • Online ISBN: 978-981-99-0981-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Navigation