An Efficient Method for the Multi-Depot Location—Allocation Problem

This paper describes a procedure based on large-scale nonlinear programming for solving the multidepot location-allocation problem. Both the location of depots and the allocation of customers are allowed to vary simultaneously. Numerical experience on a 5 x 50 and a 10 x 50 example is described, and possible extensions to the basic model are discussed.