書誌事項
- タイトル別名
-
- A Combinatorial Auction Based Algorithm for Flexible Seat Reservation Systems
- ジュウナン ナ レッシャ ヨヤク ホウシキ ニ タイスル クミアワセ オークション ニ ヨル アルゴリズム
この論文をさがす
説明
We present algorithms for flexible seat distribution problems, which is defined as a problem to give an appropriate travel plan to each passenger after receiving their requests concerning their travel demands. Seat distribution problems occur when a flexible seat reservation system is implemented in which passengers are allowed to reserve seats by submitting their demands instead of specifying trains. To solve the seat distribution problem, we have formalized it as a winner determination problem of the combinatorial auction mechanism. It should be noted that difficulty of the seat distribution problem varies depending on instances of the problem, because the number of demands often varies and users' requests sometimes converge on particular trains. This suggests that in order to get solutions with high quality, algorithms that appropriately control the search space are indispensable. In this paper, we present three kinds of such algorithms for the seat distribution problem together with the results of several experiments.
収録刊行物
-
- 電気学会論文誌Ｄ（産業応用部門誌）
-
電気学会論文誌Ｄ（産業応用部門誌） 125 (4), 329-337, 2005
一般社団法人 電気学会
- Tweet
キーワード
詳細情報 詳細情報について
-
- CRID
- 1390001204657314560
-
- NII論文ID
- 10015576167
-
- NII書誌ID
- AN10012320
-
- ISSN
- 13488163
- 09136339
-
- NDL書誌ID
- 7303618
-
- 本文言語コード
- ja
-
- データソース種別
-
- JaLC
- NDLサーチ
- Crossref
- CiNii Articles
- OpenAIRE
-
- 抄録ライセンスフラグ
- 使用不可
