Applying DBR and MAS to Solving Container Loading Problem (特集 運輸分野におけるソフトコンピューティングの応用)

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• 日本知能情報ファジィ学会の論文
• 2006-12-15

著者

• Liu Yuan

  Kyoto University

• Tian Yajie

  Bigbang Inc.

• SAWARAGI Tetsuo

  Kyoto University

• LIU Yuan

  Graduate School of Engineering, Kyoto University

• TIAN Yajie

  Logistic System Group, Bigbang INC.

• SAWARAGI Tetsuo

  Graduate School of Engineering, Kyoto University

• Sawaragi Tetsuo

  Graduate School Of Engineering Kyoto University

関連論文

• Application of multi-agent system to solving container loading problem
• Applying DBR and MAS to Solving Container Loading Problem (特集 運輸分野におけるソフトコンピューティングの応用)
• Incremental acquisition of behaviors and signs based on a reinforcement learning schemata model and a spike timing-dependent plasticity network
• Preface

スポンサーリンク