本文借助最小费用最大流理论对时间压力下最小风险最大流问题进行了研究,分析了最小风险、最大流路径下的最短时间,构建了基于时间压力条件下的最小风险最大流模型,利用多目标规划方法给出了求解该模型的算法,最后通过实例验证了该方法的有效性.
This paper do a research on the minimum risk maximum flow issue under time pressure with the help of minimum cost maximum flow, and made an analysis on the minimum time under the minimum risk and the maximum flow. Secondly, the thesis construct a model which shows maximum flow with minimum risks under time constraint, and give arithmetic for solving the model by a multi-objective programming method, and apply it into criminals laundering instances. Furthermore, the arithmetic was practiced in anti-money laundering to verifying its effectiveness.