Skip to main content

A Jaya Algorithm for Discrete Optimization Problems

  • Conference paper
  • First Online:
Engineering Vibration, Communication and Information Processing

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 478))

Abstract

This study describes the discrete optimization algorithm based on Jaya algorithm. Originally, the Jaya algorithm is developed for continuous optimization problems. In the proposed algorithm, continuous domain of variables is converted into discrete domain applying bound constraint of middle point of corresponding two consecutive discrete values. The effectiveness of proposed algorithm is demonstrated through standard truss examples taken from the literature and optimum values are compared with discrete optimization algorithms. The proposed algorithm is computationally more efficient for the discrete optimization problems as tested by numerical example.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Arora, J.S., Huang, M.W., Hsieh, C.C.: Methods for optimization of nonlinear problems with discrete variables: a review. Struct. Multidiscip. Optim. 8(2), 69–85 (1994)

    Article  Google Scholar 

  2. Arora, J.S.: Methods for discrete variable structural optimization. In: Burns, S.A. (ed.) Recent Advances in Optimal Structural Design. Technical Committee on Optimal Structural Design. ASCE, Reston, VA, pp. 1–35 (2002)

    Google Scholar 

  3. Arora, J.S.: Introduction to Optimum Design, 3rd edn. Reed Elsevier India Private Limited, India (2012)

    Google Scholar 

  4. Rao, R.V., Savsani, V.J.: Mechanical Design Optimization Using Advanced Optimization Techniques. Springer Science & Business Media (2012)

    Google Scholar 

  5. Rajeev, S., Krishnamoorthy, C.S.: Discrete optimization of structures using genetic algorithms. J. Struct. Eng. ASCE 118(5), 1233–1251 (1992)

    Article  Google Scholar 

  6. Kripka, M.: Discrete optimization of trusses by simulated annealing. J. Braz. Soc. Mech. Sci. Eng. XXVI, 170–173 (2004)

    Google Scholar 

  7. Li, L.J., Huang, Z.B., Liu, F.: A heuristic particle swarm optimization method for truss structures with discrete variables. Comput. Struct. 87, 435–444 (2009)

    Article  Google Scholar 

  8. Camp, C.V., Bichon, B.J.: Design of space trusses using ant colony optimization. J. Struct. Eng. ASCE 130, 741–751 (2004)

    Article  Google Scholar 

  9. Sonmez, M.: Discrete optimum design of truss structures using artificial bee colony algorithm. Struct. Multidiscip. Optim. 43(1), 85–97 (2011)

    Article  Google Scholar 

  10. Dede, T.: Application of teaching-learning-based-optimization algorithm for the discrete optimization of truss structures. ksce J. Civ. Eng. 18(6), 1759–1767 (2014)

    Article  Google Scholar 

  11. Rao, R.V.: Jaya: a simple and new optimization algorithm for solving constrained and unconstrained optimization problems 7, 19–34, (2016). https://doi.org/10.5267/j.ijiec.2015.8.004

  12. Rao, R.V., Waghmare, G.G.: A new optimization algorithm for solving complex constrained design optimization problems 273, (2016). https://doi.org/10.1080/0305215x.2016.1164855

    Article  Google Scholar 

  13. Singh, R., Chaudhary, H., Singh, A.K.: Defect-free optimal synthesis of crank-rocker linkage using nature-inspired optimization algorithms 116, 105–122 (2017). https://doi.org/10.1016/j.mechmachtheory.2017.05.018

    Article  Google Scholar 

  14. Singh, R., Chaudhary, H., Singh, A.K.: A new hybrid teaching–learning particle swarm optimization algorithm for synthesis of linkages to generate path. Sādhanā 42(11), 1851–1870 (2017)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Prem Singh .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Singh, P., Chaudhary, H. (2019). A Jaya Algorithm for Discrete Optimization Problems. In: Ray, K., Sharan, S., Rawat, S., Jain, S., Srivastava, S., Bandyopadhyay, A. (eds) Engineering Vibration, Communication and Information Processing. Lecture Notes in Electrical Engineering, vol 478. Springer, Singapore. https://doi.org/10.1007/978-981-13-1642-5_18

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-1642-5_18

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-1641-8

  • Online ISBN: 978-981-13-1642-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics