A heuristic algorithm for the container loading problem with complex loading constraints

DOI Web Site 参考文献9件 オープンアクセス
  • IWASAWA Hiroki
    Dept. Computational Science and Engineering, Graduate School of Engineering, Nagoya University
  • HU Yannan
    Dept. Computer Science and Mathematical Informatics, Graduate School of Information Science, Nagoya University
  • HASHIMOTO Hideki
    Dept. Logistics and Information Engineering, Tokyo University of Marine Science and Technology
  • IMAHORI Shinji
    Dept. Information and System Engineering, Faculty of Science and Engineering, Chuo University
  • YAGIURA Mutsunori
    Dept. Computer Science and Mathematical Informatics, Graduate School of Information Science, Nagoya University

抄録

In this paper, we propose a heuristic algorithm for a container loading problem for logistic platforms, which is the problem for the Challenge Renault/ESICUP 2015. The three-dimensional container loading problem involves packing a set of cuboid items into bins so as to minimize the total volume used. In this paper, we propose an effective approach to solve this problem based on a greedy strategy. We first generate high-quality stacks that consist of some items and then pack these stacks on the floor of bins, considering the resulting problem as a two-dimensional bin packing problem. The proposed algorithm is tested on a series of instances provided for the challenge. The computational results show that the proposed algorithm performs well on these instances.

収録刊行物

参考文献 (9)*注記

もっと見る

関連プロジェクト

もっと見る

キーワード

詳細情報 詳細情報について

問題の指摘

ページトップへ