区别于传统捕食搜索算法，新算法采用变化的局部搜索和全局搜索限制，从而避免陷入局部最优和解的退化。
The new PSA USES variable constraints of local search and global search to avo id falling into local optimal solutions and the degeneration of solutions.
为了求解上述模型，首先利用FLOYD算法求得不完全无向图中各节点间的最短路径和最短路径长度，然后设计了捕食搜索算法对模型进行求解。
To solve the model, the shortest path and its length of every two nodes in the incomplete undigraph are calculated with FLOYD algorithm, and a predatory search algorithm is designed for the solution.
为了求解上述模型，首先将模型进行清晰化处理，使之转化为一类确定性多设施车辆路径模型，然后设计了嵌入FLOYD算法的捕食搜索算法对之进行求解。
The model was firstly converted into a crisp multi-depot vehicle routing problem, and then it was solved by a predator search algorithm with FLOYD.
应用推荐