Container Loading Problem Of Weight Limit

Container Loading Problem (CLP) is a typical optimal problem in logistics. It has great value to be researched. Existing models on CLP always put their focus on space constraints while actually weight constraints are also indispensable. Weight constraints maybe contain the total load or the axis load. Therefore, Container Loading Problem with Weight Limit (CLP-WL) has its profound meaning in reality. It is a new branch on CLP and there is no systematic research in and abroad.This paper is researched on CLP-WL. It first introduces the background and meaning on CLP-WL, then outlines the basic definition of Packing Problem (PP) and CLP, and also give out some notes of paper reading. Then describes CLP-WL and brings forward a model for CLP-WL. With the model two exact algorithms are made for the problem, but unfortunately they are for small-scale test case only. So next we designs and implements a heuristic for CLP-WL. At the end of this paper, we present the algorithm for test case generation and the experiment results. Small- scale cases are for the exact algorithm and normal case for heuristics. The results show the models and heuristics which designed in this paper are effective and efficient.