arrow
Return

A Multi-objective optimization algorithm based on dynamic user-preference information

delete2021-08-25
delete2
PRE
AI
于
于洪 (Hong Yu) *
Z
Zhao Fu
G
Guoyin Wang
Y
Yongfang Xie
李鲒 cover
李鲒 (Jie Li)
DOI:10.1007/s00607-021-00995-xdelete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
In real life, some complex problems are multi-objective optimization problems. Most of the existing studies have focused on how to obtain the optimal solutions distributed on the whole Pareto-optimal frontier. However, in some fields such as industrial production, the decision-makers of enterprises usually care about what specific measures can maximize the comprehensive benefits of enterprises. Due to this kind of realistic demands, we prefer to find a small part of the optimal solutions according to the preference information suggested by the decision-makers rather than obtain all of the Pareto-optimal solutions. However, almost all of the existing methods only repeat calculation when they meet the scenario where the user-preferences change over time. To address the multi-objective optimization problem under the scenario with dynamic user-preferences information, we propose a MOEA/D-DPRE (multi-objective optimization algorithm based on dynamic preference information) algorithm in this paper, and its framework is inspired by the MOEA/D-PRE (decomposition user-preference multi-objective evolutionary) algorithm. We analyze the four position relations between the distribution region of the old preference weight vectors (old preference region), and we also present the distribution region of the new preference weight vectors (new preference region) and propose the different strategy to the different case respectively. When the preference information changes, the MOEA/D-DPRE can converge to the region of new interest by responding to the change of preference and the historical information. Experimental results show that the proposed method is better than the compared method in convergence speed and distribution under the scenario with dynamic user-preferences information.
Keywords:
Dynamic
Preference Information
Multi-objective Optimization
Pareto Optimality
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

C
Computing
IF:
2.8
Papers:
2.3K
Citations:
3.5K

Organization

C
Central South University
Scholars:
10.0W
Papers: 7.2W
Citations: 10.9W
C
chongqing university of posts & telecommunications
Scholars:
6.7K
Papers: 5.3K
Citations: 5
Cited Papers

Cited Papers

Light-Nuclei Spectra from Chiral Dynamics
err2018-02-01
err0
errOAAI
errM. Piarulli; A. Baroni; L. Girlanda; A. Kievsky; A. Lovato; Ewing Lusk; L. E. Marcucci; Steven C. Pieper; R. Schiavilla; M. Viviani; R. B. Wiringa
errShare
errSave
Automatic selection of a single solution from the Pareto front to identify key players in social networks
err2018-11-01
err20
PREAI
errde la Fuente, Dimas; Vega-Rodriguez, Miguel A.; Perez, Carlos J.
errShare
errSave
Decomposing the user-preference in multiobjective optimization
err2015-07-02
err55
PREAI
errYu, Guo; Zheng, Jinhua; Shen, Ruimin; Li, Miqing
errShare
errSave
An r-dominance-based preference multi-objective optimization for many-objective optimization
err2016-03-10
err11
PREAI
errLiu, Ruochen; Song, Xiaolin; Fang, Lingfen; Jiao, Licheng
errShare
errSave
Modulation Dynamics in the Orofacial Sensorimotor Cortex during Motor Skill Acquisition
err2014-04-23
err0
errOAAI
errFritzie I. Arce-McShane; Nicholas G. Hatsopoulos; Jye-Chang Lee; Callum F. Ross; Barry J. Sessle
errShare
errSave
researcher View more