The center location problem with equal weights in the presence of a probabilistic line barrier

Abstract

In this paper, a single facility centre location problem with a line barrier, which is uniformly distributed on a given horizontal route in the plane is proposed. The rectilinear distance metric is considered. The objective function minimizes the maximum expected barrier distance from the new facility to all demand points in the plane. An algorithm to solve the desired problem is proposed where a mixed integer nonlinear programming needs to be solved. The proposed model of this paper is solved using some already existed benchmark problem in the literature and the results are compared with other available methods.

Median location problem with two probabilistic line barriers: Extending the Hook and Jeeves algorithm

“…By dividing the feasible region into two separate half-planes and introducing the visibility conditions, they presented a solution algorithm to find the optimal location of a new facility minimizing the total of the weighted expected rectilinear distances. Later, [2] used this problem with a center objective function and presented an efficient heuristic algorithm to solve the problem. [43] also extended the study of [9] to a multi-facility location problem considering the interaction between new facilities in addition to the interaction between the new and the existing facilities.…”