Facility location problems in the presence of single convex/non-convex polygonal barrier/forbidden region

The paper presents the methodology to obtain the location of a new facility in the presence of a single polygonal (convex/non-convex) forbidden region. The algorithms to compute the shortest unconstrained Euclidean distances are presented. In case of constrained situations a newly developed Sloping Line Search Technique is used. The proposed method overcomes the inadequacies of earlier techniques and can even yield solutions to problems involving non-convex polygonal forbidden regions. The programming is graphic interactive and enables the user to continuously monitor the state and progress of computation. Mini-sum criteria have been used to find optimum location of a new facility through revised Hook and Jeeves search method.