| 邓灵斌，邵 军.改进蚁群算法在合肥市包河区果蔬配送中的应用研究[J].,2015,16(6):23-28 |
| 改进蚁群算法在合肥市包河区果蔬配送中的应用研究 |
| Application of Improved and Colony Algorithm in the Baohe District of Hefei city Distribution of Fruits and Vegetables |
| 投稿时间：2015-09-15 |
| DOI： |
| 中文关键词: 路径问题 改进蚁群算法 果蔬配送 |
| English Keywords:routing problem improved ant colony algorithm fruit and vegetable distribution |
| Fund Project: |
|
| 摘要点击次数: 1005 |
| 全文下载次数: 959 |
| 中文摘要: |
| 路径优化是运输过程中必须考虑的问题。合理的路径既节省时间成本，又提高工作效率。文章引入蚁群算法和改进蚁群算法，利用算法的优越性，解决合肥市包河区处于快速发展状态下居民对果蔬需求的现实性，进而需要研究果蔬配送过程的路径问题，基于找出最优路径解，运用蚁群算法与改进蚁群算法解决果蔬配送，并对两种算法求出的解进行对比分析，找出最短路径，结果说明解决包河区果蔬配送路径的必要性，也说明算法在新环境中的适应性。 |
| English Summary: |
| Routing optimization must be considered in the process of transportation.Reasonable paths can save time and improve the working efficiency at well.So ant colony algorithm and its improved algorithm are introduced with their superiority to solve the problem in distribution routings with the reality that residents' demand for fruits and vegetables in Baohe area are under a state of rapid development.Based on finding the optimal path,the solutions of two algorithms are compared to find out the shortest path.The results illustrate the necessity of solving the distribution routings of fruits and vegetables in Baohe area,and also show that the algorithms are adaptive in a new environment. |
| 查看全文 查看/发表评论 下载PDF阅读器 |
|
| 关闭 |