Journal
APPLIED MATHEMATICAL MODELLING
Volume 36, Issue 6, Pages 2592-2599Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.apm.2011.09.042
Keywords
Location problem; Network; Uncertainty theory; Uncertain programming
Funding
- National Natural Science Foundation of China [60874067, 91024032]
Ask authors/readers for more resources
In practical locationproblems on networks, the vertex demand is usually non-deterministic. This paper employs uncertainty theory to deal with this non-deterministic factor in singlefacilitylocationproblems. 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 Hakimis results, and some examples are given to illustrate these models. (C) 2011 Elsevier Inc. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available