首页 | 本学科首页   官方微博 | 高级检索  
     

一种基于蚁群算法的物流配送VRP 解决方案
引用本文:薛戈丽,王建平.一种基于蚁群算法的物流配送VRP 解决方案[J].计算机系统应用,2012,21(2):200-203.
作者姓名:薛戈丽  王建平
作者单位:1. 河南质量工程职业学院信息工程系,平顶山,467000
2. 河南科技学院信息工程学院,新乡,453003
摘    要:物流配送是目前物流发展的新趋势,在物流配送中,配送路径规划对于顾客的满意度以及经营总成本有相当大的影响。通过应用蚁群算法,实现了物流配送VRP的优化过程,建立的算法能在短时间内找到最佳车辆数及对应的最佳配送路径。通过数据测试,发现该算法收敛性较好,在较高服务水平的基础上,明显降低了配送成本。

关 键 词:蚁群算法  物流配送  VRP  路径规划
收稿时间:2011/5/24 0:00:00
修稿时间:2011/6/23 0:00:00

VRP Solution of Logistics Distribution Based on Ant Colony Algorithm
XUE Ge-Li and WANG Jian-Ping.VRP Solution of Logistics Distribution Based on Ant Colony Algorithm[J].Computer Systems& Applications,2012,21(2):200-203.
Authors:XUE Ge-Li and WANG Jian-Ping
Affiliation:(Henan Quality Polytechnic Institute, Pingdingshan 467000, China) 2(Henan Institute of Science and Technology, Xinxiang 453003, China)
Abstract:At present, logistics distribution is the new trends of logistics, in logistics distribution, the distribution path planning is the main reason for the customer satisfaction and the total Operating costs. Using the ant colony optimization algorithm, we realize the optimization process of VRP problem for logistics distribution, the algorithm can find the best vehicle numbers and the relation path in a short time. By testing the algorithm, we find that the Convergence of the algorithm is good, when it reaches the high level of the service, the cost logistics distribution can reduce quickly.
Keywords:ant colony algorithm  logistics distribution  VRP  path planning
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机系统应用》浏览原始摘要信息
点击此处可从《计算机系统应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号