首页 | 官方网站   微博 | 高级检索  
     

一种基于Voronoi图求解车辆路径问题的混合启发式算法
引用本文:张志军,李峰,曹布阳. 一种基于Voronoi图求解车辆路径问题的混合启发式算法[J]. 计算机应用研究, 2010, 27(2): 515-518. DOI: 10.3969/j.issn.1001-3695.2010.02.031
作者姓名:张志军  李峰  曹布阳
作者单位:1. 江苏大学,计算机科学与通信工程学院,江苏,镇江,212013
2. 同济大学,软件学院,上海,201804
摘    要:针对由多个配送中心和多个客户点组成的物流网络中的车辆路径问题,提出了一种基于“集群第一,路线第二”的路径优化策略,即首先使用Voronoi分割对配送区域进行划分,然后引入综合插入算法和变邻域搜索算法的混合启发式算法求解配送区域内车辆路径问题。通过算例和应用系统的分析与验证表明,该混合算法既能获取质量较优解,同时也具有较好的实时性,能较好地满足实际应用需求。

关 键 词:Voronoi分割; 混合启发式算法; 插入式算法; 变邻域搜索; 邻接信息

Hybrid heuristic algorithm using Voronoi diagram for vehicle routing problem
ZHANG Zhi-jun,LI-Feng,CAO Bu-yang. Hybrid heuristic algorithm using Voronoi diagram for vehicle routing problem[J]. Application Research of Computers, 2010, 27(2): 515-518. DOI: 10.3969/j.issn.1001-3695.2010.02.031
Authors:ZHANG Zhi-jun  LI-Feng  CAO Bu-yang
Affiliation:1.School of Computer Science & Telecommunication Engineering/a>;Jiangsu University/a>;Zhenjiang Jiangsu 212013/a>;China/a>;2.School of Software Engineering/a>;Tongji University/a>;Shanghai 201804/a>;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 dispatch...
Keywords:Voronoi tessellation   hybrid heuristic algorithm   CI   VNS   adjacency information
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号