禁忌搜索算法在车辆调度决策中的应用

论文探讨了交通线路可能被敌方毁坏情况下的车辆路径优化问题，建立了不确定的两阶段整数规划数学模型，分析了路径方案的最大和最小效用值。在线路方案评价值的计算中只计算最小值和最大值，简化了方案的目标值计算。设计了求解模型的双层禁忌搜索算法。最后通过应用示例验证了模型和算法的有效性。

A Tabu Search Method for the Vehicle Routing Problem

A vehicle routing problem in war is discussed, in which some routes may be destroyed uncertainly by competitor. A two-stage integer program model is constructed. The value Of a route in a uncertain situation is analyzed. In the method, only the maximum value and the minimum Value are countered into the object value, simpling the computation of the object value of the model. A two-stage tabu search algorithm is designed. In the end, an example is given.