在优化算法上,采用了二进制粒子群算法来进行配电网重构最优方案的搜索。
Binary Particle Swarm Optimization (BPSO) is applied to solve the problem of distribution network reconfiguration in this paper.
针对0-1 背包问题,提出一种具有修复策略的、贪心算法与二进制粒子群算法相结合的混合智能算法。
The simulation result indicates that the performance of BSPSO on knapsack problem, with a quicker convergence, is superior to the greed and genetic algorithms.
本文提出了用于求解单级多资源约束的生产批量计划问题的改进二进制粒子群算法,阐明了算法的具体实现过程。
In this paper, the improved particle swarm optimization algorithm for the single level capacitated dynamic lot-sizing problem is presented. The detailed realization of the algorithm is illustrated.
针对贷款组合优化决策模型的求解问题,论文提出了用于求解该问题的二进制粒子群算法,并阐明了算法的具体实现过程。
This paper brings forward the binary improved particle swarm optimization algorithm for decision of loans combinatorial optimization problem, and illustrates the detailed realization of the algorithm.
提出了基于改进的二进制粒子群优化算法、以均衡负荷为目标的配电网重构方法。
A method based on improved binary particle swarm optimization (PSO) is proposed for distribution network reconfiguration with the objective of load balancing.
分析量子计算的特点,对量子旋转门进行研究,给出了新的量子旋转门调整策略,并与离散二进制粒子群优化算法进行组合,提出了二进制量子粒子群优化算法。
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.
分析量子计算的特点,对量子旋转门进行研究,给出了新的量子旋转门调整策略,并与离散二进制粒子群优化算法进行组合,提出了二进制量子粒子群优化算法。
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.
应用推荐