IEEE Computational Intelligence Magazine - August 2019 - 74

using stepwise regression model," Struct. Multidisc. Optim., vol. 35, pp. 561-569, 2007.
[32] M. Li, C. Grosan, S. Yang, X. Liu, and X. Yao,
"Multiline distance minimization: A visualized manyobjective test problem suite," IEEE Trans. Evol. Comput.,
vol. 22, no. 1, pp. 61-78, 2018.
[33] Y. Tian, R. Cheng, X. Zhang, and Y. Jin, "PlatEMO: A MATLAB platform for evolutionary multi-objective optimization," IEEE Comput. Intell. Mag., vol. 12,
no. 4, pp. 73-87, 2017.
[34] E. Zitzler, M. Laumanns, and L. Thiele, "SPEA2:
Improving the strength Pareto evolutionary algorithm for
multiobjective optimization," in Proc. 5th Conf. Evolutionary Methods for Design, Optimization and Control with Applications to Industrial Problems, 2001, pp. 95-100.
[35] E. Zitzler and S. Künzli, "Indicator-based selection
in multiobjective search," in Proc. 8th Int. Conf. Parallel
Problem Solving from Nature, 2004, pp. 832-842.
[36] M. Li, S. Yang, and X. Liu, "Pareto or non-Pareto: Bicriterion evolution in multi-objective optimization," IEEE
Trans. Evol. Comput., vol. 20, no. 5, pp. 645-665, 2016.
[37] N. Beume, B. Naujoks, and M. Emmerich, "SMSEMOA: Multiobjective selection based on dominated
hypervolume," Eur. J. Oper. Res., vol. 181, no. 3, pp.
1653-1669, 2007.
[38] X. Zhang, Y. Tian, R. Cheng, and Y. Jin, "An efficient approach to non-dominated sorting for evolutionary multi-objective optimization," IEEE Trans. Evol.
Comput., vol. 19, no. 2, pp. 201-213, 2015.
[39] K. Deb, Multi-Objective Optimization Using Evolutionary Algorithms. New York: Wiley, 2001.
[40] K. Deb and M. Goyal, "A combined genetic adaptive
search (GeneAS) for engineering design," Comput. Sci.
Inform., vol. 26, no. 4, pp. 30-45, 1996.

[41] Y. Tian, X. Xiang, X. Zhang, R. Cheng, and Y.
Jin, "Sampling reference points on the Pareto fronts of
benchmark multi-objective optimization problems,"
in Proc. 2018 IEEE Congr. Evolutionary Computation, in
press.
[42] E. Zitzler, K. Deb, and L. Thiele, "Comparison
of multiobjective evolutionary algorithms: Empirical
results," Evol. Comput., vol. 8, no. 2, pp. 173-195,
2000.
[43] Q. Zhang and H. Li, "MOEA/D: A multi-objective evolutionary algorithm based on decomposition,"
IEEE Trans. Evol. Comput., vol. 11, no. 6, pp. 712-731,
2007.
[44] L. B. S. Huband, P. Hingston, and L. While, "A review of multiobjective test problems and a scalable test
problem toolkit," IEEE Trans. Evol. Comput., vol. 10, no.
5, pp. 477-506, 2006.
[45] H. Jain and K. Deb, "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., vol. 18, no. 4, pp.
602-622, 2014.
[46] R. Cheng et al., "A benchmark test suite for evolutionary many-objective optimization," Complex Intell.
Syst., vol. 3, no. 1, pp. 67-81, 2017.
[47] R. Cheng, Y. Jin, M. Olhofer, and B. Sendhoff, "Test
problems for large-scale multiobjective and many-objective optimization," IEEE Trans. Cybern., vol. 47, no. 12,
pp. 4108-4121, 2017.
[48] H.-L. Liu, F. Gu, and Q. Zhang, "Decomposition
of a multiobjective optimization problem into a number
of simple multiobjective subproblems," IEEE Trans. Evol.
Comput., vol. 18, no. 3, pp. 450-455, 2014.

[49] K. Deb, "Multi-objective genetic algorithms: Problem difficulties and construction of test problems," Evol.
Comput., vol. 7, no. 3, pp. 205-230, 1999.
[50] H. Ishibuchi, Y. Setoguchi, H. Masuda, and Y.
Nojima, "Performance of decomposition-based manyobjective algorithms strongly depends on Pareto front
shapes," IEEE Trans. Evol. Comput., vol. 21, no. 2, pp.
169-190, 2017.
[51] J. Brankea, M. Stein, K. Deb, and H. Schmeck,
"Portfolio optimization with an envelope-based multiobjective evolutionary algorithm," Eur. J. Oper. Res., vol.
199, no. 3, pp. 684-693, 2009.
[52] X. Zhang, F. Duan, L. Zhang, F. Cheng, Y. Jin, and
K. Tang, "Pattern recommendation in task-oriented applications: A multi-objective perspective [application
notes]," IEEE Comput. Intell. Mag., vol. 12, no. 3, pp.
43-53, 2017.
[53] G. Rudolph, H. Trautmann, S. Sengupta, and O.
Schütze, "Evenly spaced Pareto front approximations for
tricriteria problems based on triangulation," in Proc. 7th
Int. Conf. Evolutionary Multi-Criterion Optimization, 2013,
vol. 7811, pp. 443-458.
[54] C. Dominguez-Medina, G. Rudolph, O. Schutze, and
H. Trautmann, "Evenly spaced Pareto fronts of quad-objective problems using PSA partitioning technique," in Proc.
2013 IEEE Congr. Evolutionary Computation, pp. 3190-3197.
[55] H. Trautmann, G. Rudolph, C. Dominguez-Medina, and O. Schütze, "Finding evenly spaced Pareto
fronts for three-objective optimization problems," in
EVOLVE - A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation II. Advances in Intelligent Systems and Computing, pp. 89-105, vol. 175, 2013.

Are You Moving?
Don't miss an issue of this magazine-
update your contact information now!
Update your information by:
E-MAIL: address-change@ieee.org
PHONE: +1 800 678 4333 in the United States
or +1 732 981 0060 outside
the United States
If you require additional assistance
regarding your IEEE mailings,
visit the IEEE Support Center
at supportcenter.ieee.org.
IEEE publication labels are printed six to eight weeks
in advance of the shipment date, so please allow sufficient
time for your publications to arrive at your new address.

© ISTOCKPHOTO.COM/BRIANAJACKSON

74

IEEE COMPUTATIONAL INTELLIGENCE MAGAZINE | AUGUST 2019
http://supportcenter.ieee.org http://www.ISTOCKPHOTO.COM/BRIANAJACKSON
IEEE Computational Intelligence Magazine - August 2019

Table of Contents for the Digital Edition of IEEE Computational Intelligence Magazine - August 2019
