Abstract
Inverse model based multiobjective evolutionary algorithm aims to sample candidate solutions directly in the objective space, which makes it easier to control the diversity of non-dominated solutions in multiobjective optimization. To facilitate the process of inverse modeling, the objective space is partitioned into several subregions by predefining a set of reference vectors. In the previous work, the reference vectors are uniformly distributed in the objective space. Uniformly distributed reference vectors, however, may not be efficient for problems that have nonuniform or disconnected Pareto fronts. To address this issue, an adaptive reference vector generation strategy is proposed in this work. The basic idea of the proposed strategy is to adaptively adjust the reference vectors according to the distribution of the candidate solutions in the objective space. The proposed strategy consists of two phases in the search procedure. In the first phase, the adaptive strategy promotes the population diversity for better exploration, while in the second phase, the strategy focused on convergence for better exploitation. To assess the performance of the proposed strategy, empirical simulations are carried out on two DTLZ benchmark problems, namely, DTLZ5 and DTLZ7, which have a degenerate and a disconnected Pareto front, respectively. Our results show that the proposed adaptive reference vector strategy is promising in tacking multiobjective optimization problems whose Pareto front is disconnected.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bosman, P.A., Thierens, D.: The balance between proximity and diversity in multiobjective evolutionary algorithms. IEEE Transactions on Evolutionary Computation 7(2), 174–188 (2003)
Cheng, R., Jin, Y., Narukawa, K., Sendhoff, B.: A multiobjective evoltuionary algorithm using Gaussian process based inverse modeling. IEEE Transactions on Evolutionary Computation (accepted in 2015)
Cornell, J.A.: Experiments with mixtures: designs, models, and the analysis of mixture data. John Wiley & Sons (2011)
Deb, K., Jain, H.: An evolutionary many-objective optimization algorithm using reference-point based non-dominated sorting approach, part I: Solving problems with box constraints. IEEE Transactions on Evolutionary Computation 18(4), 577–601 (2013)
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation 6(2), 182–197 (2002)
Deb, K., Thiele, L., Laumanns, M., Zitzler, E.: Scalable multi-objective optimization test problems. In: Proceedings of the Congress on Evolutionary Computation, pp. 825–830. IEEE (2002)
Giagkiozis, I., Fleming, P.J.: Pareto front estimation for decision making. Evolutionary Computation (accepted in 2014)
Jain, H., Deb, K.: An evolutionary many-objective optimization algorithm using reference-point based non-dominated sorting approach, part II: Handling constraints and extending to an adaptive approach. IEEE Transactions on Evolutionary Computation 18(4), 602–622 (2013)
Jin, Y., Sendhoff, B.: Connectedness, regularity and the success of local search in evolutionary multi-objective optimization. In: Proceedings of the IEEE Congress on Evolutionary Computation, vol. 3, pp. 1910–1917. IEEE (2003)
Liu, H.L., Gu, F., Zhang, Q.: Decomposition of a multiobjective optimization problem into a number of simple multiobjective subproblems. IEEE Transactions on Evolutionary Computation 18(3), 2450–455 (2014)
MartÃ, L., Garcia, J., Berlanga, A., Coello Coello, C., Molina, J.M.: On current model-building methods for multi-objective estimation of distribution algorithms: Shortcommings and directions for improvement. Department of Informatics, Universidad Carlos III de Madrid, Madrid, Spain, Technical Report GIAA2010E001 (2010)
Okabe, T., Jin, Y., Sendoff, B., Olhofer, M.: Voronoi-based estimation of distribution algorithm for multi-objective optimization. In: Proceedings of the IEEE Congress on Evolutionary Computation, vol. 2, pp. 1594–1601. IEEE (2004)
Rasmussen, C.E.: Gaussian processes for machine learning. MIT Press (2006)
Zhang, Q., Li, H.: MOEA/D: A multiobjective evolutionary algorithm based on decomposition. IEEE Transactions on Evolutionary Computation 11(6), 712–731 (2007)
Zhang, Q., Zhou, A., Jin, Y.: RM-MEDA: A regularity model-based multiobjective estimation of distribution algorithm. IEEE Transactions on Evolutionary Computation 12(1), 41–63 (2008)
Zhou, A., Qu, B.Y., Li, H., Zhao, S.Z., Suganthan, P.N., Zhang, Q.: Multiobjective evolutionary algorithms: A survey of the state of the art. Swarm and Evolutionary Computation 1(1), 32–49 (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Cheng, R., Jin, Y., Narukawa, K. (2015). Adaptive Reference Vector Generation for Inverse Model Based Evolutionary Multiobjective Optimization with Degenerate and Disconnected Pareto Fronts. In: Gaspar-Cunha, A., Henggeler Antunes, C., Coello, C. (eds) Evolutionary Multi-Criterion Optimization. EMO 2015. Lecture Notes in Computer Science(), vol 9018. Springer, Cham. https://doi.org/10.1007/978-3-319-15934-8_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-15934-8_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-15933-1
Online ISBN: 978-3-319-15934-8
eBook Packages: Computer ScienceComputer Science (R0)