摘要
The online routing problem of two vehicles to an emergency scene is considered. In grid transportation network, some of the edges may be suddenly blocked and the blockage will not be observed until reaching an endpoint of the blocked edge. The goal is to minimize the arrival time of the first vehicle with at most k blockages. An online strategy named Row-first and Line-first is presented and the competitive ratio is analyzed, and the ratio is proved to be tight. The optimization of the online strategy in some situations is also proved.
| 源语言 | 英语 |
|---|---|
| 页(从-至) | 175-180 |
| 页数 | 6 |
| 期刊 | Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice |
| 卷 | 33 |
| 期 | 1 |
| 出版状态 | 已出版 - 1月 2013 |
学术指纹
探究 'Online routing of two vehicles to an emergency scene in grid transportation network' 的科研主题。它们共同构成独一无二的指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver