| 基于模拟退火算法的物流配送路径优化问题分析 |
| |
| 引用本文： | 田昀,梁海龙.基于模拟退火算法的物流配送路径优化问题分析[J].交通科技与经济,2013,15(5):85-88. |
| |
| 作者姓名： | 田昀 梁海龙 |
| |
| 作者单位： | 1. 兰州交通大学交通运输学院,甘肃兰州,730070
2. 中铁十七局三公司,贵州凯里,556000 |
| |
| 摘 要： | 模拟退火算法是解决NP完全组合优化问题的有效近似算法，将该算法应用于路径优化问题中，利用该算法对类似货郎担问题的路径问题进行求解。针对城市道路行走不同的目标条件（路径最短、时问最短）进行优化，选择最佳行走路径，并用该算法优化得到的计算结果，结果表明该算法在解类似货郎担交通路径方面问题时具有较高的精确性。因而，该算法在解决城市道路交通问题方面具有一定的实用价值。
|
| 关 键 词： | 模拟退火算法 NP 车辆路径安排 物流配送 |
Study on optimization of logistics distribution route based on simulated annealing algorithm |
| |
| TIAN Yun
,
LIANG Hai-long.Study on optimization of logistics distribution route based on simulated annealing algorithm[J].Technology & Economy in Areas of Communications,2013,15(5):85-88. |
| |
| Authors: | TIAN Yun LIANG Hai-long |
| |
| Institution: | 2 ( 1. Lanzhou Jiaotong University, Lanzhou 730070 , China ; 2. The Third Company of China ＇ s Railway 17 th Bureau, Kaili 556000, China) |
| |
| Abstract: | The simulated annealing algorithm is an efficient approximation algorithm for NP complete combinatorial optimization problems, which is applied to optimize the route in order to solve the rout problem of similar to the traveling salesman. According to the different target conditions （shortest route, the shortest time）, the city road optimization for walking is proposed on how to choose the best path calculated with this algorithm. The results show that the algorithm has a higher accuracy in the solution to the traveling salesman problem,which serves a certain practical value in solving the city traffic problem. |
| |
| Keywords: | simulated annealing algorithm NP problem VRP logistics distribution |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
