A robust possibilistic programming approach to multi-period location–allocation of organ transplant centers under uncertainty

• An organ transplant location-allocation problem is taken into account.
• A robust possibilistic programming model is proposed.
• The inherent uncertainty of input data is taken into account.
• The data inspired by a real Iranian case study is used to validate the model.

This paper presents a novel robust possibilistic programming model for a multi-period location–allocation problem in an organ transplant supply chain under inherent uncertainty of input data. The minimization of total costs is considered as objective function to elevate the efficiency of the studied supply chain network. The significance of applicability of the developed model is demonstrated via numerical experiments and some sensitivity analyses on the data inspired by a real Iranian organ transplant supply chain.