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 in:Applied mathematical modelling 2012-06, Vol.36 (6), p.2592-2599
Main Author: Gao, Yuan
Format: Article
Language:English
Subjects:
Construction
Demand
Location problem
Marketing
Mathematical models
Network
Networks
Position (location)
Uncertain programming
Uncertainty
Uncertainty theory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
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.
ISSN:0307-904X
DOI:10.1016/j.apm.2011.09.042