On the complexity of the k-customer vehicle routing problem

Authors:
Refael Hassin;Shlomi Rubinstein
Affiliations:
Department of Statistics and Operations Research, School of Mathematical Sciences, Tel-Aviv University, Tel-Aviv 69978, Israel;Department of Statistics and Operations Research, School of Mathematical Sciences, Tel-Aviv University, Tel-Aviv 69978, Israel
Venue:
Operations Research Letters
Year:
2005

Citing 3
Cited 5

On the k-path partition of graphs

Theoretical Computer Science
On the completeness of a generalized matching problem

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Differential approximation for some routing problems

CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity

Minimum-weight cycle covers and their approximability

Discrete Applied Mathematics
Minimum-weight cycle covers and their approximability

WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Approximation algorithms for restricted cycle covers based on cycle decompositions

WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
On approximating restricted cycle covers

WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Approximate algorithms with estimates for routing problems on random inputs with a bounded number of customers per route

Automation and Remote Control

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the complexity of the k-CUSTOMER VEHICLE ROUTING PROBLEM: Given an edge weighted graph, the problem requires to compute a minimum weight set of cyclic routes such that each contains a distinguished depot vertex and at most other k customer vertices, and every customer belongs to exactly one route.