Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
A multiobjective model for locating undesirable facilities
Annals of Operations Research - Special issue on locational decisions
Bicriteria location of a semi-obnoxious facility
Computers and Industrial Engineering
Interactive Multiobjective Group Decision Making with Interval Parameters
Management Science
An O(mn2) algorithm for the Maximin problem in E2
Operations Research Letters
Computing obnoxious 1-corner polygonal chains
Computers and Operations Research
Computing obnoxious 1-corner polygonal chains
Computers and Operations Research
On the ordered anti-Weber problem for any norm in R2
Operations Research Letters
Locating a semi-obnoxious covering facility with repelling polygonal regions
Discrete Applied Mathematics
| Hi-index | 0.01 |
This paper deals with the problem of determining within a bounded region the location for a new facility that serves certain demand points. For that purpose, the facility planners have two objectives. First, they attempt to minimize the undesirable effects introduced by the new facility by maximizing its minimum Euclidean distance with respect to all demand points (maximin). Secondly, they want to minimize the total transportation cost from the new facility to the demand points (minisum). Typical examples for such "semi-obnoxious" facilities are power plants that, as polluting agents, are undesirable and should be located far away from demand points, while cost considerations force planners to have the facility in close proximity to the customers. We describe the set of efficient solutions of this bi-criterion problem and propose an efficient algorithm for its solution.