Abstract
The multi-objective evolutionary algorithm based on decomposition (MOEA/D) is an aggregation-based algorithm which has became successful for solving multi-objective optimization problems (MOPs). So far, for the continuous domain, the most successful variants of MOEA/D are based on differential evolution (DE) operators. However, no investigations on the application of DE-like operators within MOEA/D exist in the context of combinatorial optimization. This is precisely the focus of the work reported in this paper. More particularly, we study the incorporation of geometric differential evolution (gDE), the discrete generalization of DE, into the MOEA/D framework. We conduct preliminary experiments in order to study the effectiveness of gDE when coupled with MOEA/D. Our results indicate that the proposed approach is able to outperform the standard version of MOEA/D, when solving a combinatorial optimization problem having between two and four objective functions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Note, however, that in the minimization case \(d_1 = \frac{||(\varvec{F}(\varvec{x}) -\varvec{z}^{\star } )^\intercal \mathbf {\lambda }||}{||\mathbf {\lambda }||}\), \(d_2 = \left| \left| (\mathbf {F}(\mathbf {x}) - \right. \right. \) \(\left. \left. \mathbf {z}^{\star }) - d_1\frac{\mathbf {\lambda }}{||\mathbf {\lambda }||}\right| \right| \) and the reference point is such that \(\forall i\in \{1,\ldots ,M\},\forall \mathbf {x}\in X, z^\star <f_i(\mathbf {x})\).
References
Abbass, H.A., Sarker, R., Newton, C.: PDE: a Pareto-frontier differential evolution approach for multi-objective optimization problems. In: CEC 2001, vol. 2, pp. 971–978. IEEE Service Center, Piscataway, May 2001
Coello Coello, C.A., Lamont, G.B., Van Veldhuizen, D.A.: Evolutionary Algorithms for Solving Multi-Objective Problems, 2nd edn. Springer, New York (2007). ISBN 978-0-387-33254-3
Das, I., Dennis, J.E.: Normal-boundary intersection: a new method for generating Pareto optimal points in multicriteria optimization problems. SIAM J. Optim. 8(3), 631–657 (1998)
Deb, K.: Multi-Objective Optimization using Evolutionary Algorithms. John Wiley & Sons, Chichester (2001)
Deb, K., Agrawal, R.B.: Simulated binary crossover for continuous search space. Complex Syst. 9(2), 115–148 (1995)
Deb, K., Agrawal, R.B.: A Niched-Penalty approach for constraint handling in genetic algorithms. Artificial Neural Networks and Genetic Algorithms, pp. 235–243. Springer, Vienna (1999)
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE TEVC 6(2), 182–197 (2002)
Ehrgott, M.: Multicriteria Optimization, 2nd edn. Springer, Berlin (2005)
Giagkiozis, I., Purshouse, R.C., Fleming, P.J.: Generalized decomposition. In: Purshouse, R.C., Fleming, P.J., Fonseca, C.M., Greco, S., Shaw, J. (eds.) EMO 2013. LNCS, vol. 7811, pp. 428–442. Springer, Heidelberg (2013)
Hughes, E.: Multiple single objective Pareto sampling. In: IEEE 2003 Congress on Evolutionary Computation (CEC 2003), vol. 4, pp. 2678–2684, December 2003
Kukkonen, S., Lampinen, J.: GDE3: the third evolution step of generalized differential evolution. In: IEEE Congress on Evolutionary Computation, vol. 1, pp. 443–450, September 2005
Li, H., Zhang, Q.: Multiobjective optimization problems with complicated Pareto sets, MOEA/D and NSGA-II. IEEE Trans. Evol. Comput. 13(2), 284–302 (2009)
López-Ibáñez, M., Paquete, L., Stützle, T.: Exploratory analysis of stochastic local search algorithms in biobjective optimization. In: Bartz-Beielstein, T., Chiarandini, M., Paquete, L., Preuss, M. (eds.) Experimental Methods for the Analysis of Optimization Algorithms, chap. 9, pp. 209–222. Springer, Heidelberg (2010)
Miettinen, K.: Nonlinear Multiobjective Optimization. Kluwer Academic Publishers, Boston (1999)
Moraglio, A., Togelius, J.: Geometric differential evolution. In: GECCO 2009, pp. 1705–1712. ACM (2009)
Moraglio, A., Togelius, J., Silva, S.: Geometric differential evolution for combinatorial and programs spaces. Evol. Comput. 21(4), 591–624 (2013)
Scheffé, H.: Experiments with mixtures. J. Roy. Stat. Soc.: Ser. B (Methodol.) 20(2), 344–360 (1958)
Storn, R.M., Price, K.V.: Differential Evolution - a simple and efficient adaptive scheme for global optimization over continuous spaces. Technical report TR-95-012, ICSI, Berkeley, March 1995
Vincke, P.: Multicriteria Decision-Aid. John Wiley & Sons, New York (1992)
Zapotecas-Martínez, S., Aguirre, H.E., Tanaka, K., Coello Coello, C.A.: On the Low-Dyscrepancy sequences and their use in MOEA/D for high-dimensional objective spaces. In: 2015 IEEE Congress on Evolutionary Computation (CEC 2015), pp. 2835–2842. IEEE Press, Sendai, May 2015
Zhang, Q., Li, H.: MOEA/D: a multiobjective evolutionary algorithm based on decomposition. IEEE TEVC 11(6), 712–731 (2007)
Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: Improving the strength Pareto evolutionary algorithm. In: Giannakoglou, K., Tsahalis, D., Periaux, J., Papailou, P., Fogarty, T. (eds.) EUROGEN 2001, Evolutionary Methods for Design, Optimization and Control with Applications to Industrial Problems, Athens, Greece (2001)
Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE TEVC 3(4), 257–271 (1999)
Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., Grunert da Fonseca, V.: Performance assessment of multiobjective optimizers: an analysis and review. IEEE TEC 7(2), 117–132 (2003)
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
Zapotecas-Martínez, S., Derbel, B., Liefooghe, A., Aguirre, H.E., Tanaka, K. (2015). Geometric Differential Evolution in MOEA/D: A Preliminary Study. In: Sidorov, G., Galicia-Haro, S. (eds) Advances in Artificial Intelligence and Soft Computing. MICAI 2015. Lecture Notes in Computer Science(), vol 9413. Springer, Cham. https://doi.org/10.1007/978-3-319-27060-9_30
Download citation
DOI: https://doi.org/10.1007/978-3-319-27060-9_30
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-27059-3
Online ISBN: 978-3-319-27060-9
eBook Packages: Computer ScienceComputer Science (R0)