| 一种新的基于最小生成树的物流配送优化路线算法 |
| |
| 引用本文： | 杨跃武.一种新的基于最小生成树的物流配送优化路线算法[J].计算技术与自动化,2008,27(3):7-11. |
| |
| 作者姓名： | 杨跃武 |
| |
| 作者单位： | 佛山科学技术学院,机电与信息工程学院,广东,佛山,528000 |
| |
| 基金项目： | 国家自然科学基金，湖南省自然科学基金 |
| |
| 摘 要： | 提出一种基于树理论算法的物流配送线路优化决策，首先将复杂的道路网转化成最少生成树并建立优化转移策略，开发由最少生成树构造最小生成树的算法，通过对最小生成树进行标记的方法最后得到最优路径，使物流配送的周转总量最小。算法用Jbuilder9开发，运行表明所提出的算法是有效的，简化以往算法的复杂程度。
|
| 关 键 词： | 物流配送 最小生成树 配送节点 配送线路 车辆路径问题(VRP) |
A New Algorithm for Vehicle Routing Problems with Capacity Limited Based on the Minimum Spanning Tree |
| |
| YANG Yue-wu.A New Algorithm for Vehicle Routing Problems with Capacity Limited Based on the Minimum Spanning Tree[J].Computing Technology and Automation,2008,27(3):7-11. |
| |
| Authors: | YANG Yue-wu |
| |
| Affiliation: | YANG Yue-wu (College of Electromechanics & Information Engineering,Foshan University,Foshan 528000,China) |
| |
| Abstract: | An optimized strategy is proposed to investigated the vehicle routing problems.We build here a descrtion of the routing net with minimum spanning trees and decision to search the nearest approach.An algorithm is developed to obtain min-spanning 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 concise,and simplfies the comp... |
| |
| Keywords: | distribution delivers the minimum spanning tree distribution node distribution routing vehicle routing problem(VRP) |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算技术与自动化》浏览原始摘要信息 |
|
点击此处可从《计算技术与自动化》下载全文 |
