互联网 qkzz.net
全刊杂志网:首页 > 女性 > 文章正文
刊社推荐

一种基于Voronoi图求解车辆路径问题的混合启发式算法张志军 李 峰 曹布阳


摘 要:针对由多个配送中心和多个客户点组成的物流网络中的车辆路径问题,提出了一种基于“集群第一,路线第二”的路径优化策略,即首先使用Voronoi分割对配送区域进行划分,然后引入综合插入算法和变邻域搜索算法的混合启发式算法求解配送区域内车辆路径问题。通过算例和应用系统的分析与验证表明,该混合算法既能获取质量较优解,同时也具有较好的实时性,能较好地满足实际应用需求。
  关键词:Voronoi分割; 混合启发式算法; 插入式算法; 变邻域搜索; 邻接信息
  中图分类号:TP301.6
  文献标志码:A
  
  文章编号:1001-3695(2010)02-0515-04
  doi:10.3969/j.issn.1001-3695.2010.02.031
  
  Hybrid heuristic algorithm using Voronoi diagram forvehicle routing problem
  
  ZHANG Zhi-jun1, LI-Feng1 , CAO Bu-yang2
  
  (1.School of Computer Science & Telecommunication Engineering, Jiangsu University, Zhenjiang Jiangsu 212013,China; 2.School of Software Engineering, Tongji University, Shanghai 201804, China)
  
  Abstract:This paper proposed the optimization strategy of vehicle route based on the strategy of “cluster first, route second” which aimed at the vehicle route problems made up of multiple dispatching centers and sale-points in the logistics network. Firstly, used Voronoi tessellation to divide the dispatching regions, and then introduced a hybrid heuristic algorithm which combined the plug-in algorithm and the variable neighbor search(VNS) algorithm in order to solve the optimization problems of vehicle route in dispatching regions. This hybrid algorithm can achieve a better solution to vehicle route optimization problems through the experiment results and the analysis and verification of the application system. At the same time, it also has good real-time which can better meet the needs of practical application. ......
很抱歉,暂无全文,若需要阅读全文或喜欢本刊物请联系《计算机应用研究》杂志社购买。
欢迎作者提供全文,请点击编辑
分享:
 

了解更多资讯,请关注“木兰百花园”
分享:
 
精彩图文


关键字
支持中国杂志产业发展,请购买、订阅纸质杂志,欢迎杂志社提供过刊、样刊及电子版。
关于我们 | 网站声明 | 刊社管理 | 网站地图 | 联系方式 | 中图分类法 | RSS 2.0订阅 | IP查询
全刊杂志赏析网 2017