Abstract
The benefits of simultaneous consideration of siting and sizing of distribution centers have been well acknowledged in supply chain design. Most formulations assume that the potential DC sites are known and the decision on location is to select sites from the finite potential DC sites. However, the quality of this discrete version problem depends on the selection of potential DC sites. In this paper we present a planar version of the problem, which assumes that there is no a priori knowledge of DC sites and DCs can be located anywhere in the plane. The goal of the problem is to simultaneously find locations and sizing of DC sites. The solution of the planar problem provides a lower bound for the discrete problem. The objective of the problem is to minimize the total of inbound and outbound transportation costs and distribution center construction costs-which include its fixed charge cost and concave sizing cost. The problem is initially formulated as a nonlinear programming model. We then reformulate it as a set covering problem after establishing certain key properties. A greedy drop heuristic and a column generation heuristic are developed to solve the problem. Computational experiments are provided.