Uncertain models for single facility location problems on networks

In practical location problems on networks, the vertex demand is usually non-deterministic. This paper employs uncertainty theory to deal with this non-deterministic factor in single facility location problems. We first propose the concepts of satisfaction degree for both vertices and the whole netw...

Full description

Saved in:
Bibliographic Details
Published inApplied mathematical modelling Vol. 36; no. 6; pp. 2592 - 2599
Main Author Gao, Yuan
Format Journal Article
LanguageEnglish
Published Elsevier Inc 01.06.2012
Subjects
Construction
Demand
Location problem
Marketing
Mathematical models
Network
Networks
Position (location)
Uncertain programming
Uncertainty
Uncertainty theory
Uncertain programming
Location problem
Network
Uncertainty theory
Online AccessGet full text

Cover

More Information
Summary:In practical location problems on networks, the vertex demand is usually non-deterministic. This paper employs uncertainty theory to deal with this non-deterministic factor in single facility location problems. We first propose the concepts of satisfaction degree for both vertices and the whole network, which are used to evaluate products assignment. Based on different network satisfaction degree, two models are constructed. The solution to these models is based on Hakimi’s results, and some examples are given to illustrate these models.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0307-904X
DOI:10.1016/j.apm.2011.09.042