.png){kind=icon}
返回
The Collaborative Local Search Based on Dynamic-Constrained Decomposition With Grids for Combinatorial Multiobjective Optimization
.png){kind=icon}
PRE
AI
DOI：10.1109/TCYB.2019.2931434.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The decomposition-based algorithms [e.g., multiobjective evolutionary algorithm based on decomposition (MOEA/D)] transform a multiobjective optimization problem (MOP) into a number of single-objective optimization subproblems and solve them in a collaborative manner. It is a natural framework for using single-objective local search (LS) to solve combinatorial MOPs. However, commonly used decomposition methods, such as weighted sum (WS), Tchebycheff (TCH), and penalty-based boundary intersection (PBI) may not be good at maintaining the population diversity while providing diverse initial solutions for different LS procedures in a collaborative way. Based on our previous work on the constrained decomposition with grids (CDG), this article proposes a dynamic CDG (DCDG) framework used to design a multiobjective memetic algorithm (DCDG-MOMA). DCDG uses grids for maintaining diversity, supporting the collaborative LS. In addition, DCDG dynamically increases the number of grids for obtaining more nondominated solutions as well as the better collaborative search among them. DCDG-MOMA has been compared with several classical and state-of-the-art algorithms on multiobjective traveling salesman problem (MOTSP), multiobjective quadratic assignment problem (MOQAP), and multiobjective capacitated arc routing problem (MOCARP).
Keyword:
Collaboration
Optimization
Sociology
Statistics
Heuristic algorithms
Memetics
Cybernetics
Combinatorial multiobjective optimization
constrained decomposition with grids (CDG)
decomposition
Pareto local search (LS)
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.5
论文数:
1.1W
被引数:
5.0W
机构
暂无机构信息
引用论文
.png){kind=icon}
Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
PREAI
分享收藏
分享收藏
查看更多内容