基于时间约束的配送网络可行路径算法研究

Feasible paths algorithm in distribution network based on time constrain

图论中的路径问题一般是求解最短路径问题。然而在军事物流配送过程中,由于网络中的边可能会失效,所以应求出所有满足需求点时间约束的路径。设计了求解满足时间约束的可行路径的算法,该算法可以避免重复边,及时排除超过时间约束的路径,并且能在有限的(n-1)步之内完成。

The shortest path problem is a typical problem in graph theory.However,each edge in network will be attacked possibly in military logistics distribution process.So must obtain all feasible paths under time constrain.This paper designs the feasible paths algorithm based on time constrain.It can avoid repetition edges and exclude the paths beyond time constrain.It can be finished in（n-1）steps.