【摘要】 在组合优化过程中,往往需要获得从起点到终点之间的最短路,而其所考虑的目标可能是一个与时间相关的变量,同时,对于网络中的节点往往有宵禁的限制(curfews).给出了时变条件下有软、硬宵禁限制的成本最短路模型,设计了求解时变条件下有宵禁限制的成本最短路的算法,并给出了一个应用实例.更多还原

【Abstract】 Shortest path problem is a basic are in the combinatorial optimization.The objective is time variable.Moreover,there are curfews in some nodes in the network.The paper developsd the models for time-varying minimum cost path problem with soft and hard curfews and the algorithm for them.Finally,a practical example is given.更多还原