The P-Obnoxious Facility Network Location Problem with Facility Interaction

Welch, S.B and Salhi, Said (1997) The P-Obnoxious Facility Network Location Problem with Facility Interaction. European Journal of Operational Research, 102 (2). pp. 302-319. (The full text of this publication is not available from this repository)

The full text of this publication is not available from this repository. (Contact us about this Publication)
Official URL
http://dx.doi.org/10.1016/S0377-2217(97)00111-2

Abstract

Three heuristics are proposed to solve the maximin formulation for siting p facilities on a network considering a pollution dispersion equation and facility interaction. Initially, the single facility problem is approached by building up polygons which model pollution spread about the nodes of the network. This is extended in the first heuristic to the p facility problem. The second combines both the p-maximin and p-maxisum objectives in a lexicographic manner. The third is based on recent developments of Simulated Annealing. The proposed heuristics are evaluated for up to six facilities on a set of randomly generated networks having 20 to 40 nodes and low or medium arc density.

Item Type: Article
Uncontrolled keywords: Location; Obnoxious facility, Heuristics; Simulated annealing
Subjects: H Social Sciences
Divisions: Faculties > Social Sciences > Kent Business School > Management Science
Depositing User: Said Salhi
Date Deposited: 20 Jul 2009 16:49
Last Modified: 04 Jun 2014 13:45
Resource URI: http://kar.kent.ac.uk/id/eprint/5277 (The current URI for this page, for reference purposes)
  • Depositors only (login required):