| 应急物流配送优化的改进最邻近算法研究 |
| |
| 引用本文： | 李坤颖,杨扬,侯凌霞. 应急物流配送优化的改进最邻近算法研究[J]. 交通与计算机, 2011, 29(3): 40-42,46 |
| |
| 作者姓名： | 李坤颖 杨扬 侯凌霞 |
| |
| 作者单位： | 1. 昆明理工大学交通工程学院,昆明,650224
2. 广州岭南职业技术学院管理学院,广州,510663 |
| |
| 摘 要： | 应急物流配送研究的核心是最短路径选择问题。以最邻近算法为基础,针对以往只能解决一个配送仓库对应多个救灾中心问题的局限性,提出一种多个配送仓库同时对应多个救灾中心的改进最邻近优化算法。通过仿真实验证明该算法具有良好的适用性。
|
| 关 键 词： | 应急物流配送 最邻近算法 配送优化 |
Improved Nearest Neighbor Algorithm for Emergency Supplies Distribution |
| |
| LI Kunying,YANG Yang,HOU Lingxia. Improved Nearest Neighbor Algorithm for Emergency Supplies Distribution[J]. Computer and Communications, 2011, 29(3): 40-42,46 |
| |
| Authors: | LI Kunying YANG Yang HOU Lingxia |
| |
| Affiliation: | LI Kunying1 YANG Yang1 HOU Lingxia2(Faculty of Transportation Engineering,Kunming University of Science and Technology,Kunming 650224,China)1(Faculty of Management,Lingnan Institute of Technology,Guangzhou 510663,China)2 |
| |
| Abstract: | The core of emergency logistics distribution research is the shortest path selection problem.Based on the nearest neighbor algorithm,an improved nearest neighbor algorithm for many-to-many was presented to solve the problem of one-to-many in the past.The simulation results show that the algorithm has good adaptability. |
| |
| Keywords: | emergency logistics distribution nearest neighbor algorithm distribution optimization |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
