集装箱单箱混合装载优化方法研究

北京理工大学珠海学院2020届本科生毕业论文AbstractBin-packing problem ,a complete NP problem,is widely used in daily productionand life.As a complex multi-objective multi-constraint problem involving volume,weight,and layout,with a large number ofinterferences by local extreme point in thesolution process,which can only be approximated.At present,the method mainlyused for solving the packing problem can only rely on solving the non-NP problem toobtain an approximate optimal solution close to the optimal solution.The mainrepresentatives are numerical optimization methods (optimal algorithms),constructionalgorithms (including NF approximation algorithms,BF approximation algorithms,etc.),intelligent optimization algorithms represented by PSO,GA,etc.This articleuses Company A as an example to analyze its current freight operations and containerloading modes.Using the PSO (Partical Swarm Optimization)and the Bottom-upleft-justified algorithm that combines the theory of remaining space and binary treetheory.Limited to a special packing problem combined with the knapsack problem,mathematical models are established for research in order to attain the goals ofoptimizing loading layouts,changing freight modes and enhancing productionefficiency.Keywords:Bin-packing problem;Knapsack problem;Partical Swarm Optimization;Binary Tree theory of remaining space;Bottom-up left-justified algorithm