| 连续网络上的占线可恢复加拿大旅行者问题 |
| |
| 引用本文： | 苏兵,徐寅峰. 连续网络上的占线可恢复加拿大旅行者问题[J]. 系统工程, 2004, 22(8): 10-13 |
| |
| 作者姓名： | 苏兵 徐寅峰 |
| |
| 作者单位： | 1. 西安交通大学,管理学院,陕西,西安,710049
2. 西安交通大学,管理学院,陕西,西安,710049;西安交通大学,机械制造工程重点实验室,陕西,西安,710049 |
| |
| 基金项目： | 国家自然科学基金资助项目(10371094，70121001) |
| |
| 摘 要： | 针对堵塞完全在无法预知的情况下一个个出现，且堵塞恢复时间信息可以获取的占线可恢复加拿大旅行者问题，给出连续网络上的等待策略和移动策略以及相应策略下的竞争比，并对两种策略的执行效果进行分析和比较。
|
| 关 键 词： | 连续网络 占线 可恢复加拿大旅行者问题 竞争比 |
| 文章编号： | 1001-4098(2004)08-0010-04 |
Online Recoverable Canadian Traveler Problem on a Continuous Network |
| |
| SU Bing,XU Yin-feng. Online Recoverable Canadian Traveler Problem on a Continuous Network[J]. Systems Engineering, 2004, 22(8): 10-13 |
| |
| Authors: | SU Bing XU Yin-feng |
| |
| Affiliation: | SU Bing~1,XU Yin-feng~ |
| |
| Abstract: | The online Recoverable Canadian Traveler Problem(RCTP for short) is considered for the case when the blocked edges occur one by one without any predictable information except its recover time. From the online point of view, the (Waiting) strategy and the Moving strategy are proposed and the competitive ratios of the two strategies are given based on a continuous network, and we analyze and compare the performance of two strategies. |
| |
| Keywords: | Continuous Network Online Recoverable Canadian Traveler Problem Competitive Ratio |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
