Dividing a Territory Among Several Vehicles

Authors:
John Gunnar Carlsson
Affiliations:
Industrial and Systems Engineering, University of Minnesota, Minneapolis, Minnesota 55455
Venue:
INFORMS Journal on Computing
Year:
2012

Citing 12
Cited 1

Triangulating a simple polygon in linear time

Discrete & Computational Geometry
Estimating the length of the optimal TSP tour: an empirical study using regression and neural networks

Computers and Operations Research
On-line Load Balancing

Developments from a June 1996 seminar on Online algorithms: the state of the art
Geodesic Ham-Sandwich Cuts

Discrete & Computational Geometry
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)

The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
Decentralized vehicle routing in a stochastic and dynamic environment with customer impatience

Proceedings of the 1st international conference on Robot communication and coordination
A theorem on polygon cutting with applications

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Minimum-Cost Load-Balancing Partitions

Algorithmica
Equitable subdivisions within polygonal regions

Computational Geometry: Theory and Applications - Special issue on the Japan conference on discrete and computational geometry 2004
Equitable partitioning policies for robotic networks

ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Finding equitable convex partitions of points in a polygon efficiently

ACM Transactions on Algorithms (TALG)
Semi on-line algorithms for the partition problem

Operations Research Letters

Dividing a Territory Among Several Facilities

INFORMS Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider an uncapacitated stochastic vehicle routing problem in which vehicle depot locations are fixed, and client locations in a service region are unknown but are assumed to be independent and identically distributed samples from a given probability density function. We present an algorithm for partitioning the service region into subregions so as to balance the workloads of all vehicles when the service region is simply connected and point-to-point distances follow some “natural” metric, such as any Lp norm. This algorithm can also be applied to load balancing of other combinatorial structures, such as minimum spanning trees and minimum matchings.