Adaptive Memory Programming for Improving MOEA/D
碩士 === 國立暨南國際大學 === 資訊管理學系 === 100 === MOEA/D is an emerging method for tackling multi-objective optimization problem (MOOP). Using the concept of decomposition, MOEA/D improves the multi-objective evolutionary algorithm (MOEA) by decomposing an MOOP into a number of single-objective sub-problems. M...
Main Authors: | Chen, Bo-Yu, 陳柏諭 |
---|---|
Other Authors: | Yin, Peng-Yeng |
Format: | Others |
Language: | zh-TW |
Published: |
2012
|
Online Access: | http://ndltd.ncl.edu.tw/handle/28211052051577310729 |
Similar Items
-
On the Parallelization of MOEA/D
by: Liao, You Cheng, et al.
Published: (2012) -
An Improved MOEA/D Algorithm for Complex Data Analysis
by: Weihua Qian, et al.
Published: (2021-01-01) -
Research on the Innovation Process and Result of the MOEA Academia Technology Development Program
by: CHEN, YU-RONG, et al.
Published: (2018) -
MOEA/D with adaptive local search for multiobjective permutation flowshop scheduling problems
by: Chang, Yu-Teng, et al.
Published: (2017) -
An Improved MOEA/D for QoS Oriented Multimedia Multicasting with Network Coding
by: Zhaoyuan Wang, et al.
Published: (2015-08-01)