The Evolutionary Algorithm to Find Robust Pareto-Optimal Solutions over TimeReportar como inadecuado




The Evolutionary Algorithm to Find Robust Pareto-Optimal Solutions over Time - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Mathematical Problems in Engineering - Volume 2015 2015, Article ID 814210, 18 pages -

Research Article

School of Information and Electrical Engineering, China University of Mining and Technology, Xuzhou 221116, China

Science College, China University of Mining and Technology, Xuzhou 221116, China

Received 7 March 2014; Revised 28 May 2014; Accepted 17 August 2014

Academic Editor: Yun Li

Copyright © 2015 Meirong Chen et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

In dynamic multiobjective optimization problems, the environmental parameters change over time, which makes the true pareto fronts shifted. So far, most works of research on dynamic multiobjective optimization methods have concentrated on detecting the changed environment and triggering the population based optimization methods so as to track the moving pareto fronts over time. Yet, in many real-world applications, it is not necessary to find the optimal nondominant solutions in each dynamic environment. To solve this weakness, a novel method called robust pareto-optimal solution over time is proposed. It is in fact to replace the optimal pareto front at each time-varying moment with the series of robust pareto-optimal solutions. This means that each robust solution can fit for more than one time-varying moment. Two metrics, including the average survival time and average robust generational distance, are present to measure the robustness of the robust pareto solution set. Another contribution is to construct the algorithm framework searching for robust pareto-optimal solutions over time based on the survival time. Experimental results indicate that this definition is a more practical and time-saving method of addressing dynamic multiobjective optimization problems changing over time.





Autor: Meirong Chen, Yinan Guo, Haiyuan Liu, and Chun Wang

Fuente: https://www.hindawi.com/



DESCARGAR PDF




Documentos relacionados