An interval programming model and algorithm for distribution centers layout problems

Distribution centers layout is an important decision making problem in supply chain management of modern enterprises, but the precise values of some parameters are difficult to obtain, so it is reasonable to denote this type of problem by uncertain programming. An interval programming model for distribution centers layout is presented in this paper, in which both customers' demands for products and production capacity of branch plants are treated as interval coefficients. According to the definition of inequality relation between interval numbers, a method for converting objective function and constraints to their crisp equivalents is discussed, then the interval programming model is converted to equivalent crisp bi-objective programing model, and an algorithm is presented to obtain all Pareto solutions of the model.