Sie befinden Sich nicht im Netzwerk der Universität Paderborn. Der Zugriff auf elektronische Ressourcen ist gegebenenfalls nur via VPN oder Shibboleth (DFN-AAI) möglich. mehr Informationen...
The obnoxious p facility network location problem with facility interaction
Ist Teil von
European journal of operational research, 1997-10, Vol.102 (2), p.302-319
Ort / Verlag
Amsterdam: Elsevier B.V
Erscheinungsjahr
1997
Quelle
Elsevier Journal Backfiles on ScienceDirect (DFG Nationallizenzen)
Beschreibungen/Notizen
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.