On a Labeled Vehicle Routing Problem

Authors:
Hatem Chatti;Laurent Gourvès;Jérôme Monnot
Affiliations:
LAMSADE, CNRS FRE 3234 & Universitéé de Paris-Dauphine,;LAMSADE, CNRS FRE 3234 & Universitéé de Paris-Dauphine,;LAMSADE, CNRS FRE 3234 & Universitéé de Paris-Dauphine,
Venue:
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Year:
2009

Citing 7
Cited 0

The minimum labeling spanning trees

Information Processing Letters
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
On the completeness of a generalized matching problem

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
On Labeled Traveling Salesman Problems

ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
Approximation algorithms for some vehicle routing problems

Discrete Applied Mathematics
The labeled perfect matching in bipartite graphs

Information Processing Letters
The path partition problem and related problems in bipartite graphs

Operations Research Letters

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we study the complexity and (in)approximability of the minimum label vehicle routing problem. Given a simple complete graph G = (V,E) containing a special vertex 0 called the depot and where the edges are colored (labeled), the minimum label k-vehicle routing problem consists in finding a k-vehicle routing E驴, i.e. a collection of cycles of size at most k + 1 which all contain the depot 0, and such that every customer v 驴 V 驴 {0} is visited once, minimizing the number of colors used.