Set covering location models with stochastic critical distances

S. Meng, B. C. Shia

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

This paper formulates a new version of set covering models by introducing a customer-determined stochastic critical distance. In this model, all services are provided at the sites of facilities, and customers have to go to the facility sites to obtain the services. Due to the randomness of their critical distance, customers patronize a far or near facility with a probability. The objective is to find a minimum cost set of facilities so that every customer is covered by at least one facility with an average probability greater than a given level α. We consider an instance of the problem by embedding the exponential effect of distance into the model. An algorithm based on two searching paths is proposed for solutions to the instance. Experiments show that the algorithm performs well for problems with greater α, and the experimental results for smaller α are reported and analysed.

Original languageEnglish
Pages (from-to)945-958
Number of pages14
JournalJournal of the Operational Research Society
Volume64
Issue number7
DOIs
Publication statusPublished - Jul 2013
Externally publishedYes

Fingerprint

Location model
Costs
Experiments
Randomness
Experiment

Keywords

  • exponential effect
  • location
  • set covering problem
  • stochastic critical distance

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Management Information Systems
  • Marketing
  • Strategy and Management

Cite this

Set covering location models with stochastic critical distances. / Meng, S.; Shia, B. C.

In: Journal of the Operational Research Society, Vol. 64, No. 7, 07.2013, p. 945-958.

Research output: Contribution to journalArticle

@article{2b3fd92d65a34b4c9060e1d82db7f6bf,
title = "Set covering location models with stochastic critical distances",
abstract = "This paper formulates a new version of set covering models by introducing a customer-determined stochastic critical distance. In this model, all services are provided at the sites of facilities, and customers have to go to the facility sites to obtain the services. Due to the randomness of their critical distance, customers patronize a far or near facility with a probability. The objective is to find a minimum cost set of facilities so that every customer is covered by at least one facility with an average probability greater than a given level α. We consider an instance of the problem by embedding the exponential effect of distance into the model. An algorithm based on two searching paths is proposed for solutions to the instance. Experiments show that the algorithm performs well for problems with greater α, and the experimental results for smaller α are reported and analysed.",
keywords = "exponential effect, location, set covering problem, stochastic critical distance",
author = "S. Meng and Shia, {B. C.}",
year = "2013",
month = "7",
doi = "10.1057/jors.2012.113",
language = "English",
volume = "64",
pages = "945--958",
journal = "Journal of the Operational Research Society",
issn = "0160-5682",
publisher = "Palgrave Macmillan Ltd.",
number = "7",

}

TY - JOUR

T1 - Set covering location models with stochastic critical distances

AU - Meng, S.

AU - Shia, B. C.

PY - 2013/7

Y1 - 2013/7

N2 - This paper formulates a new version of set covering models by introducing a customer-determined stochastic critical distance. In this model, all services are provided at the sites of facilities, and customers have to go to the facility sites to obtain the services. Due to the randomness of their critical distance, customers patronize a far or near facility with a probability. The objective is to find a minimum cost set of facilities so that every customer is covered by at least one facility with an average probability greater than a given level α. We consider an instance of the problem by embedding the exponential effect of distance into the model. An algorithm based on two searching paths is proposed for solutions to the instance. Experiments show that the algorithm performs well for problems with greater α, and the experimental results for smaller α are reported and analysed.

AB - This paper formulates a new version of set covering models by introducing a customer-determined stochastic critical distance. In this model, all services are provided at the sites of facilities, and customers have to go to the facility sites to obtain the services. Due to the randomness of their critical distance, customers patronize a far or near facility with a probability. The objective is to find a minimum cost set of facilities so that every customer is covered by at least one facility with an average probability greater than a given level α. We consider an instance of the problem by embedding the exponential effect of distance into the model. An algorithm based on two searching paths is proposed for solutions to the instance. Experiments show that the algorithm performs well for problems with greater α, and the experimental results for smaller α are reported and analysed.

KW - exponential effect

KW - location

KW - set covering problem

KW - stochastic critical distance

UR - http://www.scopus.com/inward/record.url?scp=84878938545&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84878938545&partnerID=8YFLogxK

U2 - 10.1057/jors.2012.113

DO - 10.1057/jors.2012.113

M3 - Article

VL - 64

SP - 945

EP - 958

JO - Journal of the Operational Research Society

JF - Journal of the Operational Research Society

SN - 0160-5682

IS - 7

ER -