摘要
在运输过程中,有时往往需要考虑两个目标。由于在实际的求解过程中,往往很难获得两个目标同时最小的绝对最短路径。通常,只要找到满足决策者需要的有效路径就可以了。提出了一种利用k-最短路算法来获得双目标最短路的有效路径的算法,并对算法的复杂性进行了分析。最后给出了一个应用算例。
In general, two objective should be considered in the transportation. It is hardly to get the path with minization of two objectives. To the decision-maker, it is a good choice to get the nondominated solution. The paper developed a algorithm for the two objectives shortest path by using the k-shortest path algorithm. The computational complexity of the algorithm was discussed. At last, a case was studied.
出处
《系统工程》
CSCD
北大核心
2005年第7期113-117,共5页
Systems Engineering
基金
国家自然科学基金资助项目(70471039)
高等学校博士学科点专项科研基金资助项目(20030613016)
关键词
最短路
双目标
有效路径
k-最短路
Shortest Path
Biobjeetive
Nondominated Path
k-shortest Path
