ハイブリッドタブーサーチによる階層型ロジスティクスの最適化 Hybrid Tabu Search Approach for Hierarchical Logistics Optimization

この論文にアクセスする

この論文をさがす

著者

抄録

Recent globalization of market raises outstandingly the importance of logistic optimization toward just-in-time and agile manufacturing. With this point of view, in this study, we have formulated a site location and route selection problem as a <I>p</I>-Hub problem with capacity constraints. It refers to a non-linear integer programming deciding simultaneously location of hubs and routes from plants to customers via hub facilities. To solve the problem practically as well as efficiently, we have developed a new and novel meta-heuristic method termed hybrid tabu search and implemented it in a hierarchical manner. It relies on a tabu search as the upper level algorithm, and a revised Dijkstra method under Lagrange relaxation for capacity constraints as the lower one. To accelerate the efficiency, we give unique methods to generate an initial hub location based on the minimum spanning tree of the nodes, and to adjust the Lagrange multipliers in imitation of auction mechanism regarding transport cost. Moreover, we adopt a multi-start routine in the aid of ant method to prevent from trapping into the local optimum. Through the numerical experiments that outperformed two popular commercial software, we confirmed effectiveness of the proposed method even for real-life applications.

収録刊行物

  • システム制御情報学会論文誌

    システム制御情報学会論文誌 17(6), 241-248, 2004-06-15

    一般社団法人 システム制御情報学会

参考文献:  16件中 1-16件 を表示

被引用文献:  5件中 1-5件 を表示

各種コード

  • NII論文ID(NAID)
    10013169806
  • NII書誌ID(NCID)
    AN1013280X
  • 本文言語コード
    JPN
  • 資料種別
    ART
  • ISSN
    13425668
  • NDL 記事登録ID
    6966652
  • NDL 雑誌分類
    ZM11(科学技術--科学技術一般--制御工学)
  • NDL 請求記号
    Z14-195
  • データ提供元
    CJP書誌  CJP引用  NDL  J-STAGE 
ページトップへ