Load optimization in a planar network

TL;DR

This paper studies the asymptotic behavior of load distribution in a planar network with three bins and many objects, comparing optimal and cost-based allocations, and deriving their probabilistic properties.

Contribution

It provides the first detailed asymptotic analysis of two different allocation strategies in a Euclidean network with explicit formulas.

Findings

Both allocations share the same law of large numbers.

They exhibit different asymptotic fluctuations.

Their rate functions differ significantly.

Abstract

We analyze the asymptotic properties of a Euclidean optimization problem on the plane. Specifically, we consider a network with three bins and $n$ objects spatially uniformly distributed, each object being allocated to a bin at a cost depending on its position. Two allocations are considered: the allocation minimizing the bin loads and the allocation allocating each object to its less costly bin. We analyze the asymptotic properties of these allocations as the number of objects grows to infinity. Using the symmetries of the problem, we derive a law of large numbers, a central limit theorem and a large deviation principle for both loads with explicit expressions. In particular, we prove that the two allocations satisfy the same law of large numbers, but they do not have the same asymptotic fluctuations and rate functions.