|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/4911
|
| タイトル: | A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree |
| 著者: | Asano, Tetsuo
Katoh, Naoki
Kawashima, Kazuhiro |
| 発行日: | 2001-06 |
| 出版者: | Springer |
| 誌名: | Journal of Combinatorial Optimization |
| 巻: | 5 |
| 号: | 2 |
| 開始ページ: | 213 |
| 終了ページ: | 231 |
| DOI: | 10.1023/A:1011461300596 |
| 抄録: | This paper presents a new approximation algorithm for a vehicle routing problem on a tree-shaped network with a single depot. Customers are located on vertices of the tree, and each customer has a positive demand. Demands of customers are served by a fleet of identical vehicles with limited capacity. It is assumed that the demand of a customer is splittable, i.e., it can be served by more than one vehicle. The problem we are concerned with in this paper asks to find a set of tours of the vehicles with minimum total lengths. Each tour begins at the depot, visits a subset of the customers and returns to the depot without violating the capacity constraint. We propose a 1.35078-approximation algorithm for the problem (exactly, √<41>-1)/4), which is an improvement over the existing 1.5-approximation. |
| Rights: | This is the author-created version of Springer, Tetsuo Asano, Naoki Katoh and Kazuhiro Kawashima, Journal of Combinatorial Optimization, 5(2), 2001, 213-231. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1023/A:1011461300596 |
| URI: | http://hdl.handle.net/10119/4911 |
| 資料タイプ: | author |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| C1330.pdf | | 329Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
