{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T12:28:56Z","timestamp":1772713736826,"version":"3.50.1"},"reference-count":47,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2018,10,23]],"date-time":"2018-10-23T00:00:00Z","timestamp":1540252800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,12,18]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Mixed-variable optimization problems consist of the continuous, integer, and discrete variables generally used in various engineering optimization problems. These variables increase the computational cost and complexity of optimization problems due to the handling of variables. Moreover, there are few optimization algorithms that give a globally optimal solution for non-differential and non-convex objective functions. Initially, the Jaya algorithm has been developed for continuous variable optimization problems. In this paper, the Jaya algorithm is further extended for solving mixed-variable optimization problems. In the proposed algorithm, continuous variables remain in the continuous domain while continuous domains of discrete and integer variables are converted into discrete and integer domains applying bound constraint of the middle point of corresponding two consecutive values of discrete and integer variables. The effectiveness of the proposed algorithm is evaluated through examples of mixed-variable optimization problems taken from previous research works, and optimum solutions are validated with other mixed-variable optimization algorithms. The proposed algorithm is also applied to two-plane balancing of the unbalanced rigid threshing rotor, using the number of balance masses on plane 1 and plane 2. It is found that the proposed algorithm is computationally more efficient and easier to use than other mixed optimization techniques.<\/jats:p>","DOI":"10.1515\/jisys-2018-0273","type":"journal-article","created":{"date-parts":[[2018,10,23]],"date-time":"2018-10-23T05:03:50Z","timestamp":1540271030000},"page":"1007-1027","source":"Crossref","is-referenced-by-count":10,"title":["A Modified Jaya Algorithm for Mixed-Variable Optimization Problems"],"prefix":"10.1515","volume":"29","author":[{"given":"Prem","family":"Singh","sequence":"first","affiliation":[{"name":"Mechanical Engineering Department , Malaviya National Institute of Technology , Jaipur, Rajasthan , India"}]},{"given":"Himanshu","family":"Chaudhary","sequence":"additional","affiliation":[{"name":"Mechanical Engineering Department , Malaviya National Institute of Technology , Jaipur, Rajasthan , India"}]}],"member":"374","published-online":{"date-parts":[[2018,10,23]]},"reference":[{"key":"2025120523362756431_j_jisys-2018-0273_ref_001","doi-asserted-by":"crossref","unstructured":"J. S. Arora, Methods for discrete variable structural optimization, Adv. Technol. Struct. Eng. (2000), 1\u20138. DOI: 10.1061\/40492(2000)23.","DOI":"10.1061\/40492(2000)23"},{"key":"2025120523362756431_j_jisys-2018-0273_ref_002","doi-asserted-by":"crossref","unstructured":"J. Arora, Introduction to Optimum Design, 3rd ed., Elsevier, Amsterdam, 2004.","DOI":"10.1016\/B978-012064155-0\/50012-4"},{"key":"2025120523362756431_j_jisys-2018-0273_ref_003","doi-asserted-by":"crossref","unstructured":"J. S. Arora, M. W. Huang and C. C. Hsieh, Methods for optimization of nonlinear problems with discrete variables: a review, Struct. Optim. 8 (1994), 69\u201385.","DOI":"10.1007\/BF01743302"},{"key":"2025120523362756431_j_jisys-2018-0273_ref_004","unstructured":"R. Beck, J. N. Katz, A. D. Martin and K. M. Quinn, A review of discrete optimization algorithms, Polit. Methodol. 7 (1995), 6\u201310."},{"key":"2025120523362756431_j_jisys-2018-0273_ref_005","doi-asserted-by":"crossref","unstructured":"B. Borchers and J. E. Mitchell, An improved branch and bound algorithm for mixed integer nonlinear programs, Comput. Oper. Res. 21 (1994), 359\u2013367.","DOI":"10.1016\/0305-0548(94)90024-8"},{"key":"2025120523362756431_j_jisys-2018-0273_ref_006","doi-asserted-by":"crossref","unstructured":"C. V. Camp and B. J. Bichon, Design of space trusses using ant colony optimization, J. Struct. Eng. 130 (2004), 741\u2013751.","DOI":"10.1061\/(ASCE)0733-9445(2004)130:5(741)"},{"key":"2025120523362756431_j_jisys-2018-0273_ref_007","doi-asserted-by":"crossref","unstructured":"Y. J. Cao, An evolutionary programming approach to mixed-variable optimization problems, Appl. Math. Model. 24 (2000), 931\u2013942.","DOI":"10.1016\/S0307-904X(00)00026-3"},{"key":"2025120523362756431_j_jisys-2018-0273_ref_008","doi-asserted-by":"crossref","unstructured":"S. K. Chaudhary and H. Saha, Dynamics and Balancing of Multibody Systems, Springer Verlag, Germany, 2009.","DOI":"10.1007\/978-3-540-78179-0"},{"key":"2025120523362756431_j_jisys-2018-0273_ref_009","doi-asserted-by":"crossref","unstructured":"K. Chaudhary and H. Chaudhary, Optimal dynamic design of planar mechanisms using teaching \u2013 learning-based optimization algorithm, Mech. Eng. Sci. 230 (2016), 3442\u20133456.","DOI":"10.1177\/0954406215612831"},{"key":"2025120523362756431_j_jisys-2018-0273_ref_010","unstructured":"C. A. Coello Coello and E. M. Montes, Use of dominance-based tournament selection to handle constraints in genetic algorithms, Intell. Eng. Syst. Through Artif. Neural Netw. 11 (2001), 177\u2013182."},{"key":"2025120523362756431_j_jisys-2018-0273_ref_011","doi-asserted-by":"crossref","unstructured":"K. Deb, GeneAS: a robust optimal design technique for mechanical component design, in: Evolutionary Algorithms in Engineering Applications, pp. 497\u2013514, Springer, Berlin, 1997.","DOI":"10.1007\/978-3-662-03423-1_27"},{"key":"2025120523362756431_j_jisys-2018-0273_ref_012","doi-asserted-by":"crossref","unstructured":"T. Dede, Application of teaching-learning-based-optimization algorithm for the discrete optimization of truss structures, KSCE J. Civ. Eng. 18 (2014), 1759\u20131767.","DOI":"10.1007\/s12205-014-0553-8"},{"key":"2025120523362756431_j_jisys-2018-0273_ref_013","doi-asserted-by":"crossref","unstructured":"S. O. Degertekin, L. Lamberti and I. B. Ugur, Sizing, layout and topology design optimization of truss structures using the Jaya algorithm, Appl. Soft Comput. J. 70 (2017), 903\u2013928.","DOI":"10.1016\/j.asoc.2017.10.001"},{"key":"2025120523362756431_j_jisys-2018-0273_ref_014","doi-asserted-by":"crossref","unstructured":"J. F. Fu, R. G. Fenton and W. L. Cleghorn, A mixed integer-discrete-continuous programming method and its application to engineering design optimization, Eng. Optim. 17 (1991), 263\u2013280.","DOI":"10.1080\/03052159108941075"},{"key":"2025120523362756431_j_jisys-2018-0273_ref_015","doi-asserted-by":"crossref","unstructured":"A. M. Geoffrion, Lagrangean relaxation, Math. Program. Stud. 2 (1974), 82\u2013114.","DOI":"10.1007\/BFb0120690"},{"key":"2025120523362756431_j_jisys-2018-0273_ref_016","doi-asserted-by":"crossref","unstructured":"C.-X. Guo, J.-S. Hu, B. Ye and Y.-J. Cao, Swarm intelligence for mixed-variable design optimization, J. Zhejiang Univ. Sci. 5 (2004), 851\u201360.","DOI":"10.1631\/jzus.2004.0851"},{"key":"2025120523362756431_j_jisys-2018-0273_ref_017","doi-asserted-by":"crossref","unstructured":"S. He, E. Prempain and Q. Wu, An improved particle swarm optimizer for mechanical design optimization problems, Eng. Optim. 36 (2004), 585\u2013605.","DOI":"10.1080\/03052150410001704854"},{"key":"2025120523362756431_j_jisys-2018-0273_ref_018","doi-asserted-by":"crossref","unstructured":"V. Jeet and E. Kutanoglu, Lagrangian relaxation guided problem space search heuristics for generalized assignment problems, Eur. J. Oper. Res. 182 (2007), 1039\u20131056.","DOI":"10.1016\/j.ejor.2006.09.060"},{"key":"2025120523362756431_j_jisys-2018-0273_ref_019","doi-asserted-by":"crossref","unstructured":"S. Kitayama, M. Arakawa and K. Yamazaki, Penalty function approach for the mixed discrete nonlinear problems by particle swarm optimization, Struct. Multidiscip. Optim. 32 (2006), 191\u2013202.","DOI":"10.1007\/s00158-006-0021-2"},{"key":"2025120523362756431_j_jisys-2018-0273_ref_020","doi-asserted-by":"crossref","unstructured":"M. Kripka, Discrete optimization of trusses by simulated annealing, J. Braz. Soc. Mech. Sci. Eng. 26 (2004), 170\u2013173.","DOI":"10.1590\/S1678-58782004000200008"},{"key":"2025120523362756431_j_jisys-2018-0273_ref_021","unstructured":"J. Lampinen and I. Zelinka, Mixed integer discrete continuous optimization by differential evolution: part 2. A practical example, in: Proceedings of MENDEL\u201999, 5th International Mendel Conference on Soft Computing, pp. 77\u201381, Brno, Czech Republic, 1999."},{"key":"2025120523362756431_j_jisys-2018-0273_ref_022","doi-asserted-by":"crossref","unstructured":"S. Leyffer, Integrating SQP and branch-and-bound for mixed integer nonlinear programming, Comput. Optim. Appl. 18 (2001), 295\u2013309.","DOI":"10.1023\/A:1011241421041"},{"key":"2025120523362756431_j_jisys-2018-0273_ref_023","doi-asserted-by":"crossref","unstructured":"L. J. Li, Z. B. Huang and F. Liu, A heuristic particle swarm optimization method for truss structures with discrete variables, Comput. Struct. 87 (2009), 435\u2013443.","DOI":"10.1016\/j.compstruc.2009.01.004"},{"key":"2025120523362756431_j_jisys-2018-0273_ref_024","doi-asserted-by":"crossref","unstructured":"H. T. Loh and P. Y. Papalambros, A sequential linearization approach for solving mixed-discrete nonlinear design optimization problems, J. Mech. Des. 113 (1991), 325.","DOI":"10.1115\/1.2912786"},{"key":"2025120523362756431_j_jisys-2018-0273_ref_025","doi-asserted-by":"crossref","unstructured":"R. T. Marler and J. S. Arora, Survey of multi-objective optimization methods for engineering, Struct. Multidiscip. Optim. 26 (2004), 369\u2013395.","DOI":"10.1007\/s00158-003-0368-6"},{"key":"2025120523362756431_j_jisys-2018-0273_ref_026","doi-asserted-by":"crossref","unstructured":"R. T. Marler and J. S. Arora, The weighted sum method for multi-objective optimization: new insights, Struct. Multidiscip. Optim. 41 (2010), 853\u2013862.","DOI":"10.1007\/s00158-009-0460-7"},{"key":"2025120523362756431_j_jisys-2018-0273_ref_027","doi-asserted-by":"crossref","unstructured":"T. Messager and M. Pyrz, Discrete optimization of rigid rotor balancing, J. Mech. Sci. Technol. 27 (2013), 2231\u20132236.","DOI":"10.1007\/s12206-013-0605-x"},{"key":"2025120523362756431_j_jisys-2018-0273_ref_028","doi-asserted-by":"crossref","unstructured":"D. Mundo, G. Gatti and D. B. Dooner, Optimized five-bar linkages with non-circular gears for exact path generation, Mech. Mach. Theory 44 (2009), 751\u2013760.","DOI":"10.1016\/j.mechmachtheory.2008.04.011"},{"key":"2025120523362756431_j_jisys-2018-0273_ref_029","doi-asserted-by":"crossref","unstructured":"S. Nema, J. Goulermas, G. Sparrow and P. Cook, A hybrid particle swarm branch-and-bound (HPB) optimizer for mixed discrete nonlinear programming, IEEE Trans. Syst. Man, Cybern. Part A Syst. Hum. 38 (2008), 1411\u20131424.","DOI":"10.1109\/TSMCA.2008.2003536"},{"key":"2025120523362756431_j_jisys-2018-0273_ref_030","doi-asserted-by":"crossref","unstructured":"S. Rajeev and S. C. Krishnamoorthy, Discrete optimization of structures using genetic algorithms, J. Struct. Eng. 118 (1992), 1233\u20131250.","DOI":"10.1061\/(ASCE)0733-9445(1992)118:5(1233)"},{"key":"2025120523362756431_j_jisys-2018-0273_ref_031","unstructured":"R. V. Rao, Teaching Learning Based Optimization Algorithm and its Engineering Applications, Springer, Cham, Switzerland, 2015."},{"key":"2025120523362756431_j_jisys-2018-0273_ref_032","doi-asserted-by":"crossref","unstructured":"R. V. Rao, Jaya: a simple and new optimization algorithm for solving constrained and unconstrained optimization problems, Int. J. Ind. Eng. Comput. 7 (2016), 19\u201334.","DOI":"10.5267\/j.ijiec.2015.8.004"},{"key":"2025120523362756431_j_jisys-2018-0273_ref_033","unstructured":"R. V. R. Rao, Jaya: an Advanced Optimization Algorithm and its Engineering Applications, Springer International Publishing AG, part of Springer Nature, Switzerland, 2019."},{"key":"2025120523362756431_j_jisys-2018-0273_ref_034","doi-asserted-by":"crossref","unstructured":"S. S. Rao and Y. Xiong, A hybrid genetic algorithm for mixed-discrete design optimization, J. Mech. Des. 127 (2005), 1100.","DOI":"10.1115\/1.1876436"},{"key":"2025120523362756431_j_jisys-2018-0273_ref_035","doi-asserted-by":"crossref","unstructured":"R. V. Rao, V. J. Savsani and D. P. Vakharia, Teaching-learning-based optimization: a novel method for constrained mechanical design optimization problems, CAD Comput. Aided Des. 43 (2011), 303\u2013315.","DOI":"10.1016\/j.cad.2010.12.015"},{"key":"2025120523362756431_j_jisys-2018-0273_ref_036","doi-asserted-by":"crossref","unstructured":"R. V. Rao, K. C. More, J. Taler and P. Oc\u0142o\u0144, Optimal design of Stirling heat engine using an advanced optimization algorithm, Sadhana \u2013 Acad. Proc. Eng. Sci. 41 (2016), 1321\u20131331.","DOI":"10.1007\/s12046-016-0553-0"},{"key":"2025120523362756431_j_jisys-2018-0273_ref_037","doi-asserted-by":"crossref","unstructured":"R. V. Rao, K. C. More, L. S. Coelho and V. C. Mariani, Multi-objective optimization of the Stirling heat engine through self-adaptive Jaya algorithm, J. Renew. Sustain. Energy 9 (2017), 033703.","DOI":"10.1063\/1.4987149"},{"key":"2025120523362756431_j_jisys-2018-0273_ref_038","doi-asserted-by":"crossref","unstructured":"R. V. Rao, D. P. Rai and J. Balic, A multi-objective algorithm for optimization of modern machining processes, Eng. Appl. Artif. Intell. 61 (2017), 103\u2013125.","DOI":"10.1016\/j.engappai.2017.03.001"},{"key":"2025120523362756431_j_jisys-2018-0273_ref_039","doi-asserted-by":"crossref","unstructured":"R. V. Rao, D. P. Rai and J. Balic, Multi-objective optimization of abrasive waterjet machining process using Jaya algorithm and PROMETHEE method, J. Intell. Manuf. (2017), 1\u201327. https:\/\/doi.org\/10.1007\/s10845-017-1373-8.","DOI":"10.1007\/s10845-017-1373-8"},{"key":"2025120523362756431_j_jisys-2018-0273_ref_040","doi-asserted-by":"crossref","unstructured":"E. Sandgren, Nonlinear integer and discrete programming in mechanical design optimization, J. Mech. Des. 112 (1990), 223.","DOI":"10.1115\/1.2912596"},{"key":"2025120523362756431_j_jisys-2018-0273_ref_041","doi-asserted-by":"crossref","unstructured":"D. K. Shin, Z. Gurdal and O. H. Griffin, A penalty approach for nonlinear optimization with discrete design variables, Eng. Optim. 16 (1990), 29\u201342.","DOI":"10.1080\/03052159008941163"},{"key":"2025120523362756431_j_jisys-2018-0273_ref_042","doi-asserted-by":"crossref","unstructured":"R. Singh, H. Chaudhary and A. K. Singh, Defect-free optimal synthesis of crank-rocker linkage using nature-inspired optimization algorithms, Mech. Mach. Theory J. 116 (2017), 105\u2013122.","DOI":"10.1016\/j.mechmachtheory.2017.05.018"},{"key":"2025120523362756431_j_jisys-2018-0273_ref_043","doi-asserted-by":"crossref","unstructured":"M. Sonmez, Discrete optimum design of truss structures using artificial bee colony algorithm, Struct. Multidiscip. Optim. 43 (2011), 85\u201397.","DOI":"10.1007\/s00158-010-0551-5"},{"key":"2025120523362756431_j_jisys-2018-0273_ref_044","unstructured":"C. Sun, J. Zeng and J. S. Pan, A modified particle swarm optimization with feasibility-based rules for mixed-variable optimization problems, Int. J. Innov. Comput. Inf. Control 7 (2011), 3081\u20133096."},{"key":"2025120523362756431_j_jisys-2018-0273_ref_045","unstructured":"A. C. Varshney, Data Book for Agricultural Machinery Design, Central Institute of Agricultural Engineering, Bhopal, India, 2004."},{"key":"2025120523362756431_j_jisys-2018-0273_ref_046","doi-asserted-by":"crossref","unstructured":"S.-J. Wu and P.-T. Chow, Genetic algorithms for nonlinear mixed discrete-integer optimization problems via meta-genetic parameter optimization, Eng. Optim. 24 (1995), 137\u2013159.","DOI":"10.1080\/03052159508941187"},{"key":"2025120523362756431_j_jisys-2018-0273_ref_047","doi-asserted-by":"crossref","unstructured":"C. Zhang and H. P. (Ben) Wang, Mixed-discrete nonlinear optimization with simulated annealing, Eng. Optim. 21 (1993), 277\u2013291.","DOI":"10.1080\/03052159308940980"}],"container-title":["Journal of Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyter.com\/view\/journals\/jisys\/29\/1\/article-p1007.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2018-0273\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2018-0273\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T23:37:49Z","timestamp":1764977869000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2018-0273\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,23]]},"references-count":47,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2018,4,25]]},"published-print":{"date-parts":[[2019,12,18]]}},"alternative-id":["10.1515\/jisys-2018-0273"],"URL":"https:\/\/doi.org\/10.1515\/jisys-2018-0273","relation":{},"ISSN":["2191-026X","0334-1860"],"issn-type":[{"value":"2191-026X","type":"electronic"},{"value":"0334-1860","type":"print"}],"subject":[],"published":{"date-parts":[[2018,10,23]]}}}