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算法求得不完全无向图中各节点间的最短路径和最短路径长度，然后设计了捕食搜索算法对模型进行求解。
Compute shortest paths with matrix multiplication and the Floyd-Warshall algorithm for the following graph.
计算最短路径与矩阵乘法和弗洛伊德·沃肖尔算法对以下图。
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.
为了求解上述模型，首先将模型进行清晰化处理，使之转化为一类确定性多设施车辆路径模型，然后设计了嵌入FLOYD算法的捕食搜索算法对之进行求解。
应用推荐