PSO can solve a discrete combination optimization such as VRP by using random exchange sequence and PMX operator.
通过引入随机交换序、PMX算子使微粒群优化算法能够求解车辆路径问题这类离散组合优化问题。
A discrete Particle Swarm Optimization (PSO) algorithm was presented for Job Shop scheduling problem.
提出了用于解决作业车间调度问题的离散版粒子群算法。
Using PSO algorithm in paper's generating is a discrete solution problem, which extends PSO algorithm's application.
PSO算法组卷是一个离散性求解问题，这是对P SO算法应用上的一个扩展。
A PSO can solve a discrete combination optimization such as VRP by using random exchange sequence and PMX operator.
通过引入随机交换序、PMX算子使微粒群优化算法能够求解车辆路径问题这类离散组合优化问题。
The new algorithm not only keeps the virtue of PSO but also ADAPTS to solve the discrete problems.
DS _ BPSO算法既保留了P SO的优点，又非常适用于求解离散优化问题。
Based on the PSO, we introduce the inertia factor and construct the discrete position set and the discrete speed set, express the discrete variables accurately.
在基本粒子群算法的基础上，引入了惯性因子，并对离散变量进行了处理，直接构造了离散解值集和离散速度值集。
Based on the PSO, we introduce the inertia factor and construct the discrete position set and the discrete speed set, express the discrete variables accurately.
在基本粒子群算法的基础上，引入了惯性因子，并对离散变量进行了处理，直接构造了离散解值集和离散速度值集。
应用推荐