On a capacitated multivehicle routing problem

Authors:
Xiaojie Gao;Leonard J. Schulman
Affiliations:
Caltech, Pasadena, CA, USA;Caltech, Pasadena, CA, USA
Venue:
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Year:
2008

Citing 6
Cited 0

Next century challenges: mobile networking for “Smart Dust”

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
The Earth Mover's Distance as a Metric for Image Retrieval

International Journal of Computer Vision
An overview of vehicle routing problems

The vehicle routing problem
Smart Dust: Communicating with a Cubic-Millimeter Computer

Computer
An approximation algorithm for the pickup and delivery vehicle routing problem on trees

Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Vehicle Routing Problem (VRP) is a discrete optimization problem with high industrial relevance and high computational complexity. The problem has been extensively studied since it was introduced by Dantzig and Ramser. In this paper, we present a version of the VRP motivated by mobile sensor networks which we call the Capacitated Multivehicle Routing Problem (CMVRP). Our objective is to determine the minimum amount of energy required to serve all jobs, which takes into account both the service requirement and the travel overhead. We present a constant factor approximation algorithm for the off-line case and a distributed algorithm for the on-line problem that uses only a constant factor more energy than the off-line solution.