Locating semi-obnoxious facilities with expropriation: minisum criterion

Locating semi-obnoxious facilities with expropriation: minisum criterion

0.00 Avg rating0 Votes
Article ID: iaor20072760
Country: United Kingdom
Volume: 58
Issue: 3
Start Page Number: 378
End Page Number: 390
Publication Date: Mar 2007
Journal: Journal of the Operational Research Society
Authors: ,
Keywords: programming: branch and bound, lagrange multipliers
Abstract:

This paper considers the problem of locating semi-obnoxious facilities assuming that demand points within a certain distance from an open facility are expropriated at a given price. The objective is to locate the facilities so as to minimize the total weighted transportation cost and expropriation cost. Models are developed for both single and multiple facilities. For the case of locating a single facility, finite dominating sets are determined for the problems on a plane and on a network. An efficient algorithm is developed for the problem on a network. For the case of locating multiple facilities, a branch-and-bound procedure using Lagrangian relaxation is proposed and its efficiency is tested with computational experiments.

Reviews

Required fields are marked *. Your email address will not be published.