A priority-considering approach for the multiple container loading problem. (1st January 2011)

• Record Type: Journal Article
• Authors: Ren, Jidong; Tian, Yajie; Sawaragi, Tetsuo
• Is Part Of: International journal of metaheuristics. Volume 1:Number 4(2011)
• Page Start: 298
• Page End: 316
• Publication Date: 2011-01-01
• Subjects: container loading problem -- CLP -- bin packing problem -- knapsack problem -- heuristic -- priority; Heuristic algorithms -- Periodicals; 006.3105
• DOI: 10.1504/IJMHEUR.2011.044314
• Languages: English
• ISSNs: 1755-2176

Abstract

A priority-considering heuristic approach is proposed to solve the multiple container loading problem, i.e., the problem of packing a given set of three-dimensional rectangular items into multiple containers to make the maximum use of the container space. The items with large volume are usually difficult to make efficient use of the container space. These items are set higher priority over other items, and preferentially assigned into the containers. Within the proposed approach an algorithm is used for solving the single container loading problem under the constraint of priority. The proposed approach achieves excellent results for the test cases suggested by Ivancic et al. and Mohanty et al. with reasonable computing time.