| 基于改进蚁群算法的物流配送路径规划算法 |
投稿时间：2018-11-25 修订日期：2018-11-25  点此下载全文 |
| 引用本文： |
| 摘要点击次数: 196 |
| 全文下载次数: 0 |
|
| 基金项目:河南省交通运输厅科技计划项目《河南自贸区综合货运枢纽多式联运协同发展研究》（项目编号2017G9） |
|
| 中文摘要:针对物流配送的最优路径规划问题,本文在分析蚁群算法原理的基础上,运用MAKLINK图论建立物流配送路径模型,选取Dijkstra算法作为初始规划算法来确定蚁群算法的寻优目标函数,并对蚁群算法的信息素更新和节点选择进行了改进。在确定初始参数后,通过改进的蚁群算法规划出从起始点到结束点的最优路径。利用Matlab作为软件工具进行编码和仿真验证。实验结果表明,改进蚁群算法比传统蚁群算法能更好地进行路径规划,并且可以提高计算的收敛速度。 |
| 中文关键词:物流配送 改进蚁群算法 MAKLINK图论 路径规划 |
| |
| Logistics Distribution Route Planning Based on Improved Ant Colony Algorithm |
|
|
| Abstract:Aiming at the problem of optimum path planning for logistics distribution, based on the analysis of the principle of ant colony algorithm, this paper uses MAKLINK graph theory to establish the logistics distribution path model, chooses Dijkstra algorithm as the initial planning algorithm to determine the optimization objective function of ant colony algorithm, and updates the pheromone of ant colony algorithm and chooses the nodes. Improvements were made. After determining the initial parameters, an improved ant colony algorithm is used to plan the optimal path from the starting point to the end point. Using MATLAB as a software tool to code and simulate. The experimental results show that the improved ant colony algorithm is better than the traditional ant colony algorithm in path planning and can improve the convergence speed of the calculation. |
| keywords:logistics distribution improved ant colony algorithm MAKLINK graph theory path planning |
| 查看全文 查看/发表评论 下载pdf阅读器 |
位访问者,今日访问
