Algorithms and their generalizations for vehicle routing problems of minimizing regrets
Project/Area Number |
16K00004
|
Research Category |
Grant-in-Aid for Scientific Research (C)
|
Allocation Type | Multi-year Fund |
Section | 一般 |
Research Field |
Theory of informatics
|
Research Institution | Tohoku University |
Principal Investigator |
ITO Takehiro 東北大学, 情報科学研究科, 准教授 (40431548)
|
Project Period (FY) |
2016-04-01 – 2019-03-31
|
Project Status |
Completed (Fiscal Year 2018)
|
Budget Amount *help |
¥4,420,000 (Direct Cost: ¥3,400,000、Indirect Cost: ¥1,020,000)
Fiscal Year 2018: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
Fiscal Year 2017: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2016: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
|
Keywords | アルゴリズム / グラフ理論 / 近似 / グラフ / 運搬経路問題 / 近似アルゴリズム / 近似不可能性 / 情報基礎 |
Outline of Final Research Achievements |
We studied a recently proposed variant of vehicle routing problems which takes the customers’ regrets as the objective function. We developed algorithms for the problem using structures of input graphs, and also proved some computational hardness and inapproximability. In addition, we introduced some generalized variant, and examined an extension of our algorithms in order to put our developed methods in place. Our approximation method for trees is best possible from the viewpoint of approximation ratio, because one can choose an arbitrarily better ratio.
|
Academic Significance and Societal Importance of the Research Achievements |
運搬経路問題は長年盛んに研究されてきたが,既存研究ではサービス提供側のコストを評価対象とすることが多かった.それに対し本問題は,サービス受給側の不満度を評価対象とする比較的新しい設定の問題である.本研究の成果により,入力グラフのどのような構造が本問題を計算困難にしているのか詳細な解析が与えられた.また,効率のよい近似手法を開発することで,入力グラフは限定されるものの,理論保証された精度の近似解を得られるようになった.
|
Report
(4 results)
Research Products
(41 results)
-
-
-
-
-
-
-
-
-
-
-
[Journal Article] Reconfiguring spanning and induced subgraphs2018
Author(s)
Hanaka Tesshu、Ito Takehiro、Mizuta Haruka、Moore Benjamin、Nishimura Naomi、Subramanya Vijay、Suzuki Akira、Vaidyanathan Krishna
-
Journal Title
Lecture Notes in Computer Science
Volume: 10976
Pages: 428-440
DOI
ISBN
9783319947754, 9783319947761
Related Report
Peer Reviewed / Int'l Joint Research
-
-
-
-
-
[Journal Article] Reconfiguration of Maximum-Weight b-Matchings in a Graph2017
Author(s)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto
-
Journal Title
Proceedings of 23rd Annual International Computing and Combinatorics Conference (COCOON 2017)
Volume: ---
Pages: 287-296
DOI
NAID
ISBN
9783319623887, 9783319623894
Related Report
Peer Reviewed / Open Access
-
-
-
-
-
-
-
-
-
-
-
-
-
[Presentation] Reconfiguring spanning and induced subgraphs2018
Author(s)
Hanaka Tesshu、Ito Takehiro、Mizuta Haruka、Moore Benjamin、Nishimura Naomi、Subramanya Vijay、Suzuki Akira、Vaidyanathan Krishna
Organizer
24th Annual International Computing and Combinatorics Conference (COCOON 2018)
Related Report
Int'l Joint Research
-
-
-
-
-
-
-
-
-
-
-
-