Solving Rectangular Packing Problem Based on Discrete Particle Swarm Optimization Algorithm;
提出了一种求解置换流水车间调度问题的离散粒子群优化算法。
GUO w, CHEN G. Discrete particle swarm optimization algorithm and its application [m]. Beijing: Tsinghua University Press, 2012:5-6.
郭文忠，陈国龙。离散粒子群优化算法及其应用[M]。北京：清华大学出版社，2012：5 - 6。
A pheromone-based discrete particle swarm optimization algorithm was proposed borrowing the idea of pheromone refresh mechanism of ant colony algorithm.
借鉴蚁群算法的信息素机制，提出了一种基于信息素机制的离散粒子群算法。
In this paper, a new routing approach based on discrete particle swarm optimization algorithm is briefly discussed to obtain the optimum path between two nodes in the network.
针对不同的网络实际条件，提出一种改进的离散粒子群算法来寻找网络中任意两个节点间的最优路由。
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.
根据限流措施优化配置问题的特点，提出先对候选可开断支路采用枚举法求解支路开断的优化方案，再采用改进离散粒子群算法(MDPSO)求解综合限流方案。
A discrete Particle Swarm Optimization (PSO) algorithm was presented for Job Shop scheduling problem.
提出了用于解决作业车间调度问题的离散版粒子群算法。
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.
采用二分策略，通过最大化模块密度，提出了基于离散量子粒子群优化进行复杂网络社区检测的算法。
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.
采用二分策略，通过最大化模块密度，提出了基于离散量子粒子群优化进行复杂网络社区检测的算法。
应用推荐