CAJ | 학술논문

如何装载商品使经济利益最大化是物流配载装箱问题中划分出的子问题。该子问题被抽象为0-1背包问题，根据动态规划算法建立数学模型，分析其优点，并用JAVA语言得以实现。最后给出测试实例，得出动态规划法具有高效性的特点，该算法可以广泛使用于物流领域。
여하장재상품사경제이익최대화시물류배재장상문제중화분출적자문제。해자문제피추상위0-1배포문제，근거동태규화산법건립수학모형，분석기우점，병용JAVA어언득이실현。최후급출측시실례，득출동태규화법구유고효성적특점，해산법가이엄범사용우물류영역。
How to load goods to get maximum economic benefits by manufacturers is a sub-problem divided from logistics dis-tribution.In this paper,the sub-problem is abstracted a 0-1 knapsack problem.We create a mathematical model based on dynamic programming algorithm,and analyze the advantages of the algorithm.Then we use JAVA language to solve the problem.After set-ting some test datum, the final results show that the dynamic programming method has efficiency,and can be applied widely.