电子学报Issue(3)：561-571,11.DOI:10.3969/j.issn.0372-2112.2014.03.021
求解排列问题的分布估计离散粒子群优化算法
Estimation of Distribution-Discrete Particle Swarm Optimization Algorithm for Permutation-Based Problems
摘要
Abstract
Particle swarm optimization algorithm (PSO) and estimation of distribution algorithm (EDA) are seldom applied to permutation-based combinatorial optimization problems .This paper presents an estimation of distribution-discrete particle swarm optimization algorithm (ED-DPSO ) for the permutation-based problems .In ED-DPSO ,one part of components of the offspring comes from the longest common subsequence between the current solution and the global best solution ,and the other part comes from the probability model built on the distribution information of all personal best solutions .In ED-DPSO ,the current solution ,all personal best solutions and global best solution contribute to the generation of a new solution .Thus ,ED-PSO has more comprehen-sive learning ability ,and can avoid falling into local minima and improve the search ability .Experiment results on two classic per-mutation-based problems show ED-PSO has superior performance .关键词
离散粒子群优化/分布估计算法/排列问题Key words
discrete particle swarm optimization/estimation of distribution algorithm/permutation-based problems分类
信息技术与安全科学引用本文复制引用
周雅兰,王甲海,黄聪..求解排列问题的分布估计离散粒子群优化算法[J].电子学报,2014,(3):561-571,11.基金项目
国家自然科学基金（No ．60905038，No ．60805026，No ．61070076）；广东市珠江科技新星专项（No ．2011 J2200093，No ．2012 J2200085）；广东商学院科研创新团队建设计划 （）
