知识与财富的链接
首先提出了连续时间的网络截流选址问题,并以保护整个道路交通网络为目标,建立了防御性醉酒驾驶拦截问题的模型。根据问题的特征,分别设计了基于时间的迭代改进算法和离散选址问题的拉格朗日启发式算法,并通过随机实例对算法进行了测试。结果表明:连续时间的同步拦截问题可以通过分离连续的时间变量和离散的选址变量的方法,多次求解覆盖问题而有效解决,并且迭代改进算法对时间的搜索性更强,从而能够用较少的迭代次数解决原问题。
A continuous time typed network flow interception problem has been proposed; a preventive drunk driving interception model has been developed with the goal for protecting entire traffic network. According to the characteristics of the problem, a time based iterative improved algorithm and Lagrange heuristic algorithm for discrete site selection problem are devised, respectively, they are applied to the random instances in order to test the performance. The computational result indicates that by separating the continuous time variable from the discrete site selection variable, the original problem could finally be resolved by solving a series of covering problems. The iterative improved algorithm is more powerful in time search, therefore the problem is able to solve in few iteration times.
