Dynamic multiobjective optimization algorithm based on average distance linear prediction model

12Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Many real-world optimization problems involve objectives, constraints, and parameters which constantly change with time. Optimization in a changing environment is a challenging task, especially when multiple objectives are required to be optimized simultaneously. Nowadays the common way to solve dynamic multiobjective optimization problems (DMOPs) is to utilize history information to guide future search, but there is no common successful method to solve different DMOPs. In this paper, we define a kind of dynamic multiobjectives problem with translational Paretooptimal set (DMOP-TPS) and propose a new prediction model named ADLM for solving DMOP-TPS. We have tested and compared the proposed prediction model (ADLM) with three traditional prediction models on several classic DMOP-TPS test problems. The simulation results show that our proposed prediction model outperforms other prediction models for DMOP-TPS. © 2014 Zhiyong Li et al.

Cite

CITATION STYLE

APA

Li, Z., Chen, H., Xie, Z., Chen, C., & Sallam, A. (2014). Dynamic multiobjective optimization algorithm based on average distance linear prediction model. The Scientific World Journal, 2014. https://doi.org/10.1155/2014/389742

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free