Abstract
Designers are increasingly being confronted with practical applications that require solution of optimization problems with more than three conflicting objectives. In recent years, a number of efficient algorithms have been proposed to deal with such problems, commonly referred to as many-objective optimization problems (MaOP). However, most such algorithms require evaluation of numerous solutions prior to convergence which may not be affordable for practical applications involving computationally expensive evaluations. While surrogates or approximations have long been used to deal with single-/multi-objective optimization problems involving expensive evaluations, they are not designed to deal with MaOPs which involve unique set of challenges. In this chapter, we introduce a surrogate-assisted optimization algorithm for many-objective optimization (SaMaO) which is capable of delivering converged and well distributed set of solutions within a limited computing budget. The proposed algorithm successfully combines features of state-of-the-art MaOPs and surrogate-assisted optimization strategies. The algorithm relies on principles of decomposition and adaption of reference vectors for effective search. The flexibility of function representation is offered through the use of multiple types of surrogate models. Furthermore, to efficiently deal with constrained MaOPs, marginally infeasible solutions are promoted during initial phases of the search. The performance of the proposed algorithm is objectively evaluated and compared with state-of-the-art approaches using three to ten objective DTLZ and WFG benchmarks, recently introduced minus DTLZ and minus WFG benchmarks and constrained C-DTLZ benchmarks. The results clearly highlight the competence of the proposed approach. The chapter also provides a summary of considerations that are important for practical applications and areas which need further development.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bhattacharjee, K.S., Singh, H.K., Ray, T.: Multi-objective optimization with multiple spatially distributed surrogates. J. Mech. Des. 138(9), 091–401 (2016)
Bhattacharjee, K.S., Singh, H.K., Ray, T.: A novel decomposition based evolutionary algorithm for engineering design optimization. J. Mech. Des. 139(4), 041–403 (2017)
Bhattacharjee, K.S., Singh, H.K., Ray, T.: Multiple surrogate-assisted many-objective optimization for computationally expensive engineering design. J. Mech. Des. 140(5), 051–403 (2018)
Bhattacharjee, K.S., Singh, H.K., Ryan, M., Ray, T.: Bridging the gap: Many-objective optimization and informed decision-making. IEEE Trans. Evol. Comput. 21(5), 813–820 (2017)
Cheng, R., Jin, Y., Olhofer, M., Sendhoff, B.: A reference vector guided evolutionary algorithm for many-objective optimization. IEEE Trans. Evol. Comput. 20(5), 773–791 (2016)
Chugh, T., Jin, Y., Meittinen, K., Hakanen, J., Sindhya, K.: A surrogate-assisted reference vector guided evolutionary algorithm for computationally expensive many-objective optimization. IEEE Trans. Evol. Comput. 22(1), 129–142 (2018)
Chugh, T., Sindhya, K., Miettinen, K., Hakanen, J., Jin, Y.: On constraint handling in surrogate-assisted evolutionary many-objective optimization. In: Proceedings of the International Conference on Parallel Problem Solving from Nature, pp. 214–224 (2016)
Das, I., Dennis, J.E.: Normal-boundary intersection: A new method for generating the pareto surface in nonlinear multicriteria optimization problems. SIAM J. Optim. 8(3), 631–657 (1998)
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182–197 (2002)
Deb, K., Thiele, L., Laumanns, M., Zitzler, E.: Scalable test problems for evolutionary multiobjective optimization. In: Proceedings of the International Conference on Evolutionary Multiobjective Optimization, pp. 105–145 (2005)
Huband, S., Hingston, P., Barone, L., While, L.: A review of multi-objective test problems and a scalable test problem toolkit. IEEE Trans. Evol. Comput. 10(5), 477–506 (2006)
Isaacs, A., Ray, T., Smith, W.: Multi-objective design optimisation using multiple adaptive spatially distributed surrogates. Int. J. Prod. Dev. 9(1–3), 188–217 (2009)
Ishibuchi, H., Masuda, H., Tanigaki, Y., Nojima, Y.: Modified distance calculation in generational distance and inverted generational distance. In: International Conference on Evolutionary Multi-Criterion Optimization, pp. 110–125. Springer, Berlin (2015)
Ishibuchi, H., Tsukamoto, N., Nojima, Y.: Evolutionary many-objective optimization: A short review. In: Proceedings of the IEEE Congress on Evolutionary Computation, pp. 2419–2426 (2008)
Ishibuchi, H., Yu, S., Hiroyuki, M., Yusuke, N.: Performance of decomposition-based many-objective algorithms strongly depends on Pareto front shapes. IEEE Trans. Evol. Comput. 21(2), 169–190 (2017)
Jain, H., Deb, K.: An evolutionary many-objective optimization algorithm using reference-point based nondominated sorting approach, part II: Handling constraints and extending to an adaptive approach. IEEE Trans. Evol. Comput. 18(4), 602–622 (2014)
Jin, Y.: A comprehensive survey of fitness approximation in evolutionary computation. Soft Comput.-Fusion Found., Methodol. Appl. 9(1), 3–12 (2005)
Jin, Y.: Surrogate-assisted evolutionary computation: Recent advances and future challenges. Swarm Evol. Comput. 1(2), 61–70 (2011)
Knowles, J.: ParEGO: A hybrid algorithm with on-line landscape approximation for expensive multiobjective optimization problems. IEEE Trans. Evol. Comput. 10(1), 50–66 (2006)
Li, B., Li, J., Tang, K., Yao, X.: Many-objective evolutionary algorithms: A survey. ACM Comput. Surv. 48(1), 13:1–13:35 (2015)
Li, K., Deb, K., Zhang, Q., Kwong, S.: An evolutionary many-objective optimization algorithm based on dominance and decomposition. IEEE Trans. Evol. Comput. 19(5), 694–716 (2015)
Miettinen, K.: Nonlinear Multiobjective Optimization. Kluwer Academic Publishers, Boston (1998)
Ray, T., Singh, H.K., Isaacs, A., Smith, W.F.: Infeasibility driven evolutionary algorithm for constrained optimization. In: Constraint-Handling in Evolutionary Optimization, pp. 145–165 (2009)
Runarsson, T.P., Yao, X.: Stochastic ranking for constrained evolutionary optimization. IEEE Trans. Evol. Comput. 4(3), 284–294 (2000)
Singh, H.K., Alam, K., Ray, T.: Use of infeasible solutions during constrained evolutionary search: A short survey. In: Proceedings of the International Conference on Artificial Life and Computational Intelligence, Lecture Notes in Computer Science, vol. 9592, pp. 193–205. Springer, Berlin (2016)
Singh, H.K., Isaacs, A., Ray, T.: Infeasibility driven evolutionary algorithm (IDEA) for engineering design optimization. In: Proceedings of the 21st Australasian Joint Conference on Artificial Intelligence. Lecture Notes in Artificial Intelligence, vol. 5361, pp. 104–115 (2008)
Singh, H.K., Ray, T., Sarker, R.: Optimum oil production planning using infeasibility driven evolutionary algorithm. Evol. Comput. 21(1), 65–82 (2013)
Takahama, T., Sakai, S.: Constrained optimization by applying the \(\alpha \) constrained method to the nonlinear simplex method with mutations. IEEE Trans. Evol. Comput. 9(5), 437–451 (2005)
The Mathworks, Inc.: Matlab 2015b. www.mathworks.com/products/matlab
Tian, Y., Cheng, R., Zhang, X., Jin, Y.: PlatEMO: A MATLAB platform for evolutionary multi-objective optimization [educational forum]. IEEE Comput. Intell. Mag. 12(4), 73–87 (2017)
Trivedi, A., Srinivasan, D., Sanyal, K., Ghosh, A.: A survey of multi-objective evolutionary algorithms based on decomposition. IEEE Transactions on Evolutionary Computation 21(3), 440–462 (2017)
Voss, T., Beume, N., Rudolph, G., Igel, C.: Scalarization versus indicator-based selection in multi-objective cma evolution strategies. In: Proceedings of International Conference on IEEE Congress Evolutionary Computation, pp. 3036–3043 (2008)
Wang, G.G., Shan, S.: Review of metamodeling techniques in support of engineering design optimization. J. Mech. Des. 129(4), 370–380 (2007)
Yuan, Y., Xu, H., Wang, B., Yao, X.: A new dominance relation-based evolutionary algorithm for many-objective optimization. IEEE Transactions on Evolutionary Computation 20(1), 16–37 (2016)
Zhang, Q., Li, H.: MOEA/D: A multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712–731 (2007)
Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., Da Fonseca, V.G.: Performance assessment of multiobjective optimizers: An analysis and review. IEEE Trans. Evol. Comput. 7(2), 117–132 (2003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Bhattacharjee, K.S., Singh, H.K., Ray, T. (2020). Many-Objective Optimization with Limited Computing Budget. In: Bartz-Beielstein, T., Filipič, B., Korošec, P., Talbi, EG. (eds) High-Performance Simulation-Based Optimization. Studies in Computational Intelligence, vol 833. Springer, Cham. https://doi.org/10.1007/978-3-030-18764-4_2
Download citation
DOI: https://doi.org/10.1007/978-3-030-18764-4_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-18763-7
Online ISBN: 978-3-030-18764-4
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)