Kolesar and Blum's square-root law: with available units spread like a
random (Poisson) pattern over a region of area area, the mean
distance from a call to the nearest available unit is \(c
\sqrt{A / (u (1 - b))}\) for units u of which a share busy b is busy;
\(c = 1/2\) in straight lines and \(\sqrt{2 \pi} / 4 \approx 0.627\)
on a rectangular street grid. Quadrupling the units halves the distance
and scaling area and units together leaves it unchanged
(proof("sqrtlw")). The busy share can come from hypq()'s workloads.
Arguments
- area
The area served: one positive number (squared distance units).
- units
The units deployed: one positive number.
- busy
The share of units busy: one number from 0, below 1.
- metric
"euclid"(straight lines) or"grid"(right-angle streets).- speed
NULLor the travel speed (distance per unit time): one positive number.
Value
A list: dist, the mean distance; const, the constant c;
avail, the units available; time, the mean travel time (NA
without speed).
References
Kolesar, P. and Blum, E. H. (1973). Square root laws for fire engine response distances. Management Science, 19(12), 1368-1378. doi:10.1287/mnsc.19.12.1368