摘要
在组合优化过程中,往往需要获得从起点到终点之间的最短路,而其所考虑的目标可能是一个与时间相关的变量,同时,对于网络中的节点往往有宵禁的限制(curfews)。本文给出了时变条件下有软、硬宵禁限制的时间最短路模型,设计了求解时变条件下有宵禁限制的时间最短路的算法,并给出了一个应用实例。
Shortest path problem is a basic problem in the combinatorial optimization, the objeetive is time varying. Moreover, there will be eurfews in some nodes in the network, the paper developed the models for time-varying shortest time path problem with soft and hard eurfews and the algorithm for them. At last, a ease was studied.
出处
《大理学院学报（综合版）》
CAS
2006年第6期10-13,共4页
Journal of Dali University
关键词
时间最短路
时变
宵禁
标号算法
shortest time path
time-varying
curfews
labeling algorithm
