Fuzzy logic based algorithms for maximum covering location problems

Vladan Batanović, Dobrila Petrovic, Radijov Petrovic

    Research output: Contribution to journalArticle

    38 Citations (Scopus)
    124 Downloads (Pure)

    Abstract

    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.
    Original languageEnglish
    Pages (from-to)120–129
    JournalInformation Sciences
    Volume179
    Issue number1-2
    DOIs
    Publication statusPublished - Jan 2009

    Fingerprint

    Covering Problem
    Location Problem
    Fuzzy Logic
    Fuzzy logic
    Vertex of a graph
    Fuzzy sets
    Linguistics
    Logistics
    Fuzzy Sets
    Coverage
    Location problem
    Node
    Subset
    Facility Location
    Industry
    Demand

    Bibliographical note

    This article is not available in the repository

    Keywords

    • uncertainty
    • fuzzy sets
    • network covering
    • location
    • facility site

    Cite this

    Fuzzy logic based algorithms for maximum covering location problems. / Batanović, Vladan; Petrovic, Dobrila; Petrovic, Radijov.

    In: Information Sciences, Vol. 179, No. 1-2, 01.2009, p. 120–129.

    Research output: Contribution to journalArticle

    Batanović, Vladan ; Petrovic, Dobrila ; Petrovic, Radijov. / Fuzzy logic based algorithms for maximum covering location problems. In: Information Sciences. 2009 ; Vol. 179, No. 1-2. pp. 120–129.
    @article{3ca57b21dd60432294f7065a86a53a83,
    title = "Fuzzy logic based algorithms for maximum covering location problems",
    abstract = "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.",
    keywords = "uncertainty, fuzzy sets, network covering, location, facility site",
    author = "Vladan Batanović and Dobrila Petrovic and Radijov Petrovic",
    note = "This article is not available in the repository",
    year = "2009",
    month = "1",
    doi = "10.1016/j.ins.2008.08.019",
    language = "English",
    volume = "179",
    pages = "120–129",
    journal = "Information Sciences",
    issn = "0020-0255",
    publisher = "Elsevier",
    number = "1-2",

    }

    TY - JOUR

    T1 - Fuzzy logic based algorithms for maximum covering location problems

    AU - Batanović, Vladan

    AU - Petrovic, Dobrila

    AU - Petrovic, Radijov

    N1 - This article is not available in the repository

    PY - 2009/1

    Y1 - 2009/1

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

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

    KW - uncertainty

    KW - fuzzy sets

    KW - network covering

    KW - location

    KW - facility site

    U2 - 10.1016/j.ins.2008.08.019

    DO - 10.1016/j.ins.2008.08.019

    M3 - Article

    VL - 179

    SP - 120

    EP - 129

    JO - Information Sciences

    JF - Information Sciences

    SN - 0020-0255

    IS - 1-2

    ER -