The supply chain design problem is one of the important problems in supply chain management. In this problem, the goal is to locate several facilities for distribution centers in different geographical areas to cover customer demands. In the model presented in this paper, customer demand is met through distribution centers, while these distribution centers supply products from manufacturing plants. In this paper, a mathematical model of integer linear programming is presented that, in addition to the optimal supply chain network design, considers the facility's location. This model aims to minimize the costs of sending products from the factory to distribution centers, from distribution centers to customers, and establishing distribution centers. To evaluate the proposed model, different network samples were created randomly on small, medium and large scales for experiments. In order to perform the experiments, a linear programming solver (LP Solver) and an iterated local search algorithm were used to compare the performance of each of these methods to find the optimal solution. These experiments show the superiority of the iterated local search algorithm compared to LP Solver in achieving the optimal solution in the shortest runtime for all instances.
