Answers are grounded in this paper and cite their sources.
One of the most common strategies used in large-scale logistics problems is districting, in which one divides a service region into smaller pieces. This is particularly useful when one does not know the true locations of demand, but has only limited information such as a probability distribution or a small set of sample data. In “Wasserstein Distance and the Distributionally Robust TSP,” Carlsson et al. show how to partition a region so as to balance the traveling salesman tours of a set of unknown points, using a distributionally robust method defined by a bound on the Wasserstein distance to a set of landmark points.
No takes yet. Share an insight, caveat, or question.
Carlsson et al. (2018) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: