A Facility Location Problem With Tchebychev Distance in the Presence of A Probabilistic Line Barrier

This paper considers the tchebychev distance for a facility location problem with a probabilistic line barrier in the plane. in particular, we develop a mixed-integer nonlinear programming (minlp) model for this problem that minimizes the total tchebychev distance between a new facility and the existing facilities. a numerical example is solved to show the validity of the developed model. because of difficulty in solving this problem, while increasing the number of existing facilities, we propose an efficient meta-heuristic algorithm and design it, namely differential evolution (de), for the given problem. finally, the associated results are compared with the exact solution and lower bound for the different-sized problems.