A Quasi-polynomial Time Approximation Scheme for Euclidean CVRPTW

被引：1
|
作者：
Song, Liang [1 ,2 ]
Huang, Hejiao [1 ,2 ]
Du, Hongwei [1 ,2 ]
机构：
[1] Harbin Inst Technol, Shenzhen Grad Sch, Shenzhen, Peoples R China
[2] Shenzhen Key Lab Internet Informat Collaborat, Shenzhen, Peoples R China
来源：
COMBINATORIAL OPTIMIZATION AND APPLICATIONS (COCOA 2014) | 2014年 / 8881卷
基金：
中国国家自然科学基金;
关键词：
Modern logistics; CVRPTW; Approximation algorithm; VEHICLE-ROUTING PROBLEM; SCHEDULING PROBLEM; HANDLING TIMES;
D O I：
10.1007/978-3-319-12691-3_6
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
The capacitated vehicle routing problem with time windows (CVRPTW) is a variant of the classical vehicle routing problem. In a category of CVRPTW, each customer has same unit-demand and must be served within a time window from a finite set of consecutive time windows. This paper gives a quasi-polynomial time approximation scheme (Q-PTAS) for this category of CVRPTW under the Euclidean setting. With a reasonable vehicle speed requirement, our algorithm could generate a set of routes of the length of (1 + O(epsilon)) OPT on expectation.
引用
收藏
页码：66 / 73
页数：8
相关论文
共 50 条
12345