用于分布估计算法的双随机矩阵模型
Doubly Stochastic Matrix Models for Estimation of Distribution Algorithms
AI总结:
本文探索使用双随机矩阵(DSM)作为概率模型,结合分布估计算法框架,解决组合优化中的匹配与分配类排列问题,初步实验证明其具有竞争力。
摘要:
解由排列表示的问题在组合优化中非常突出。因此,近几十年来,人们提出了许多进化算法来解决这些问题,其中基于概率模型的算法备受关注。在这个意义上,大多数努力集中在引入适合解决排序/排名性质问题的算法。然而,当提出基于概率的分配问题进化算法时,相关工作仅限于提出简单的且在多数情况下是单变量的模型。在本文中,我们探索使用双随机矩阵(DSM)来优化匹配和分配性质的排列问题。为此,我们探索了一些学习和采样方法,以将DSM有效地纳入进化算法的框架中。具体来说,我们采用了分布估计算法框架,并将DSM与现有的排列问题方法进行了比较。在二次分配问题实例上进行的初步实验验证了这一研究方向,并表明DSM可以获得非常有竞争力的结果,而计算成本问题仍需进一步研究。
英文摘要:
Problems with solutions represented by permutations are very prominent in combinatorial optimization. Thus, in recent decades, a number of evolutionary algorithms have been proposed to solve them, and among them, those based on probability models have received much attention. In that sense, most efforts have focused on introducing algorithms that are suited for solving ordering/ranking nature problems. However, when it comes to proposing probability-based evolutionary algorithms for assignment problems, the works have not gone beyond proposing simple and in most cases univariate models. In this paper, we explore the use of Doubly Stochastic Matrices (DSM) for optimizing matching and assignment nature permutation problems. To that end, we explore some learning and sampling methods to efficiently incorporate DSMs within the picture of evolutionary algorithms. Specifically, we adopt the framework of estimation of distribution algorithms and compare DSMs to some existing proposals for permutation problems. Conducted preliminary experiments on instances of the quadratic assignment problem validate this line of research and show that DSMs may obtain very competitive results, while computational cost issues still need to be further investigated.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。