A discrete location model with fuzzy accessibility measures
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This paper presents an application of the set partitioning (set covering with equality constraints) type of integer programming formulation to a discrete location problem with fuzzy accessibility criteria and uses the symmetry of the objectives and the constraints introduced by Bellman and Zadeh.
Abstract
In crisply defined discrete location problems, a number of facilities are to be located at specific points within an area, according to precisely quantified criteria. However in many location problems, especially those associated with social policies, non-crisply defined criteria are used such as, how ‘near’ or ‘accessible’ a facility is, or how ‘important’ certain issues are, etc. In these cases a fuzzy sets approach is more appropriate. This paper presents an application of the set partitioning (set covering with equality constraints) type of integer programming formulation to a discrete location problem with fuzzy accessibility criteria. The solution method suggested uses the symmetry of the objectives and the constraints introduced by Bellman and Zadeh.
