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 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.