动态规划算法在物流配送装箱问题中的应用

Application of Dynamic Programming Algorithmin Logistics Distribution Packing Problem

针对物流配送装箱问题中的一个子类问题,基于动态规划算法,采取0-1背包问题作为数学模型,给出了相关求解方案。给出了该子类问题的形式化描述,介绍了动态规划算法实现的必要条件,建立了该子类问题的数学推导模型,给出了相关实现算法,并给出具体的应用实例。

In this paper, in view of a subclass of the packing problem in logistics distribution and on the basis of dynamic programming algorithm, we established a 0-1 knapsack model, presented the formal description of the subclass of problem, introduced the necessary condition for the realization of the dynamic programming algorithm, built hte mathematical inference model for the problem and gave the corresponding algorithm for its realization. At the end, we applied the model in an empirical example.