| 一种求解时变条件下双目标最短路的算法 |
| |
| 引用本文： | 陈建芳.一种求解时变条件下双目标最短路的算法[J].浙江科技学院学报,2006,18(4):245-249. |
| |
| 作者姓名： | 陈建芳 |
| |
| 作者单位： | 绍兴托普信息职业技术学院,院长办公室,浙江,绍兴,312000 |
| |
| 摘 要： | 在组合优化过程中,往往需要获得从起点到终点之间的最短路,有时需要同时考虑两个目标,而这些目标可能会随着时间的变化而变化。为此,提出了一种利用标号法获得时变条件下双目标最短路的方法,考虑了不同的出发时间的情况,并对算法的复杂性进行了分析,最后给出了一个应用算例。
|
| 关 键 词： | 最短路 双目标 时变 运输网络 |
| 文章编号： | 1671-8798(2006)04-0245-05 |
| 收稿时间： | 11 21 2006 12:00AM |
| 修稿时间： | 2006年11月21 |
Approach for Bi-Objective Shortest Path with Time-Varying |
| |
| CHEN Jian-fang.Approach for Bi-Objective Shortest Path with Time-Varying[J].Journal of Zhejiang University of Science and Technology,2006,18(4):245-249. |
| |
| Authors: | CHEN Jian-fang |
| |
| Institution: | Shaoxin Top Infor. Career Teeh, College, Zhejiang Shaoxin, 312000 China |
| |
| Abstract: | Shortest path problem is a basic problem in the combinatorial optimization.In general,two objective will be considered in the transportation and the objectives are time-varying.The author developed the algorithm for the two objectives shortest path with time-varying by using the labelling approach,gave the algorithm to the problem with defferent start time,and dicussed the computational comlexity of the algorithm.At last,a case was studied. |
| |
| Keywords: | shortest path bi-objective time-varying network |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
