On the complexity of the k-customer vehicle routing problem

On the complexity of the k-customer vehicle routing problem

0.00 Avg rating—0 Votes
Article ID: iaor2005546
Country: Netherlands
Volume: 33
Issue: 1
Start Page Number: 71
End Page Number: 76
Publication Date: Jan 2005
Journal: Operations Research Letters
Authors: ,
Keywords: combinatorial analysis
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 customers vertices, and every customer belongs to exactly one route.

Reviews

Required fields are marked *. Your email address will not be published.