A Framework Based on Historical Evolution Learning for Dynamic Multiobjective Optimization
Authors: 
Kunjie Yu, Dezheng Zhang, Jing Liang, Boyang Qu, Mengnan Liu, Ke Chen, Caitong Yue, Ling WangAuthors Info & Claims
Pages 1127 - 1140
Abstract
Dynamic multiobjective optimization problems (DMOPs) are widely encountered in real-world applications and have received considerable attention in recent years. During the process of solving DMOPs, tracking the constantly changing Pareto optimal set (POS) quickly is the main task, and numerous methods have been proposed to achieve this task from different perspectives. However, how to improve the evolution of static optimizers via using historical information from past environments gets little attention. In fact, with adequate historical evolution information to learn, the trend of population evolution in the historical environments is promising to guide the future evolution and thus enhance the search ability. Therefore, in this article, a historical evolution learning-based framework is proposed to assist the static optimizers in fully using the historical evolution direction and POSs distribution. Specifically, two new models are designed with a purpose of generating offsprings and environmental selection, respectively. For enhancing the contribution of offsprings, a direction guidance model is developed to guide the offsprings according to the direction tendency of historical evolution. Furthermore, to improve the robustness of static optimizers and avoid the disturbance caused by misleading solutions, a manifold revise model is proposed to produce promising solutions via consulting historical POSs distribution. The proposed framework employs these two models collaboratively, and it is flexible and readily to be embedded into various dynamic response mechanisms and static optimizers in coping with DMOPs. The superiority of the framework has been comprehensively demonstrated by experimental comparison results on a variety of benchmark test problems.
References
[1]
A. Muruganantham, K. C. Tan, and P. Vadakkepat, “Evolutionary dynamic multiobjective optimization via Kalman filter prediction,” IEEE Trans. Cybern., vol. 46, no. 12, pp. 2862–2873, Dec. 2015.
[2]
D. Gong, B. Xu, Y. Zhang, Y. Guo, and S. Yang, “A similarity-based cooperative co-evolutionary algorithm for dynamic interval multiobjective optimization problems,” IEEE Trans. Evol. Comput., vol. 24, no. 1, pp. 142–156, Feb. 2020.
[3]
L. Chang, S. Piao, X. Leng, Y. Hu, and W. Ke, “Study on falling backward of humanoid robot based on dynamic multi objective optimization,” Peer-to-Peer Netw. Appl., vol. 13, no. 4, pp. 1236–1247, 2020.
[4]
Y.-N. Guo, J. Cheng, S. Luo, D. Gong, and Y. Xue, “Robust dynamic multi-objective vehicle routing optimization method,” IEEE/ACM Trans. Comput. Biol. Bioinf., vol. 15, no. 6, pp. 1891–1903, Nov./Dec. 2018.
[5]
Y. Hu, J. Zheng, J. Zou, S. Jiang, and S. Yang, “Dynamic multi-objective optimization algorithm based decomposition and preference,” Inf. Sci., vol. 571, pp. 175–190, Sep. 2021.
[6]
F. Wang, Y. Li, F. Liao, and H. Yan, “An ensemble learning based prediction strategy for dynamic multi-objective optimization,” Appl. Soft Comput., vol. 96, Nov. 2020, Art. no.
[7]
J. Liang, K. Qiao, K. Yu, B. Qu, C. Yue, and W. Guo, “Utilizing the relationship between unconstrained and constrained Pareto fronts for constrained multiobjective optimization,” IEEE Trans. Cybern., vol. 53, no. 6, pp. 3873–3886, Jun. 2023.
[8]
J. Lianget al., “A survey on evolutionary constrained multi-objective optimization,” IEEE Trans. Evol. Comput., vol. 27, no. 2, pp. 201–221, Apr. 2023.
[9]
D. Xu, M. Jiang, W. Hu, S. Li, R. Pan, and G. G. Yen, “An online prediction approach based on incremental support vector machine for dynamic multiobjective optimization,” IEEE Trans. Evol. Comput., vol. 26, no. 4, pp. 690–703, Aug. 2022.
[10]
S. Jiang, J. Zou, S. Yang, and X. Yao, “Evolutionary dynamic multi-objective optimisation: A survey,” ACM Comput. Surveys, vol. 55, no. 4, pp. 1–47, 2022.
[11]
A. Zhou, Y. Jin, and Q. Zhang, “A population prediction strategy for evolutionary dynamic multiobjective optimization,” IEEE Trans. Cybern., vol. 44, no. 1, pp. 40–53, Jan. 2014.
[12]
L. Feng, W. Zhou, W. Liu, Y.-S. Ong, and K. C. Tan, “Solving dynamic multiobjective problem via autoencoding evolutionary search,” IEEE Trans. Cybern., vol. 52, no. 5, pp. 2649–2662, May 2022.
[13]
K. Yuet al., “A correlation-guided layered prediction approach for evolutionary dynamic multiobjective optimization,” IEEE Trans. Evol. Comput., early access, Jul. 22, 2022. 10.1109/TEVC.2022.3193287.
[14]
K. Deb, N. U. B. Rao, and S. Karthik, “Dynamic multi-objective optimization and decision-making using modified NSGA-II: A case study on hydro-thermal power scheduling,” in Proc. Int. Conf. Evol. Multi-Criterion Optim., 2007, pp. 803–817.
[15]
H. G. Cobb, “An investigation into the use of hypermutation as an adaptive operator in genetic algorithms having continuous, time-dependent nonstationary environments,” Naval Res. Lab, Washington, DC, USA, Rep. 6760, 1990.
[16]
Z. Peng, J. Zheng, and J. Zou, “A population diversity maintaining strategy based on dynamic environment evolutionary model for dynamic multiobjective optimization,” in Proc. IEEE Congr. Evol. Comput. (CEC), 2014, pp. 274–281.
[17]
K. Zhang, C. Shen, X. Liu, and G. G. Yen, “Multiobjective evolution strategy for dynamic multiobjective optimization,” IEEE Trans. Evol. Comput., vol. 24, no. 5, pp. 974–988, Oct. 2020.
[18]
S. Jiang and S. Yang, “A steady-state and generational evolutionary algorithm for dynamic multiobjective optimization,” IEEE Trans. Evol. Comput., vol. 21, no. 1, pp. 65–82, Feb. 2017.
[19]
Y. Wang and B. Li, “Investigation of memory-based multi-objective optimization evolutionary algorithm in dynamic environment,” in Proc. IEEE Congr. Evol. Comput., 2009, pp. 630–637.
[20]
Z. Liang, S. Zheng, Z. Zhu, and S. Yang, “Hybrid of memory and prediction strategies for dynamic multiobjective optimization,” Inf. Sci., vol. 485, pp. 200–218, Jun. 2019.
[21]
Y. Hu, J. Zheng, J. Zou, S. Yang, J. Ou, and R. Wang, “A dynamic multi-objective evolutionary algorithm based on intensity of environmental change,” Inf. Sci., vol. 523, pp. 49–62, Jun. 2020.
[22]
Y. Ye, L. Li, Q. Lin, K.-C. Wong, J. Li, and Z. Ming, “Knowledge guided Bayesian classification for dynamic multi-objective optimization,” Knowl.-Based Syst., vol. 250, Aug. 2022, Art. no.
[23]
M. Rong, D. Gong, Y. Zhang, Y. Jin, and W. Pedrycz, “Multidirectional prediction approach for dynamic multiobjective optimization problems,” IEEE Trans. Cybern., vol. 49, no. 9, pp. 3362–3374, Sep. 2019.
[24]
H. Zhang, J. Ding, M. Jiang, K. C. Tan, and T. Chai, “Inverse Gaussian process modeling for evolutionary dynamic multiobjective optimization,” IEEE Trans. Cybern., vol. 52, no. 10, pp. 11240–11253, Oct. 2022.
[25]
R. Rambabu, P. Vadakkepat, K. C. Tan, and M. Jiang, “A mixture-of-experts prediction framework for evolutionary dynamic multiobjective optimization,” IEEE Trans. Cybern., vol. 50, no. 12, pp. 5099–5112, Dec. 2020.
[26]
Y. Hu, J. Zheng, S. Jiang, S. Yang, and J. Zou, “Handling dynamic multiobjective optimization environments via layered prediction and subspace-based diversity maintenance,” IEEE Trans. Cybern., vol. 53, no. 4, pp. 2572–2585, Apr. 2023. 10.1109/TCYB.2021.3128584.
[27]
M. Jiang, Z. Huang, L. Qiu, W. Huang, and G. G. Yen, “Transfer learning-based dynamic multiobjective optimization algorithms,” IEEE Trans. Evol. Comput., vol. 22, no. 4, pp. 501–514, Aug. 2018.
[28]
M. Jiang, Z. Wang, H. Hong, and G. G. Yen, “Knee point-based imbalanced transfer learning for dynamic multiobjective optimization,” IEEE Trans. Evol. Comput., vol. 25, no. 1, pp. 117–129, Feb. 2021.
[29]
J. Li, T. Sun, Q. Lin, M. Jiang, and K. C. Tan, “Reducing negative transfer learning via clustering for dynamic multiobjective optimization,” IEEE Trans. Evol. Comput., vol. 26, no. 5, pp. 1102–1116, Oct. 2022.
[30]
K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, “A fast and elitist multiobjective genetic algorithm: NSGA-II,” IEEE Trans. Evol. Comput., vol. 6, no. 2, pp. 182–197, Apr. 2002.
[31]
Q. Zhao, B. Yan, Y. Shi, and M. Middendorf, “Evolutionary dynamic multiobjective optimization via learning from historical search process,” IEEE Trans. Cybern., vol. 52, no. 7, pp. 6119–6130, Jul. 2022.
[32]
Q. Zhang, A. Zhou, and Y. Jin, “RM-MEDA: A regularity model-based multiobjective estimation of distribution algorithm,” IEEE Trans. Evol. Comput., vol. 12, no. 1, pp. 41–63, Feb. 2008.
[33]
Q. Zhang and H. Li, “MOEA/D: A multiobjective evolutionary algorithm based on decomposition,” IEEE Trans. Evol. Comput., vol. 11, no. 6, pp. 712–731, Dec. 2007.
[34]
S. Jiang, S. Yang, X. Yao, K. C. Tan, M. Kaiser, and N. Krasnogor, “Benchmark functions for the CEC’2018 competition on dynamic multiobjective optimization,” Dept. Comput. Sci., Newcastle Univ., Newcastle upon Tyne, U.K., Rep., 2018.
[35]
M. Farina, K. Deb, and P. Amato, “Dynamic multiobjective optimization problems: Test cases, approximations, and applications,” IEEE Trans. Evol. Comput., vol. 8, no. 5, pp. 425–442, Oct. 2004.
[36]
A. Zhou, Y. Jin, Q. Zhang, B. Sendhoff, and E. Tsang, “Prediction-based population re-initialization for evolutionary dynamic multi-objective optimization,” in Proc. Int. Conf. Evol. Multi-Criterion Optim., 2007, pp. 832–846.
[37]
S. Jiang and S. Yang, “Evolutionary dynamic multiobjective optimization: Benchmarks and algorithm comparisons,” IEEE Trans. Cybern., vol. 47, no. 1, pp. 198–211, Jan. 2017.
[38]
C.-K. Goh and K. C. Tan, “A competitive-cooperative coevolutionary paradigm for dynamic multiobjective optimization,” IEEE Trans. Evol. Comput., vol. 13, no. 1, pp. 103–127, Feb. 2009.
[39]
E. Zitzler, L. Thiele, M. Laumanns, C. M. Fonseca, and V. G. Da Fonseca, “Performance assessment of multiobjective optimizers: An analysis and review,” IEEE Trans. Evol. Comput., vol. 7, no. 2, pp. 117–132, Apr. 2003.
[40]
G. Li, J. Liang, and C. Yue, “Research on the fastest detection method for weak trends under noise interference,” Entropy, vol. 23, no. 8, p. 1093, 2021.
[41]
E. Zitzler and L. Thiele, “Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto approach,” IEEE Trans. Evol. Comput., vol. 3, no. 4, pp. 257–271, Nov. 1999.
[42]
K. Chen, B. Xue, M. Zhang, and F. Zhou, “Correlation-guided updating strategy for feature selection in classification with surrogate-assisted particle swarm optimization,” IEEE Trans. Evol. Comput., vol. 26, no. 5, pp. 1015–1029, Oct. 2022.
[43]
Y. Tian, R. Cheng, X. Zhang, F. Cheng, and Y. Jin, “An indicator-based multiobjective evolutionary algorithm with reference point adaptation for better versatility,” IEEE Trans. Evol. Comput., vol. 22, no. 4, pp. 609–622, Aug. 2018.
[44]
J. Derrac, S. García, D. Molina, and F. Herrera, “A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms,” Swarm Evol. Comput., vol. 1, no. 1, pp. 3–18, 2011.
[45]
J. Demšar, “Statistical comparisons of classifiers over multiple data sets,” J. Mach. Learn. Res., vol. 7, pp. 1–30, Jan. 2006.
[46]
K. Deb and R. B. Agrawal, “Simulated binary crossover for continuous search space,” Complex Syst., vol. 9, no. 2, pp. 115–148, 1995.
[47]
K. Deb and M. Goyal, “A combined genetic adaptive search (GeneAs) for engineering design,” Comput. Sci. Informat., vol. 26, pp. 30–45, Jan. 1996.
Index Terms
- A Framework Based on Historical Evolution Learning for Dynamic Multiobjective Optimization
Index terms have been assigned to the content through auto-classification.
Recommendations
Constrained differential evolution with multiobjective sorting mutation operators for constrained optimization
The proposed constrained differential evolution framework uses nondominated sorting mutation operator based on fitness and diversity information for constrained optimization. This study proposes a new constraint differential evolution framework.Parents ...
A competitive-cooperative coevolutionary paradigm for dynamic multiobjective optimization
Special issue on computational finance and economicsIn addition to the need for satisfying several competing objectives, many real-world applications are also dynamic and require the optimization algorithm to track the changing optimum over time. This paper proposes a new coevolutionary paradigm that ...
MOEA/D with opposition-based learning for multiobjective optimization problem
Multiobjective evolutionary algorithm based on decomposition (MOEA/D) has attracted a great deal of attention and has obtained enormous success in the field of evolutionary multiobjective optimization. It converts a multiobjective optimization problem (...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
1089-778X © 2023 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See https://www.ieee.org/publications/rights/index.html for more information.
Publisher
IEEE Press
Publication History
Published: 28 June 2023
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 12 Dec 2024
Other Metrics
Citations
View Options
View options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in