A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
MOEA/D-GM: Using probabilistic graphical models in MOEA/D for solving combinatorial optimization problems
[article]
2015
arXiv
pre-print
Evolutionary algorithms based on modeling the statistical dependencies (interactions) between the variables have been proposed to solve a wide range of complex problems. These algorithms learn and sample probabilistic graphical models able to encode and exploit the regularities of the problem. This paper investigates the effect of using probabilistic modeling techniques as a way to enhance the behavior of MOEA/D framework. MOEA/D is a decomposition based evolutionary algorithm that decomposes a
arXiv:1511.05625v1
fatcat:sw42k3v6g5artkrwfxdnxyywwu