基于动态规划的商品装载问题及JAVA实现  

Implementing Dynamic Programming Problem of Loading Goods in JAVA Language

作　　者：顾桓瑜 GU Huan-yu （College of Software, Dalian Jiaotong University, Dalian 116052, China）

机构地区：[1]大连交通大学软件学院,辽宁大连116052

出　　处：《电脑知识与技术》2014年第4期2401-2403,2469,共4页Computer Knowledge and Technology

摘　　要：如何装载商品使经济利益最大化是物流配载装箱问题中划分出的子问题。该子问题被抽象为0-1背包问题,根据动态规划算法建立数学模型,分析其优点,并用JAVA语言得以实现。最后给出测试实例,得出动态规划法具有高效性的特点,该算法可以广泛使用于物流领域。How to load goods to get maximum economic benefits by manufacturers is a sub-problem divided from logistics distribution.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 setting some test datum,the final results show that the dynamic programming method has efficiency,and can be applied widely.

关 键 词：动态规划 装载问题 JAVA语言 

分 类 号：TP31[自动化与计算机技术—计算机软件与理论;自动化与计算机技术—计算机科学与技术]