An Iterativ Method for Location Allocation Problem

This paper is to present an iterative method for determining an optimum geographic location pattern for the warehouses (sources) that are employed to serve or supply, known quantities of its finished product to a set of custormer areas (destinations) that have fixed and known locations, where the number of sources is permitted to vary. What must be determined, in this paper, is the number and location of the sources or warehouses that will minimize the combined costs of transferring and storing the total quantity of products demanded in the destinations or customer areas.