Study And Application On Solving Container Loading Problem With Multi-drop Constraints

The thesis is about how to solve container loading problems (CLP) with multi-drop constrains that exists really in logistics. At present, these problem cause lower efficiency and benefit in practice. Among the problems, the thesis focuses on weakly heterogeneous CLP.It is attched to find out the solution to the problems and offers a new arithmetic. It maximizes the volume utility of containing boxes. It makes sure that when each drop-off point is reached, the relevant boxes must be available, without rearranging others. As a result, it optimizes the methods of loading and delivering and improves the efficiency of delivery.First of all, the thesis introduces the research background and conceptions of CLP. Secondly, it describes the solutions to the problems home and abroad, compares these classical arithmetics thoroughly, and points out the virtue and shortage of them. Thirdly, according to the comparison and analysis on the characters of these arithmetics, it is found out that the CLP is one of NP-hard complete problems, there is no optimum solution presented in reasonable time-limitation. Faced with the multi-drop constraint in practice, this thesis uses the construction heuristic arithmetic, greedy solutions and tree search framework to increase the volume of the packed boxes and improve the efficiency of delivery.Finally, the thesis gives a computer-based CLP program to find out a solution to loading and unloading boxes, using Visual Basic 6.0 integrated-developing environment. The program can meet the system requirements and improve the volume utility of the container and offer the lists of boxes under the multi-drop constraints. By the simulate experiments, it proves that the arithmetic of the thesis is feasible and effective compared with the former arithmetic in fact.