First, the introduction of an auxiliary vector D, which each component of the D [i] found that the current distribution center from the middle of each user i to the length of the shortest path. Its initial state is: if there is a feasible route from i to, then D [r] is the weight of the line; otherw

First, it will introduce an auxiliary vector, each of its weight D D [I] indicates that the current The found from the delivery center I to each intermediate users of the shortest path length. It from the beginning I mentality: if there is a viable route to the D [r] for the right lines; otherwise p

正在翻譯，請等待...

Firstly introduced a secondary vector d, each component it D[i] currently I found from distribution center to each intermediate user length of shortest path. Its initial state is: if I see a feasible route, then D[r] for line weighting; otherwise reset D[r] to ∞. Obviously, the length is D[Rl=min{D[

First, the introduction of an auxiliary vector D, which each component of the D [i] found that the current distribution center from the middle of each user i to the length of the shortest path. Its initial state is: if there is a feasible route from i to, then D [r] is the weight of the line; otherw