Abstract
Solving multi-objective optimization problems (MOPs) is a challenging task since they conflict with each other. In addition, incorporation of constraints to the MOPs, called CMOPs for a short, increases their complexity. Traditional multi-objective evolutionary algorithms (MOEAs) treat multiple objectives as a whole while solving them. By doing so, fitness assignment to each individual is difficult. In order to overcome this difficulty, in this paper, multiple populations are considered for multiple objectives to optimize simultaneously and a hybrid method of Jaya algorithm (JA) and quasi reflected opposition based learning (QROBL), to maintain diversity among populations, is used as an optimizer to solve CMOPs. An archive is also used to store all non-dominated solutions and to guide the search towards the Pareto front. A local search (LS) method is performed on the archive members to improve their quality and converge to the Pareto front. The whole above process is named as CMOJA. The obtained results are compared with the state-of-the-art algorithms and demonstrated that the proposed hybrid method has shown its superiority to its competitors.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Chen, B., Zeng, W., Lin, Y., Zhang, D.: A new local search-based multiobjective optimization algorithm. IEEE Trans. Evol. Comput. 19, 50–73 (2015)
Ergezer, M., Simon, D., Du, D.: Oppositional biogeography-based optimization. In: 2009 IEEE International Conference on Systems, Man and Cybernetics, pp. 1009–1011 (2009)
Huang, C., Wang, L., Yeung, R.S.C., Zhang, Z., Chung, H.S.H., Bensoussan, A.: A prediction model-guided Jaya algorithm for the PV system maximum power point tracking. IEEE Trans. Sustain. Energy 9, 45–55 (2018)
Naidu, Y.R., Ojha, A.K.: Solving multiobjective optimization problems using hybrid cooperative invasive weed optimization with multiple populations. IEEE Trans. Syst. Man Cybern. Syst. 48, 821–832 (2018)
Rao, R.: Jaya: a simple and new optimization algorithm for solving constrained and unconstrained optimization problems. Int. J. Industr. Eng. Comput. 7, 19–34 (2016)
Rao, R.V., Rai, D.P., Balic, J.: A multi-objective algorithm for optimization of modern machining processes. Eng. Appl. Artif. Intell. 61, 103–125 (2017)
Sadollah, A., Eskandar, H., Kim, J.H.: Water cycle algorithm for solving constrained multi-objective optimization problems. Appl. Soft Comput. 27, 279–298 (2015)
Tizhoosh, H.R.: Opposition-based learning: a new scheme for machine intelligence. In International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce (CIMCA-IAWTIC 2006), vol. 1, pp. 695–701 (2005)
Wang, J., Zhang, W., Zhang, J.: Cooperative differential evolution with multiple populations for multiobjective optimization. IEEE Trans. Cybern. 46, 2848–2861 (2016)
Zhan, Z.-H., et al.: Multiple populations for multiple objectives: a coevolutionary technique for solving multiobjective optimization problems. IEEE Trans. Cybern. 43, 445–463 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Ramu Naidu, Y., Ojha, A.K., Susheela Devi, V. (2020). Multi-objective Jaya Algorithm for Solving Constrained Multi-objective Optimization Problems. In: Kim, J., Geem, Z., Jung, D., Yoo, D., Yadav, A. (eds) Advances in Harmony Search, Soft Computing and Applications. ICHSA 2019. Advances in Intelligent Systems and Computing, vol 1063. Springer, Cham. https://doi.org/10.1007/978-3-030-31967-0_11
Download citation
DOI: https://doi.org/10.1007/978-3-030-31967-0_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-31966-3
Online ISBN: 978-3-030-31967-0
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)