Abstract
Capacitated minimax facility location-allocation (LA) is a type of facility problem which is of prime importance for emergency situation, since it directly affects the service response time to customers. Capacitated minimax LA problem is concerned with locating some new facilities and allocating their capacity to customers when the maximum travelled distance from customers to facilities is minimized. This study involves a fixed line barrier in a region with some border crossings along it which divides the area into two subregions. Although several studies have recently been done on this problem in which the customer locations are known with certainty, much less attention has been devoted to developing a comprehensive mathematical model for the probabilistic extension of customer locations when there are some restrictions in the region. In order to fill this gap, a Mixed Integer Nonlinear Programming (MINLP) model is proposed for facility LA when customer locations are randomly distributed according to a bivariate normal probability distribution. Finally, the BARON solver in the GAMS software is used to solve the model, and a numerical example is provided to demonstrate its efficiency.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have