This paper examines the structure of many-to-many logistics networks. Using as little data as possible, it attempts to answer macroscopic questions such as: How many terminals should be used? Should they be used at all? What should be the frequency of service? Although such a problem could be formulated with a large number of parameters and data, we show that near-optimal network structures can be characterized by two dimensionless constants which can be determined from the data (e.g., from the value of the items carried, the number of origins, the size of the service region, etc …). The...