本文提出了一种基于分布估计的离散粒子群优化算法。
This paper will give a scheme of intelligent test paper based on the estimation of distribution of discrete particle swarm algorithm.
提出了一种求解置换流水车间调度问题的离散粒子群优化算法。
Solving Rectangular Packing Problem Based on Discrete Particle Swarm Optimization Algorithm;
提出了一种基于离散粒子群优化算法求解矩形件排样问题的方法。
A discrete particle swarm algorithm for the rectangular strip packing problem is presented.
文中提出了一种基于改进离散粒子群优化算法求解机组组合问题的新方法。
A solution to unit commitment via an enhanced binary particle swarm optimization (BPSO) algorithm is presented.
在求解冷负荷启动中的配电网馈线供电恢复问题时引入了离散粒子群优化算法并对该算法进行了改进。
Here, discrete particle swam optimization algorithm is introduced to solve the problem of optimal restoration of distribution feeders during cold load pickup.
郭文忠，陈国龙。离散粒子群优化算法及其应用[M]。北京：清华大学出版社，2012：5 - 6。
GUO w, CHEN G. Discrete particle swarm optimization algorithm and its application [m]. Beijing: Tsinghua University Press, 2012:5-6.
粒子群算法在求解连续函数优化问题中取得了广泛的应用，但是其在离散的组合优化问题中的运用还比较少。
Particle swarm optimization is widely used to solve continuous function optimization issue, but its application in discrete combination optimization problems is still relatively few.
采用二分策略，通过最大化模块密度，提出了基于离散量子粒子群优化进行复杂网络社区检测的算法。
With bi-partitioning strategy, by maximizing the module density, an algorithm is proposed based on discrete quantum particle swarm optimization for complex network community detection.
分析量子计算的特点，对量子旋转门进行研究，给出了新的量子旋转门调整策略，并与离散二进制粒子群优化算法进行组合，提出了二进制量子粒子群优化算法。
According to the analysis of the characteristics of quantum computing and the research of quantum rotation gate, a new quantum rotation gate adjustment strategy was introduced.
根据限流措施优化配置问题的特点，提出先对候选可开断支路采用枚举法求解支路开断的优化方案，再采用改进离散粒子群算法(MDPSO)求解综合限流方案。
An enumeration method was used to get the optimal splitting of the candidate branches. A modified discrete particle swarm optimization algorithm (MDPSO) was used to get the final strategy.
同时，针对整数资源分配这类组合优化问题，提出了相应的离散粒子群算法。
At the same time, a corresponding particle swarm optimization algorithm is presented to solve the optimization problem of integer resource allocation. This algorithm is easy to programming.
同时，针对整数资源分配这类组合优化问题，提出了相应的离散粒子群算法。
At the same time, a corresponding particle swarm optimization algorithm is presented to solve the optimization problem of integer resource allocation. This algorithm is easy to programming.
应用推荐