基于树型动态规划的物流配送中心选址算法  

The Algorithm of Logistics Distribution Center Location Based on the Tree Structure of Dynamic Programming

作　　者：卓婧婧[1] 贾泂[1] 

机构地区：[1]浙江师范大学,浙江金华321004

出　　处：《物流科技》2013年第10期70-72,共3页Logistics Sci-Tech

摘　　要：物流配送中心选址问题在物流网络规划中占有十分重要的地位,选址的合理与否直接影响配送企业的效益。文章基于树型动态规划,提出了物流配送中心的最佳选址算法。该算法利用树型结构简化配送网络,降低了选址的复杂性,具有较高的稳定性。实验表明,相较于目前较为普遍的算法,如传统动态规划、层次分析法等,文章所提出的算法在时间上具有明显的优势。The problem of logistics distribution center location plays an important role in the logistics network planning. The benefit of enterprises is affected by location selection directly. In this paper,the best location algorithm of logistics distribution center was proposed based on the tree dynamic programming. This algorithm uses the tree structure to simplify the distribution network,and reduces the complexity of location. Moreover,it has higher stability. Experiments show this algorithm has obvious advantage on time,comparing with the convention algorithm,such as traditional dynamic programming and analytic hierarchy process.

关 键 词：树型动态规划 物流配送 配送中心选址 

分 类 号：F252.14[经济管理—国民经济]