基于分支定界算法的物流配送网络优化研究  

Study of Logistics Distribution Network Optimization Based on Branch and Bound Algorithm

作　　者：阳永生[1] 

机构地区：[1]长沙民政职业技术学院文法系,长沙410004

出　　处：《数学理论与应用》2010年第1期57-61,共5页Mathematical Theory and Applications

基　　金：湖南省科技厅项目(2009JT3021)资助

摘　　要：为进一步提高物流配送网络的运行效率,以配送总里程最短为目标,建立了单配送中心的配送优化模型,提出了一种基于分枝定界法的混合求解策略。该策略能有效地避免智能启发式算法的不稳定性和传统优化算法的指数爆炸问题,对现代配送网络的建设具有一定的理论和实践意义。In order to further raise the working efficiency of logistics distribution network, a distribution optimization model in a single distribution center is established for achieving the shortest total distribution distance. And meanwhile, a mixed strategy on tile basis of branch and bound algorithm is also proposed. This strategy can effectively avoid the instability of intelligent heuristic algorithm and the exponent explosion of traditional optimization algorithm. Hence, this study is meaningful in both theory and practice as for the establishment of distribution network.

关 键 词：运筹学 物流配送 优化 分枝定界法 

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