|本期目录/Table of Contents|

[1]刘旺盛,黄娟.需求可拆分的车辆路径问题的分段求解[J].集美大学学报(自然科学版),2011,16(1):38-44.
　LIU Wang-sheng,HUANG Juan.Two-stage Algorithm for Split Delivery Vehicle Routing Problem[J].Journal of Jimei University,2011,16(1):38-44.
点击复制

需求可拆分的车辆路径问题的分段求解(PDF)
分享到：

《集美大学学报（自然科学版）》[ISSN:1007-7405/CN:35-1186/N]

卷:
第16卷
期数:
2011年第1期
页码:
38-44
栏目:
航海技术与物流工程
出版日期:
2011-01-25

文章信息/Info

Title:
Two-stage Algorithm for Split Delivery Vehicle Routing Problem
作者:
刘旺盛1; 2; 黄娟1
(1.集美大学航海学院,福建 厦门 361021;2.厦门大学信息科学与技术学院,福建 厦门 361005)
Author(s):
LIU Wang-sheng1; 2; HUANG Juan1
(1.Navigation Institute,Jimei University,Xiamen 361021,China2.School of Computer and Information Engineering,Xiamen University,Xiamen 361005,China)
关键词:
车辆路径问题; 需求可拆分; 两阶段算法; 先分组后路径; 先路径后分组
Keywords:
vehicle routing problem; split delivery; two-stage algorithm; cluster-first-routesecond method; route-first-cluster-second method
分类号:
-
DOI:
-
文献标志码:
-
摘要:
将需求可拆分的车辆路径问题分成两阶段求解，针对单车场、单车型、无时间窗要求、纯装货或纯卸货情况，分别设计了先分组后路径及先路径后分组算法求解.通过实验表明，在成本上，先分组后路径求得的解好于先路径后分组求得的解，且比现有蚁群算法和禁忌搜索算法求得的成本更低，但先路径后分组的方法可以避免一个点的需求被拆分成两次以上满足，求解速度也更快
Abstract:
SDVRP was split into two stages to solve.In light of single-depot and single-type vehicle,with no time window,and with pure loading or discharge,two types of two-stage heuristic algorithm were designed,cluster-first-route-second method,and route-first-cluster-second method. Experiments showed that the solutions by the first method at cost were better than the second method,and than the existing ant colony algorithm and tabu search algorithm.However,the second method could save the demand of a demand point from being split into twice over to meet,and its speed of getting solutions was also faster

参考文献/References:

-

相似文献/References:

备注/Memo

备注/Memo:
-
更新日期/Last Update: 2018-06-13