Abstract:
A constructive heuristic method is introduced to solve the multi-facility location problems in the
presence of convex polygonal barriers. Potential locations for the facilities can be anywhere in the
space except in the interior of the barriers. Also the Euclidean distance travelled cannot cross the
interior of the barriers. The method guides the initial chosed location away from the barriers and
the Weisgal procedure then improve the location position subject to the user locations and the
corner points of the barriers. The preliminary results are presented based on benchmark problems
