A discrete location model with fuzzy accessibility measures
Fuzzy Sets and Systems
Imprecise weights in Weber facility location problem
Fuzzy Sets and Systems
Allocation of discrete demand with changing costs
Computers and Operations Research - location science
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
Journal of Heuristics
Ranking the sequences of fuzzy values
Information Sciences—Informatics and Computer Science: An International Journal
A stochastic set-covering location model for both ameliorating and deteriorating items
Computers and Industrial Engineering - Special issue: Selected papers from the 27th international conference on computers & industrial engineering
Maximum-Cover Source-Location Problems
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
GASUB: finding global optima to discrete location problems by a genetic-like algorithm
Journal of Global Optimization
The minimum weighted covering location problem with distance constraints
Computers and Operations Research
Information Sciences: an International Journal
The Ordered Gradual Covering Location Problem on a Network
Discrete Applied Mathematics
Approximating Pareto frontier using a hybrid line search approach
Information Sciences: an International Journal
On the robustness of Type-1 and Interval Type-2 fuzzy logic systems in modeling
Information Sciences: an International Journal
Maximal covering location problem (MCLP) with fuzzy travel times
Expert Systems with Applications: An International Journal
Supply chain outsourcing risk using an integrated stochastic-fuzzy optimization approach
Information Sciences: an International Journal
Hi-index | 0.08 |
This paper concerns a class of maximum covering location problems in networks in uncertain environments. It is assumed that (a) relative weights of demand nodes are either deterministic or imprecise, described by linguistic expressions and (b) potential facility site locations are limited to network nodes. The concept of coverage is extended to include a degree of node coverage which means that the borders between the subset of covered demand nodes and the subset of uncovered demand nodes are inexact. The acceptable service distance/travelling times from a facility site to demand nodes are modelled by fuzzy sets. Three new algorithms for choosing the best facility locations are developed which assume that (1) demands at all nodes are equally important, (2) relative weights of demand at nodes are deterministic and (3) weights of demand at nodes are imprecise and described by linguistic terms, respectively. The algorithms are based on searching among potential facility nodes by applying comparison operations on discrete fuzzy sets. It is shown how to extend the proposed algorithms from one-site to multi-site covering problems. Illustrative examples of selecting locations for logistics centres in a distribution company are given.