A robust approach to multi period covering location-allocation problem in pharmaceutical supply chain

نویسندگان

1 Department of Industrial Engineering, K. N. Toosi University of Technology, Tehran, Iran

2 Department of Industrial engineering, K. N. Toosi University of Technology, Tehran, Iran

doi
چکیده

This paper proposes a discrete capacitated covering location-allocation model for pharmaceutical centers. In the presented model, two objectives are considered; the first one is minimization of costs and the second one try to maximize customer satisfaction by definition of social justice. Social justice in the model means that we consider customers satisfaction by using distance. the introduced model is an extension of the maximum covering model by adding zone constraint that Actually the distance between facility and customer zone is categorized as best, possible and not possible location. The model tries to locate facilities in best and possible location. In addition, number of missed customers is important and the model considered this issue. Since the nature of the demand is uncertain, a robust approach is proposed. The model could applied to other industries that have limitation about their product such as perishability foods or other perishability product. The model solved by GAMS Software. Finally, a numerical example with sensitivity analysis presented to illustrate the proposed model.