关键词: 整车物流, 线性规划, 动态规划, 穷举法, 计算机仿真

Abstract: The car carrier load transportation allocation problem is a typical problem in vehicle logistics. In order to improve the efficiency of transport and reduce the cost, this problem was studied by adopted hypothetical data and requirements. All the load combinations whose utilization factor of the length of sweeping board is more than 95% established a matrix. Then the dynamic programming obtained the number of car carrier to the corresponding loading plan. By using the exhaustion method, through computer simulation, loading plan of each layer of car carrier was randomly produced, strictly meeting the loading requirements of each car at the same time. The space of the car carrier was saved as much as possible, and then the optimal loading plan was picked up from feasible solutions. The two kinds of method were analyzed to get the optimal solution.

Key words: vehicle logistics, linear programming, dynamic programming, enumeration method, computer simulation