-
- 伊藤 雅
- 愛知工業大学経営情報科学部
書誌事項
- タイトル別名
-
- Traffic Route Selection by Using A Tabu Search Heuristic.
この論文をさがす
抄録
This letter proposes a new tabu search heuristic to select the optimal traffic route. The traffic network is completely assumed to be covered by a mesh structure. The objective is to minimize total necessary time to the goals of all cars. In the other words, it can be resolved into the minimization of total stoppage time. Each car has been assigned some routes in advance, and then all routes are numbered. Tabu search gives the best route-numbers to all the cars so as to avoid congestion. The method makes use of not only usual tabu lists but also a move frequency-based memory and a residence measure memory.
収録刊行物
-
- 電気学会論文誌C(電子・情報・システム部門誌)
-
電気学会論文誌C(電子・情報・システム部門誌) 123 (2), 393-394, 2003
一般社団法人 電気学会
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1390282679581524608
-
- NII論文ID
- 130000089398
-
- NII書誌ID
- AN10065950
-
- ISSN
- 13488155
- 03854221
-
- 本文言語コード
- ja
-
- データソース種別
-
- JaLC
- Crossref
- CiNii Articles
-
- 抄録ライセンスフラグ
- 使用不可