• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Algorithms and their generalizations for vehicle routing problems of minimizing regrets

Research Project

Project/Area Number 16K00004
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeMulti-year Fund
Section一般
Research Field Theory of informatics
Research InstitutionTohoku 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)
  • 2018 Annual Research Report   Final Research Report ( PDF )
  • 2017 Research-status Report
  • 2016 Research-status Report
  • Research Products

    (41 results)

All 2019 2018 2017 2016 Other

All Int'l Joint Research (4 results) Journal Article (23 results) (of which Int'l Joint Research: 4 results,  Peer Reviewed: 23 results,  Open Access: 11 results,  Acknowledgement Compliant: 7 results) Presentation (14 results) (of which Int'l Joint Research: 14 results)

  • [Int'l Joint Research] University of Waterloo(カナダ)

    • Related Report
      2018 Annual Research Report
  • [Int'l Joint Research] University of Waterloo(Canada)

    • Related Report
      2016 Research-status Report
  • [Int'l Joint Research] Carnegie Mellon University(米国)

    • Related Report
      2016 Research-status Report
  • [Int'l Joint Research] University of Bergen(Norway)

    • Related Report
      2016 Research-status Report
  • [Journal Article] The Coloring Reconfiguration Problem on Specific Graph Classes2019

    • Author(s)
      HATANAKA Tatsuhiko、ITO Takehiro、ZHOU Xiao
    • Journal Title

      IEICE Transactions on Information and Systems

      Volume: E102.D Issue: 3 Pages: 423-429

    • DOI

      10.1587/transinf.2018FCP0005

    • NAID

      130007606879

    • ISSN
      0916-8532, 1745-1361
    • Year and Date
      2019-03-01
    • Related Report
      2018 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Reconfiguration of colorable sets in classes of perfect graphs2019

    • Author(s)
      Ito Takehiro、Otachi Yota
    • Journal Title

      Theoretical Computer Science

      Volume: 772 Pages: 111-122

    • DOI

      10.1016/j.tcs.2018.11.024

    • Related Report
      2018 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Parameterized complexity of the list coloring reconfiguration problem with graph parameters2018

    • Author(s)
      Hatanaka Tatsuhiko、Ito Takehiro、Zhou Xiao
    • Journal Title

      Theoretical Computer Science

      Volume: 739 Pages: 65-79

    • DOI

      10.1016/j.tcs.2018.05.005

    • Related Report
      2018 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Minimum-Cost b-Edge Dominating Sets on Trees2018

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto
    • Journal Title

      Algorithmica

      Volume: 81 Issue: 1 Pages: 343-366

    • DOI

      10.1007/s00453-018-0448-z

    • Related Report
      2018 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Reconfiguration of maximum-weight b-matchings in a graph2018

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto
    • Journal Title

      Journal of Combinatorial Optimization

      Volume: 37 Issue: 2 Pages: 454-464

    • DOI

      10.1007/s10878-018-0289-3

    • NAID

      120006960832

    • Related Report
      2018 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Reconfiguration of colorable sets in classes of perfect graphs2018

    • Author(s)
      Takehiro Ito, Yota Otachi
    • Journal Title

      Leibniz International Proceedings in Informatics

      Volume: 101

    • DOI

      10.4230/LIPIcs.SWAT.2018.27

    • Related Report
      2018 Annual Research Report
    • Peer Reviewed / Open Access
  • [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

      10.1007/978-3-319-94776-1_36

    • ISBN
      9783319947754, 9783319947761
    • Related Report
      2018 Annual Research Report
    • Peer Reviewed / Int'l Joint Research
  • [Journal Article] Algorithms for Coloring Reconfiguration under Recolorability Constraints2018

    • Author(s)
      Hiroki Osawa, Akira Suzuki, Takehiro Ito, and Xiao Zhou
    • Journal Title

      Proceedings of the 29th International Symposium on Algorithms and Computation (ISAAC 2018), Leibniz International Proceedings in Informatics

      Volume: 123

    • DOI

      10.4230/LIPICS.ISAAC.2018.37

    • Related Report
      2018 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] The Complexity of (List) Edge-Coloring Reconfiguration Problem2018

    • Author(s)
      Osawa Hiroki、Suzuki Akira、Ito Takehiro、Zhou Xiao
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

      Volume: E101.A Issue: 1 Pages: 232-238

    • DOI

      10.1587/transfun.E101.A.232

    • NAID

      130006300867

    • ISSN
      0916-8508, 1745-1337
    • Related Report
      2017 Research-status Report
    • Peer Reviewed / Open Access
  • [Journal Article] Tight approximability of the server allocation problem for real-time applications2018

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto, and Taichi Shiitada
    • Journal Title

      Proceedings of 3rd International Workshop on Algorithmic Aspects of Cloud Computing (ALGOCLOUD 2017)

      Volume: --- Pages: 41-55

    • DOI

      10.1007/978-3-319-74875-7_4

    • NAID

      120006998850

    • ISBN
      9783319748740, 9783319748757
    • Related Report
      2017 Research-status Report
    • Peer Reviewed / Open Access
  • [Journal Article] Reconfiguration of Steiner Trees in an Unweighted Graph2017

    • Author(s)
      Haruka Mizuta, Takehiro Ito and Xiao Zhou
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

      Volume: E100.A Issue: 7 Pages: 1532-1540

    • DOI

      10.1587/transfun.E100.A.1532

    • NAID

      130007311770

    • ISSN
      0916-8508, 1745-1337
    • Related Report
      2017 Research-status Report
    • Peer Reviewed
  • [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

      10.1007/978-3-319-62389-4_24

    • NAID

      120006960832

    • ISBN
      9783319623887, 9783319623894
    • Related Report
      2017 Research-status Report
    • Peer Reviewed / Open Access
  • [Journal Article] The Coloring Reconfiguration Problem on Specific Graph Classes2017

    • Author(s)
      Hatanaka Tatsuhiko、Ito Takehiro、Zhou Xiao
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 10627 Pages: 152-162

    • DOI

      10.1007/978-3-319-71150-8_15

    • NAID

      130007606879

    • ISBN
      9783319711492, 9783319711508
    • Related Report
      2017 Research-status Report
    • Peer Reviewed
  • [Journal Article] Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters2017

    • Author(s)
      Hatanaka Tatsuhiko、Ito Takehiro、Zhou Xiao
    • Journal Title

      Leibniz International Proceedings in Informatics

      Volume: 83

    • DOI

      10.4230/LIPIcs.MFCS.2017.51

    • Related Report
      2017 Research-status Report
    • Peer Reviewed / Open Access
  • [Journal Article] Complexity of Coloring Reconfiguration under Recolorability Constraints2017

    • Author(s)
      Osawa Hiroki、Suzuki Akira、Ito Takehiro、Zhou Xiao
    • Journal Title

      Leibniz International Proceedings in Informatics

      Volume: 92

    • DOI

      10.4230/LIPIcs.ISAAC.2017.62

    • Related Report
      2017 Research-status Report
    • Peer Reviewed / Open Access
  • [Journal Article] Complexity of the Multi-Service Center Problem2017

    • Author(s)
      Ito Takehiro、Kakimura Naonori、Kobayashi Yusuke
    • Journal Title

      Leibniz International Proceedings in Informatics

      Volume: 92

    • DOI

      10.4230/LIPIcs.ISAAC.2017.48

    • Related Report
      2017 Research-status Report
    • Peer Reviewed / Open Access
  • [Journal Article] Complexity of Tiling a Polygon with Trominoes or Bars2017

    • Author(s)
      Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki, Ryuhei Uehara
    • Journal Title

      Discrete & Computational Geometry

      Volume: 印刷中 Issue: 3 Pages: 686-704

    • DOI

      10.1007/s00454-017-9884-9

    • NAID

      120006457371

    • Related Report
      2016 Research-status Report
    • Peer Reviewed / Acknowledgement Compliant
  • [Journal Article] Efficient Stabilization of Cooperative Matching Games2017

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
    • Journal Title

      Theoretical Computer Science

      Volume: 印刷中 Pages: 69-82

    • DOI

      10.1016/j.tcs.2017.03.020

    • Related Report
      2016 Research-status Report
    • Peer Reviewed / Acknowledgement Compliant
  • [Journal Article] Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs2017

    • Author(s)
      Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 10167 Pages: 228-240

    • DOI

      10.1007/978-3-319-53925-6_18

    • ISBN
      9783319539249, 9783319539256
    • Related Report
      2016 Research-status Report
    • Peer Reviewed / Acknowledgement Compliant
  • [Journal Article] The Complexity of (List) Edge-Coloring Reconfiguration Problem2017

    • Author(s)
      Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 10167 Pages: 347-358

    • DOI

      10.1007/978-3-319-53925-6_27

    • NAID

      130006300867

    • ISBN
      9783319539249, 9783319539256
    • Related Report
      2016 Research-status Report
    • Peer Reviewed / Acknowledgement Compliant
  • [Journal Article] The Complexity of Dominating Set Reconfiguration2016

    • Author(s)
      Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal
    • Journal Title

      Theoretical Computer Science

      Volume: 651 Pages: 37-49

    • DOI

      10.1016/j.tcs.2016.08.016

    • Related Report
      2016 Research-status Report
    • Peer Reviewed / Int'l Joint Research / Acknowledgement Compliant
  • [Journal Article] Reconfiguration of Steiner Trees in an Unweighted Graph2016

    • Author(s)
      Haruka Mizuta, Takehiro Ito, Xiao Zhou
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 9843 Pages: 163-175

    • DOI

      10.1007/978-3-319-44543-4_13

    • NAID

      130007311770

    • ISBN
      9783319445427, 9783319445434
    • Related Report
      2016 Research-status Report
    • Peer Reviewed / Acknowledgement Compliant
  • [Journal Article] Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs2016

    • Author(s)
      Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 10043 Pages: 270-284

    • DOI

      10.1007/978-3-319-48749-6_20

    • ISBN
      9783319487489, 9783319487496
    • Related Report
      2016 Research-status Report
    • Peer Reviewed / Acknowledgement Compliant
  • [Presentation] Reconfiguration of colorable sets in classes of perfect graphs2018

    • Author(s)
      Ito Takehiro、Otachi Yota
    • Organizer
      16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018)
    • Related Report
      2018 Annual Research Report
    • Int'l Joint Research
  • [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
      2018 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Algorithms for coloring reconfiguration under recolorability constraints2018

    • Author(s)
      Osawa Hiroki、Suzuki Akira、Ito Takehiro、Zhou Xiao
    • Organizer
      29th International Symposium on Algorithms and Computation (ISAAC 2018)
    • Related Report
      2018 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs2017

    • Author(s)
      Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano
    • Organizer
      The 11th International Conference and Workshops on Algorithms and Computation (WALCOM 2017)
    • Place of Presentation
      Hsinchu, Taiwan
    • Year and Date
      2017-03-30
    • Related Report
      2016 Research-status Report
    • Int'l Joint Research
  • [Presentation] The Complexity of (List) Edge-Coloring Reconfiguration Problem2017

    • Author(s)
      Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou
    • Organizer
      The 11th International Conference and Workshops on Algorithms and Computation (WALCOM 2017)
    • Place of Presentation
      Hsinchu, Taiwan
    • Year and Date
      2017-03-30
    • Related Report
      2016 Research-status Report
    • Int'l Joint Research
  • [Presentation] Reconfiguration of Maximum-Weight b-Matchings in a Graph2017

    • Author(s)
      Ito Takehiro、Kakimura Naonori、Kamiyama Naoyuki、Kobayashi Yusuke、Okamoto Yoshio
    • Organizer
      23rd Annual International Computing and Combinatorics Conference (COCOON 2017)
    • Related Report
      2017 Research-status Report
    • Int'l Joint Research
  • [Presentation] Tight Approximability of the Server Allocation Problem for Real-Time Applications2017

    • Author(s)
      Ito Takehiro、Kakimura Naonori、Kamiyama Naoyuki、Kobayashi Yusuke、Okamoto Yoshio、Shiitada Taichi
    • Organizer
      3rd International Workshop on Algorithmic Aspects of Cloud Computing (ALGOCLOUD 2017)
    • Related Report
      2017 Research-status Report
    • Int'l Joint Research
  • [Presentation] The Coloring Reconfiguration Problem on Specific Graph Classes2017

    • Author(s)
      Hatanaka Tatsuhiko、Ito Takehiro、Zhou Xiao
    • Organizer
      11th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2017)
    • Related Report
      2017 Research-status Report
    • Int'l Joint Research
  • [Presentation] Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters2017

    • Author(s)
      Hatanaka Tatsuhiko、Ito Takehiro、Zhou Xiao
    • Organizer
      42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)
    • Related Report
      2017 Research-status Report
    • Int'l Joint Research
  • [Presentation] Complexity of Coloring Reconfiguration under Recolorability Constraints2017

    • Author(s)
      Osawa Hiroki、Suzuki Akira、Ito Takehiro、Zhou Xiao
    • Organizer
      28th International Symposium on Algorithms and Computation (ISAAC 2017)
    • Related Report
      2017 Research-status Report
    • Int'l Joint Research
  • [Presentation] Complexity of the Multi-Service Center Problem2017

    • Author(s)
      Ito Takehiro、Kakimura Naonori、Kobayashi Yusuke
    • Organizer
      28th International Symposium on Algorithms and Computation (ISAAC 2017)
    • Related Report
      2017 Research-status Report
    • Int'l Joint Research
  • [Presentation] Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs2016

    • Author(s)
      Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano
    • Organizer
      The 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2016)
    • Place of Presentation
      Hong Kong, China
    • Year and Date
      2016-12-17
    • Related Report
      2016 Research-status Report
    • Int'l Joint Research
  • [Presentation] The Multi-Service Center Decision Problem is NP-Complete for Split Graphs2016

    • Author(s)
      Toshimitsu Anzai, Takehiro Ito, Akira Suzuki, Xiao Zhou
    • Organizer
      The 6th World Congress on Engineering and Technology (CET 2016)
    • Place of Presentation
      Shanghai, China
    • Year and Date
      2016-10-23
    • Related Report
      2016 Research-status Report
    • Int'l Joint Research
  • [Presentation] Reconfiguration of Steiner Trees in an Unweighted Graph2016

    • Author(s)
      Haruka Mizuta, Takehiro Ito, Xiao Zhou
    • Organizer
      The 27th International Workshop on Combinatorial Algorithms (IWOCA 2016)
    • Place of Presentation
      Helsinki, Finland
    • Year and Date
      2016-08-17
    • Related Report
      2016 Research-status Report
    • Int'l Joint Research

URL: 

Published: 2016-04-21   Modified: 2022-02-16  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi