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)求解综合限流方案。
应用推荐