A Tight Approximation Algorithm for Multi-Vehicle CVRP with Unsplittable Demands on a Line |
| |
Authors: | Wu Yuanxiao Lu Xiwen |
| |
Institution: | 1.School of Science, East China University of Science and Technology, Shanghai, 200237, China ; |
| |
Abstract: | In this paper, the authors study the multi-vehicle capacitated vehicle routing problem on a line-shaped network with unsplittable demand. The objective is to find a transportation scheme to minimize the longest distance traveled by a single vehicle such that all the customers are served without violating the capacity constraint. The authors show that this problem has no polynomial-time algorithm with performance ratio less than 2 on condition that P ≠ NP, and then provide a 2-approximation algorithm. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|