Abstract
Multi-objective optimization problems with more than three objectives, which are also termed as many objective optimization problems, play an important role in the decision making process. For such problems, it is computationally expensive or even intractable to approximate the entire set of optimal solutions. An alternative is to compute a subset of optimal solutions based on the preferences of the decision maker. Commonly, interactive methods from the literature consider the user preferences at every iteration by means of weight vectors or reference points. Besides the fact that mathematical programming techniques only produce one solution at each iteration, they generally require first or second derivative information, that limits its applicability to certain problems. The approach proposed in this paper allows to steer the search into any direction in the objective space for optimization problems of discrete nature. This provides a more intuitive way to set the preferences, which represents a useful tool to explore the regions of interest of the decision maker. Numerical results on multi-objective multi-dimensional knapsack problem instances show the interest of the proposed approach.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aguirre, H., Tanaka, K.: Many-objective optimization by space partitioning and adaptive \(\varepsilon \)-ranking on MNK-landscapes. In: Ehrgott, M., Fonseca, C.M., Gandibleux, X., Hao, J.-K., Sevaux, M. (eds.) EMO 2009. LNCS, vol. 5467, pp. 407–422. Springer, Heidelberg (2009). doi:10.1007/978-3-642-01020-0_33
Alves, M., Almeida, M.: MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem. Comput. Oper. Res. 34(11), 3458–3470 (2007)
Auger, A., Bader, J., Brockhoff, D., Zitzler, E.: Articulating user preferences in many-objective problems by sampling the weighted hypervolume. In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation, pp. 555–562. ACM (2009)
Bader, J., Zitzler, E.: Hype: an algorithm for fast hypervolume-based many-objective optimization. Evol. Comput. 19(1), 45–76 (2011)
Beume, N., Naujoks, B., Emmerich, M.: SMS-EMOA: multiobjective selection based on dominated hypervolume. EJOR 181(3), 1653–1669 (2007)
Branke, J., Deb, K.: Integrating user preferences into evolutionary multi-objective optimization. In: Jin, Y. (ed.) Knowledge Incorporation in Evolutionary Computation, pp. 461–477. Springer, Heidelberg (2005)
Brockhoff, D., Saxena, D.K., Deb, K., Zitzler, E.: On handling a large number of objectives a posteriori and during optimization. In: Knowles, J., Corne, D., Deb, K., Chair, D.R. (eds.) Multiobjective Problem Solving from Nature, pp. 377–403. Springer, Heidelberg (2008)
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)
Coello, C.: Handling preferences in evolutionary multiobjective optimization: a survey. In: Proceedings of the 2000 Congress on Evolutionary Computation, vol. 1, pp. 30–37 (2000)
Coello, C., Lamont, G., Van Veldhuizen, D.: Evolutionary Algorithms for Solving Multi-objective Problems, 2nd edn. Springer, Heidelberg (2007)
Coello, C., Van Veldhuizen, D., Lamont, G.: Evolutionary Algorithms for Solving Multi-objective Problems, vol. 242. Springer, Heidelberg (2002)
Deb, K.: Multi-objective Optimization Using Evolutionary Algorithms, vol. 16. Wiley, Hoboken (2001)
Deb, K., Jain, H.: An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: solving problems with box constraints. IEEE Trans. Evol. Comput. 18(4), 577–601 (2014)
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)
Di Pierro, F., Khu, S.T., Savic, D., et al.: An investigation on preference order ranking scheme for multiobjective evolutionary optimization. IEEE Trans. Evol. Comput. 11(1), 17–45 (2007)
Ehrgott, M.: Multicriteria Optimization, 2nd edn. Springer, Heidelberg (2005)
Farina, M., Amato, P.: On the optimal solution definition for many-criteria optimization problems. In: Proceedings of the NAFIPS-FLINT International Conference, pp. 233–238 (2002)
Giagkiozis, I., Fleming, P.: Pareto front estimation for decision making. Evol. Comput. 22(4), 651–678 (2014)
Hernández Mejía, J.A., Schütze, O., Cuate, O., Lara, A., Deb, K.: RDS-NSGA-II: a memetic algorithm for reference point based multi-objective optimization. Eng. Optim. 1–18 (2016)
Ishibuchi, H., Sakane, Y., Tsukamoto, N., Nojima, Y.: Evolutionary many-objective optimization by NSGA-II and MOEA/D with large populations. In: IEEE International Conference on Systems, Man and Cybernetics, SMC 2009, pp. 1758–1763. IEEE (2009)
Knowles, J., Corne, D.: Quantifying the effects of objective space dimension in evolutionary multiobjective optimization. In: Obayashi, S., Deb, K., Poloni, C., Hiroyasu, T., Murata, T. (eds.) EMO 2007. LNCS, vol. 4403, pp. 757–771. Springer, Heidelberg (2007). doi:10.1007/978-3-540-70928-2_57
Marler, R., Arora, J.: The weighted sum method for multi-objective optimization: new insights. Struct. Multi. Optim. 41(6), 853–862 (2010)
Martín, A., Schütze, O.: A new predictor corrector variant for unconstrained bi-objective optimization problems. In: Tantar, A.-A., et al. (eds.) EVOLVE - A Bridge Between Probability, Set Oriented Numerics, and Evolutionary Computation V. AISC, vol. 288, pp. 165–179. Springer, Heidelberg (2014). doi:10.1007/978-3-319-07494-8_12
Miettinen, K.: Nonlinear Multiobjective Optimization. Kluwer, Boston (1999)
Miettinen, K., Mäkelä, M.M.: Interactive multiobjective optimization system WWW-NIMBUS on the Internet. Comput. Oper. Res. 27(7), 709–723 (2000)
Miettinen, K., Ruiz, F., Wierzbicki, A.P.: Introduction to multiobjective optimization: interactive approaches. In: Branke, J., Deb, K., Miettinen, K., Słowiński, R. (eds.) Multiobjective Optimization. LNCS, vol. 5252, pp. 27–57. Springer, Heidelberg (2008). doi:10.1007/978-3-540-88908-3_2
Purshouse, R., Fleming, P.: On the evolutionary optimization of many conflicting objectives. IEEE Trans. Evol. Comput. 11(6), 770–784 (2007)
Schütze, O., Martin, A., Lara, A., Alvarado, S., Salinas, E., Coello, C.A.: The directed search method for multiobjective memetic algorithms. Comput. Optim. Appl. 63, 305–332 (2016)
Singh, H.K., Isaacs, A., Ray, T.: A Pareto corner search evolutionary algorithm and dimensionality reduction in many-objective optimization problems. IEEE Trans. Evol. Comput. 15(4), 539–556 (2011)
Wierzbicki, A.: The use of reference objectives in multiobjective optimization. In: Fandel, G., Gal, T. (eds.) Multiple Criteria Decision Making Theory and Application, pp. 468–486. Springer, Heidelberg (1980)
Yang, S., Li, M., Liu, X., Zheng, J.: A grid-based evolutionary algorithm for many-objective optimization. IEEE Trans. Evol. Comput. 17(5), 721–736 (2013)
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.: Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans. Evol. Comput. 3(4), 257–271 (1999)
Zou, X., Chen, Y., Liu, M., Kang, L.: A new evolutionary algorithm for solving many-objective optimization problems. IEEE Trans. Syst. Man Cyber. Part B Cybern. 38(5), 1402–1412 (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Cuate, O., Derbel, B., Liefooghe, A., Talbi, EG., Schütze, O. (2017). An Approach for the Local Exploration of Discrete Many Objective Optimization Problems. In: Trautmann, H., et al. Evolutionary Multi-Criterion Optimization. EMO 2017. Lecture Notes in Computer Science(), vol 10173. Springer, Cham. https://doi.org/10.1007/978-3-319-54157-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-54157-0_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-54156-3
Online ISBN: 978-3-319-54157-0
eBook Packages: Computer ScienceComputer Science (R0)