Applying DBR and MAS to Solving Container Loading Problem

• LIU Yuan

  Graduate School of Engineering, Kyoto University

• TIAN Yajie

  Logistic System Group, Bigbang INC.

• SAWARAGI Tetsuo

  Graduate School of Engineering, Kyoto University

抄録

The container loading problem, a real hard problem, is usually difficult to obtain even a suboptimal solution because of not only multiple complicated restrictions but also of multiple objectives. In this paper, a heuristic algorithm is proposed for solving the container loading problem in the real-world. The algorithm is based on Drum-Buffer-Rope presented in the Theory of Constraints and the multi-agent cooperative negotiation strategy. A particular attention is focused on improving the constrained agent by striving for the trade-off of restrictions and cooperative negotiations, so that the final solution can arrive its biggest profit. Since many real-world problems are restricted by many complicated restriction that are difficult to be satisfied simultaneously, a method used by human experts called restriction relaxation is embedded in the proposed algorithm, which makes the algorithm have a high degree of flexibility. In this paper, the proposed algorithm is also compared with other two classical optimization algorithms based on Local Search and Tabu Search.

収録刊行物

• 知能と情報

  知能と情報 18 (6), 837-848, 2006

  日本知能情報ファジィ学会

キーワード

• Container loading problem
• Drum-Buffer-Rope
• Multi-agent system

詳細情報

• CRID: 1390001205185586816
• NII論文ID: 110005716921
• NII書誌ID: AA1181479X
• DOI: 10.3156/jsoft.18.837
• ISSN: 18817203
• ISSN: 13477986
• NDL書誌ID: 8620869
• Web Site: https://ndlsearch.ndl.go.jp/books/R000000004-I8620869
• 本文言語コード: en
• データソース種別:
  • JaLC
  • NDL
  • Crossref
  • CiNii Articles
• 抄録ライセンスフラグ: 使用不可