一种新的基于最小生成树的物流配送优化路线算法  

A New Algorithm for Vehicle Routing Problems with Capacity Limited Based on the Minimum Spanning Tree

作　　者：杨跃武[1] 

机构地区：[1]佛山科学技术学院机电与信息工程学院,广东佛山528000

出　　处：《计算技术与自动化》2008年第3期7-11,共5页Computing Technology and Automation

基　　金：国家自然科学基金(60474029;60404007;60334030));湖南省自然科学基金(08JJ3126)

摘　　要：提出一种基于树理论算法的物流配送线路优化决策,首先将复杂的道路网转化成最少生成树并建立优化转移策略,开发由最少生成树构造最小生成树的算法,通过对最小生成树进行标记的方法最后得到最优路径,使物流配送的周转总量最小。算法用Jbuilder 9开发,运行表明所提出的算法是有效的,简化以往算法的复杂程度。An optimized strategy is proposed to investigated the vehicle routing problems. We build here a desertion of the routing net with minimum spanning trees and decision to search the nearest approach. An algorithm is developed to obtain minspanning from spanning trees. By dotting the min- spanning tree, we obtain the optimized route such that the cycle capacity keep minimum. The corresponding algorithm is realized with Jbuild 9, which shows that our algorithm proposed here is valid and conelse, and simplfies the complexcity of previous results.

关 键 词：物流配送 最小生成树 配送节点 配送线路 车辆路径问题(VRP) 

分 类 号：TP181[自动化与计算机技术—控制理论与控制工程]