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

大規模組合せ最適化問題に対するハイブリッドメタ戦略アルゴリズムの開発と評価

Research Project

Project/Area Number 17700016
Research Category

Grant-in-Aid for Young Scientists (B)

Allocation TypeSingle-year Grants
Research Field Fundamental theory of informatics
Research InstitutionNagoya University

Principal Investigator

柳浦 睦憲  Nagoya University, 情報科学研究科, 准教授 (10263120)

Project Period (FY) 2005 – 2007
Project Status Completed (Fiscal Year 2007)
Budget Amount *help
¥3,500,000 (Direct Cost: ¥3,500,000)
Fiscal Year 2007: ¥900,000 (Direct Cost: ¥900,000)
Fiscal Year 2006: ¥1,100,000 (Direct Cost: ¥1,100,000)
Fiscal Year 2005: ¥1,500,000 (Direct Cost: ¥1,500,000)
Keywordsハイブリッドメタ戦略 / 組合せ最適化 / 時間枠つき配送計画問題 / 動的計画法 / 集合被覆 / グラフ彩色問題 / 集合被覆問題 / カッティングストック問題 / 配送計画問題 / スケジューリング
Research Abstract

携帯電話の普及,インターネットの整備,計算機性能の進化など,情報技術が急速に発展し,最新かつ大量の情報を高速に入手・処理することが可能になった.このような技術革命に伴って,これらの技術資源やそこから得られる情報を有効に利用する必要性が高まってきた.この目的において重要な問題として,スケジューリング問題やネットワーク設計問題などの情報学的・システム工学的問題が挙げちれるが,その多くは組合せ最適化問題として定式化できる.応用上重要な問題はますます大規模化・複雑化してきているが,NP困難性に代表されるように,多くの組合せ最適化問題に対し,問題の規模が大きい場合,厳密な最適解を求めることが困難であることが認知されている.このような問題に現実的に対処することを目標に,メタ戦略に種々の最適化手法を高度に組み合わせたハイブリッドメタ戦略と呼ばれる枠組みに基づくアルゴリズム設計の方法論構築が本研究の主な目的である.
高い汎用を持ちつつアルゴリズムの性能向上に利用できる構造を有する問題として,本年度は配送計画問題において凸の時間枠ペナルティ関数が付随するものを中心に取り上げた.この問題は,複数の顧客に何台かの車両で配送を行う際,顧客の希望する時間枠をできるだけ満たしつつ配送に伴うコストを最小化する問題で,宅配などの直接的な応用のほかにも,スケジューリングなどの見かけの異なる問題も多数応用に持つ汎用性の高い問題である.この問題に対し,動的計画法などの厳密解法とメタ戦略のハイブリッドを試み,一定の成果をあげることができた.また,集配を伴うより一般的な問題に対して集合被覆に基づくメタ戦略アルゴリズムの開発も検討した.この他,汎用性の高い基礎的な問題として,グラフ彩色問題に関していくつかの基礎的な性質を解明した.

Report

(3 results)
  • 2007 Annual Research Report
  • 2006 Annual Research Report
  • 2005 Annual Research Report
  • Research Products

    (19 results)

All 2008 2007 2006 2005

All Journal Article (13 results) (of which Peer Reviewed: 2 results) Presentation (5 results) Book (1 results)

  • [Journal Article] Iterated Local Search Algorithm for the Vehicle Routing Problem with Convex Time Penalty Functions2008

    • Author(s)
      T. Ibaraki, S. Imahori, K. Nonobe, K. Sobue, T. Uno and M. Yagiura
    • Journal Title

      Discrete Applied Mathematics

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Analysis of an Edge Coloring Algorithm Using Chernoff Bounds2007

    • Author(s)
      X. Xie, M. Yagiura, T. Ono and T. Hirata
    • Journal Title

      Information Technology Letters 6

      Pages: 13-16

    • NAID

      110006380993

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] 局所探索法-反復改善に基づく最適化の基本戦略2007

    • Author(s)
      柳浦睦憲
    • Journal Title

      オペレーションズ・リサーチ 52

      Pages: 538-542

    • NAID

      110006380766

    • Related Report
      2007 Annual Research Report
  • [Journal Article] Duality in Option Pricing Based on Prices of Other Derivatives2007

    • Author(s)
      M.Nishihara, M.Yagiura, T.Ibaraki
    • Journal Title

      Operations Research Letters 35

      Pages: 165-171

    • Related Report
      2006 Annual Research Report
  • [Journal Article] A 3-Flip Neighborhood Local Search for the Set Covering Problem2006

    • Author(s)
      M.Yagiura, M.kishida, T.Ibaraki
    • Journal Title

      Journal of Operational Research 172

      Pages: 472-499

    • Related Report
      2006 Annual Research Report
  • [Journal Article] One-Dimensional Cutting Stock Problem with a Given Number of Setups : A Hybrid Approach of Metaheuristics and Linear Programming2006

    • Author(s)
      S.Umetani, M.Yagiura, T.Ibaraki
    • Journal Title

      Journal of Mathematical Modelling and Algorithms 5

      Pages: 43-64

    • Related Report
      2006 Annual Research Report
  • [Journal Article] Vehicle Routing Problem with Flexible Time Windows and Traveling Times2006

    • Author(s)
      H.Hashimoto, T.Ibaraki, S.Imahori, M.Yagiura
    • Journal Title

      Discrete Applied Mathematics 154

      Pages: 2271-2290

    • Related Report
      2006 Annual Research Report
  • [Journal Article] 分枝限定法 - さらなる計算効率の希求2006

    • Author(s)
      柳浦睦憲, 野々部宏司
    • Journal Title

      システム/制御/情報 50

      Pages: 350-356

    • Related Report
      2006 Annual Research Report
  • [Journal Article] Path Relinking Approach with Ejection Chains for the Generalized Assignment Problem2006

    • Author(s)
      M.Yagiura, T.Ibaraki, F.Glover
    • Journal Title

      European Journal of Operational Research Vol.169

      Pages: 548-569

    • Related Report
      2005 Annual Research Report
  • [Journal Article] Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints2005

    • Author(s)
      T.Ibaraki, S.Imahori, M.Kubo, T.Masuda, T.Uno, M.Yagiura
    • Journal Title

      Transportation Science Vol.39

      Pages: 206-232

    • Related Report
      2005 Annual Research Report
  • [Journal Article] Local Search Algorithms for the Two-Dimensional Cutting Stock Problem with a Given Number of Different Patterns2005

    • Author(s)
      S.Imahori, M.Yagiura, S.Umetani, S.Adachi, T.Ibaraki
    • Journal Title

      Metaheuristics : Progress as Real Problem Solvers, (T.Ibaraki, K.Nonobe and M.Yagiura, eds.)(Springer, NY)

      Pages: 181-202

    • Related Report
      2005 Annual Research Report
  • [Journal Article] Heuristic Approaches to the Capacitated Square Covering Problem2005

    • Author(s)
      E.Boros, T.Ibaraki, H.Ichikawa, K.Nonobe, T.Uno, M.Yagiura
    • Journal Title

      Pacific Journal of Optimization Vol.1

      Pages: 465-490

    • Related Report
      2005 Annual Research Report
  • [Journal Article] Improved Local Search Algorithms for the Rectangle Packing Problem with General Spatial Costs2005

    • Author(s)
      S.Imahori, M.Yagiura, T.Ibaraki
    • Journal Title

      European Journal of Operational Research Vol.167

      Pages: 48-67

    • NAID

      110002811934

    • Related Report
      2005 Annual Research Report
  • [Presentation] A path relinking approach with an adaptive mechanism to control parameters for the vehicle routing problem with time windows2008

    • Author(s)
      H. Hashimoto and M. Yagiura
    • Organizer
      European Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP 2008)
    • Place of Presentation
      Napoli, Italy
    • Related Report
      2007 Annual Research Report
  • [Presentation] A path relinking approach for the multi-resource generalized quadratic assignment problem2007

    • Author(s)
      M. Yagiura, A. Komiya, K. Kojima, K. Nonobe, H. Nagamochi, T. Ibaraki and F. Glover
    • Organizer
      Engineering Stochastic Local Search Algorithms-Designing, Implementing and Analyzing Effective Heuristics (SLS 2007)
    • Place of Presentation
      Brussels, Belgium
    • Related Report
      2007 Annual Research Report
  • [Presentation] A set covering approach for the pickup and delivery problem with general constraints on each route2007

    • Author(s)
      H. Hashimoto, Y. Ezaki, M. Yagiura, K. Nonobe, T. Ibaraki and A. Lφkketangen
    • Organizer
      Engineering Stochastic Local Search Algorithms-Designing, Implementing and Analyzing Effective Heuristics (SLS 2007)
    • Place of Presentation
      Brussels, Belgium
    • Related Report
      2007 Annual Research Report
  • [Presentation] New bounds for the nearly equitable edge coloring problem2007

    • Author(s)
      X. Xie, M. Yagiura, T. Ono, T. Hirata and U. Zwick
    • Organizer
      International Symposium on Algorithms and Computation (ISAAC 2007)
    • Place of Presentation
      Sendai, Japan
    • Related Report
      2007 Annual Research Report
  • [Presentation] A vector assignment approach for the graph coloring problem,2007

    • Author(s)
      T. Ono, M. Yagiura and T. Hirata
    • Organizer
      Learning and Intelligent OptimizatioN Conference (LION 2007 II)
    • Place of Presentation
      Trento, Italy
    • Related Report
      2007 Annual Research Report
  • [Book] Metaheuristics : Progress as Real Problem Solvers2005

    • Author(s)
      T.Ibaraki, K.Nonobe, M.Yagiura, eds.
    • Total Pages
      414
    • Publisher
      Springer
    • Related Report
      2005 Annual Research Report

URL: 

Published: 2005-04-01   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi