MOEA/D-AMS: Improving MOEA/D by an adaptive mating selection mechanism

Tsung Che Chiang, Yung Pin Lai

研究成果: 書貢獻/報告類型會議貢獻

34 引文 (Scopus)

摘要

In this paper we propose a multiobjective evolutionary algorithm based on MOEA/D [1] for solving multiobjective optimization problems. MOEA/D decomposes a multiobjective optimization problem into many single-objective subproblems. The objective of each subproblem is a weighted aggregation of the original objectives. Using evenly distributed weight vectors on subproblems, solutions to subproblems form a set of well-spread approximated Pareto optimal solutions to the original problem. In MOEA/D, each individual in the population represents the current best solution to one subproblem. Mating selection is carried out in a uniform and static manner. Each individual/subproblem is selected/solved once at each generation, and the mating pool of each individual is determined and fixed based on the distance between weight vectors on the objective space. We propose an adaptive mating selection mechanism for MOEA/D. It classifies subproblems into solved ones and unsolved ones and selects only individuals of unsolved subproblems. Besides, it dynamically adjusts the mating pools of individuals according to their distance on the decision space. The proposed algorithm, MOEA/D-AMS, is compared with two versions of MOEA/D using nine continuous functions. The experimental results confirm the benefits of the adaptive mating selection mechanism.

原文英語
主出版物標題2011 IEEE Congress of Evolutionary Computation, CEC 2011
頁面1473-1480
頁數8
DOIs
出版狀態已發佈 - 2011 八月 29
事件2011 IEEE Congress of Evolutionary Computation, CEC 2011 - New Orleans, LA, 美国
持續時間: 2011 六月 52011 六月 8

出版系列

名字2011 IEEE Congress of Evolutionary Computation, CEC 2011

其他

其他2011 IEEE Congress of Evolutionary Computation, CEC 2011
國家美国
城市New Orleans, LA
期間11/6/511/6/8

指紋

Multiobjective optimization
Multiobjective Optimization Problems
Evolutionary algorithms
Agglomeration
Pareto Optimal Solution
Multi-objective Evolutionary Algorithm
Aggregation
Continuous Function
Classify
Decompose
Experimental Results

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Theoretical Computer Science

引用此文

Chiang, T. C., & Lai, Y. P. (2011). MOEA/D-AMS: Improving MOEA/D by an adaptive mating selection mechanism. 於 2011 IEEE Congress of Evolutionary Computation, CEC 2011 (頁 1473-1480). [5949789] (2011 IEEE Congress of Evolutionary Computation, CEC 2011). https://doi.org/10.1109/CEC.2011.5949789

MOEA/D-AMS : Improving MOEA/D by an adaptive mating selection mechanism. / Chiang, Tsung Che; Lai, Yung Pin.

2011 IEEE Congress of Evolutionary Computation, CEC 2011. 2011. p. 1473-1480 5949789 (2011 IEEE Congress of Evolutionary Computation, CEC 2011).

研究成果: 書貢獻/報告類型會議貢獻

Chiang, TC & Lai, YP 2011, MOEA/D-AMS: Improving MOEA/D by an adaptive mating selection mechanism. 於 2011 IEEE Congress of Evolutionary Computation, CEC 2011., 5949789, 2011 IEEE Congress of Evolutionary Computation, CEC 2011, 頁 1473-1480, 2011 IEEE Congress of Evolutionary Computation, CEC 2011, New Orleans, LA, 美国, 11/6/5. https://doi.org/10.1109/CEC.2011.5949789
Chiang TC, Lai YP. MOEA/D-AMS: Improving MOEA/D by an adaptive mating selection mechanism. 於 2011 IEEE Congress of Evolutionary Computation, CEC 2011. 2011. p. 1473-1480. 5949789. (2011 IEEE Congress of Evolutionary Computation, CEC 2011). https://doi.org/10.1109/CEC.2011.5949789
Chiang, Tsung Che ; Lai, Yung Pin. / MOEA/D-AMS : Improving MOEA/D by an adaptive mating selection mechanism. 2011 IEEE Congress of Evolutionary Computation, CEC 2011. 2011. 頁 1473-1480 (2011 IEEE Congress of Evolutionary Computation, CEC 2011).
@inproceedings{ee3a3b484c10488dae4a99026d873fe3,
title = "MOEA/D-AMS: Improving MOEA/D by an adaptive mating selection mechanism",
abstract = "In this paper we propose a multiobjective evolutionary algorithm based on MOEA/D [1] for solving multiobjective optimization problems. MOEA/D decomposes a multiobjective optimization problem into many single-objective subproblems. The objective of each subproblem is a weighted aggregation of the original objectives. Using evenly distributed weight vectors on subproblems, solutions to subproblems form a set of well-spread approximated Pareto optimal solutions to the original problem. In MOEA/D, each individual in the population represents the current best solution to one subproblem. Mating selection is carried out in a uniform and static manner. Each individual/subproblem is selected/solved once at each generation, and the mating pool of each individual is determined and fixed based on the distance between weight vectors on the objective space. We propose an adaptive mating selection mechanism for MOEA/D. It classifies subproblems into solved ones and unsolved ones and selects only individuals of unsolved subproblems. Besides, it dynamically adjusts the mating pools of individuals according to their distance on the decision space. The proposed algorithm, MOEA/D-AMS, is compared with two versions of MOEA/D using nine continuous functions. The experimental results confirm the benefits of the adaptive mating selection mechanism.",
keywords = "evolutionary algorithm, mating pool, mating selection, multiobjective optimization, scalarization, subproblem",
author = "Chiang, {Tsung Che} and Lai, {Yung Pin}",
year = "2011",
month = "8",
day = "29",
doi = "10.1109/CEC.2011.5949789",
language = "English",
isbn = "9781424478347",
series = "2011 IEEE Congress of Evolutionary Computation, CEC 2011",
pages = "1473--1480",
booktitle = "2011 IEEE Congress of Evolutionary Computation, CEC 2011",

}

TY - GEN

T1 - MOEA/D-AMS

T2 - Improving MOEA/D by an adaptive mating selection mechanism

AU - Chiang, Tsung Che

AU - Lai, Yung Pin

PY - 2011/8/29

Y1 - 2011/8/29

N2 - In this paper we propose a multiobjective evolutionary algorithm based on MOEA/D [1] for solving multiobjective optimization problems. MOEA/D decomposes a multiobjective optimization problem into many single-objective subproblems. The objective of each subproblem is a weighted aggregation of the original objectives. Using evenly distributed weight vectors on subproblems, solutions to subproblems form a set of well-spread approximated Pareto optimal solutions to the original problem. In MOEA/D, each individual in the population represents the current best solution to one subproblem. Mating selection is carried out in a uniform and static manner. Each individual/subproblem is selected/solved once at each generation, and the mating pool of each individual is determined and fixed based on the distance between weight vectors on the objective space. We propose an adaptive mating selection mechanism for MOEA/D. It classifies subproblems into solved ones and unsolved ones and selects only individuals of unsolved subproblems. Besides, it dynamically adjusts the mating pools of individuals according to their distance on the decision space. The proposed algorithm, MOEA/D-AMS, is compared with two versions of MOEA/D using nine continuous functions. The experimental results confirm the benefits of the adaptive mating selection mechanism.

AB - In this paper we propose a multiobjective evolutionary algorithm based on MOEA/D [1] for solving multiobjective optimization problems. MOEA/D decomposes a multiobjective optimization problem into many single-objective subproblems. The objective of each subproblem is a weighted aggregation of the original objectives. Using evenly distributed weight vectors on subproblems, solutions to subproblems form a set of well-spread approximated Pareto optimal solutions to the original problem. In MOEA/D, each individual in the population represents the current best solution to one subproblem. Mating selection is carried out in a uniform and static manner. Each individual/subproblem is selected/solved once at each generation, and the mating pool of each individual is determined and fixed based on the distance between weight vectors on the objective space. We propose an adaptive mating selection mechanism for MOEA/D. It classifies subproblems into solved ones and unsolved ones and selects only individuals of unsolved subproblems. Besides, it dynamically adjusts the mating pools of individuals according to their distance on the decision space. The proposed algorithm, MOEA/D-AMS, is compared with two versions of MOEA/D using nine continuous functions. The experimental results confirm the benefits of the adaptive mating selection mechanism.

KW - evolutionary algorithm

KW - mating pool

KW - mating selection

KW - multiobjective optimization

KW - scalarization

KW - subproblem

UR - http://www.scopus.com/inward/record.url?scp=80051992344&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80051992344&partnerID=8YFLogxK

U2 - 10.1109/CEC.2011.5949789

DO - 10.1109/CEC.2011.5949789

M3 - Conference contribution

AN - SCOPUS:80051992344

SN - 9781424478347

T3 - 2011 IEEE Congress of Evolutionary Computation, CEC 2011

SP - 1473

EP - 1480

BT - 2011 IEEE Congress of Evolutionary Computation, CEC 2011

ER -