| 一种求解时变条件下最短路的算法 |
| |
| 引用本文： | 陈建芳. 一种求解时变条件下最短路的算法[J]. 绍兴文理学院学报, 2006, 26(2): 33-37 |
| |
| 作者姓名： | 陈建芳 |
| |
| 作者单位： | 绍兴托普信息职业技术学院,浙江绍兴312000 |
| |
| 摘 要： | 在组合优化过程中，往往需要获得从起点到终点之间的最短路，而其所考虑的目标可能是一个与时间相关的变量．作者给出了时变条件下，利用标号法求解最短路的算法，并对算法的复杂性进行了分析，最后给出了一个应用算例．
|
| 关 键 词： | 最短路 时变 标号法 成本 |
| 文章编号： | 1008-293X（2006）08-0033-05 |
| 收稿时间： | 2006-03-21 |
An Approach to the Shortest Path Problem with Time-varying |
| |
| Chen Jianfang. An Approach to the Shortest Path Problem with Time-varying[J]. Journal of Shaoxing College of Arts and Sciences, 2006, 26(2): 33-37 |
| |
| Authors: | Chen Jianfang |
| |
| Abstract: | The shortest path problem is a basic problem in the combinatorial optimization, whose objective is time- varying. The paper gives the algorithm for the shortest path problem with time - varying by the labeling approach. Then the comlexity of the algorithm is discussed and a case is studied. |
| |
| Keywords: | shortest path time - varying labeling approach cost |
| 本文献已被 CNKI 维普 等数据库收录！ |
