求解模糊最短路问题的动态规划法

The Dynamic Programming Method for Solving the Fuzzy Shortest Path Problem

提出动态规划法求解模糊最短路问题。对于给定起点和终点的有向模糊图,可以从终点出发,逆向追溯分阶段探寻最短路,同时删去非最短路。而对于每个阶段的最短路问题,给出了求解最短路长度和最短路的方法,即利用模糊最小算子求最短路长度,并根据每条路与最短路长度的贴近度来确定最短路。最后通过例子说明此种方法的可行性和有效性。

The dynamic programming method for solving fuzzy shortest path problem is given. For the fuzzy graph with a given starting point and end point, we can reversely explore the most short circuit from the end point in stages, and delete non shortest path. For the shortest path problem in each stage, a method to calculate the shortest path length and the shortest path is presented to solve the shortest path length by u- sing with pie. Key the fuzzy minimum operator and to determine the shortest path according to the closeness of each road the shortest length. Finally the validity and feasibility of this method is illustrated through an exam programmingple.