A Center Location Problem with Probabilistic Customer Locations and a Line Barrier with K Passages

This paper focuses on a center (or minimax) location problem with probabilistic customer locations and in the presence of a line barrier with K Passages. We assume that the distance function is the squared Euclidean distance and present a mixed-integer nonlinear programming (MINLP) model of the given problem. The objective function is to minimize the maximum weighted expected barrier squared Euclidean distances between the facility and the probabilistic customer locations. To show the validity of this model, a numerical example is solved by optimization software that finds the optimum solution

کلیدواژه ها:

Center location problem ، probabilistic customer ، line barrier ، MINLP