The Research Of The Optimization Algorithm Of The Container Loading Problem

The thesis is concerned with container loading problem (CLP), which has widely consist in the carrying trade. In allusion to lowness of the efficiency and the benefit of the CLP in actual work presently, the thesis mainly studies algorithms that can greatly improve the space utilization in a container. And the thesis has given a new algorithm in the condition of the weakly heterogeneous, which is the most familiar branch of the CLP in actual work. Firstly, the thesis introduces the background of the CLP and some correlative fundamental conceptions. Secondly, the thesis expounds the development about the CLP at home and abroad, and points out the strongpoint and limitation of some classic algorithms, by systematically analyzing and evaluating. Thirdly, by the contrast of the aforementioned algorithms, the article considers that if to use the single heuristic algorithms or single genetic algorithms or the simple integration of them to solve the CLP, which is belong to NP-hard problems, there are many defaults they cannot overcome. So the thesis brings forth a hybrid GA based on the heuristic rule and modified adaptive probabilities of crossover and mutation to try to solve the CLP. Finally, by the simulate experiments, the article obtains the preferable result it expects, which shows the algorithm the thesis gives is feasible and efficiency to the CLP.