Academic Journal
NETWORK REPRESENTATION AND SHORTEST PATH REFLECTING THE RAMP ENTRY OR EXIT DIRECTION LIMITATION
| العنوان: | NETWORK REPRESENTATION AND SHORTEST PATH REFLECTING THE RAMP ENTRY OR EXIT DIRECTION LIMITATION |
|---|---|
| المؤلفون: | Kazutaka Takao, Tohru Higashi, Koji Yasuda, Yasuo Asakura |
| المساهمون: | The Pennsylvania State University CiteSeerX Archives |
| المصدر: | http://www.issr-kyoto.or.jp/public/takao/paper/ITS2006_shima.pdf. |
| المجموعة: | CiteSeerX |
| مصطلحات موضوعية: | BACKGROUND AND OBJECTIVE |
| الوصف: | There are some ramp entry or exit direction limitations on networks. This kind of limitation is represented by successive passage prohibition (SPP). It indicates that the vehicles cannot successively pass two links with SPP attributes. However, the shortest-path tree sometimes cannot be expressed with a simple tree when a network having this limitation is represented with single nodes. In such a case, an accurate shortest path cannot be found by simply applying Dijkstra's algorithm. Therefore, we propose an intersection expansion to find the most accurate shortest-path tree. It is transformed automatically during the process of finding the shortest path. |
| نوع الوثيقة: | text |
| وصف الملف: | application/pdf |
| اللغة: | English |
| Relation: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.103.1878; http://www.issr-kyoto.or.jp/public/takao/paper/ITS2006_shima.pdf |
| الاتاحة: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.103.1878 http://www.issr-kyoto.or.jp/public/takao/paper/ITS2006_shima.pdf |
| Rights: | Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| رقم الانضمام: | edsbas.124FB2FE |
| قاعدة البيانات: | BASE |
| الوصف غير متاح. |