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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
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)
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)
Arora, J.S.: Introduction to Optimum Design, 3rd edn. Reed Elsevier India Private Limited, India (2012)
Rao, R.V., Savsani, V.J.: Mechanical Design Optimization Using Advanced Optimization Techniques. Springer Science & Business Media (2012)
Rajeev, S., Krishnamoorthy, C.S.: Discrete optimization of structures using genetic algorithms. J. Struct. Eng. ASCE 118(5), 1233–1251 (1992)
Kripka, M.: Discrete optimization of trusses by simulated annealing. J. Braz. Soc. Mech. Sci. Eng. XXVI, 170–173 (2004)
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)
Camp, C.V., Bichon, B.J.: Design of space trusses using ant colony optimization. J. Struct. Eng. ASCE 130, 741–751 (2004)
Sonmez, M.: Discrete optimum design of truss structures using artificial bee colony algorithm. Struct. Multidiscip. Optim. 43(1), 85–97 (2011)
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)
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
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
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
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)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this paper
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)