Set covering location models with stochastic critical distances

S. Meng, B. C. Shia

研究成果: 雜誌貢獻文章同行評審

2 引文 斯高帕斯(Scopus)

摘要

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.

原文英語
頁(從 - 到)945-958
頁數14
期刊Journal of the Operational Research Society
64
發行號7
DOIs
出版狀態已發佈 - 7月 2013
對外發佈

ASJC Scopus subject areas

  • 建模與模擬
  • 策略與管理
  • 統計、概率和不確定性
  • 管理科學與經營研究

指紋

深入研究「Set covering location models with stochastic critical distances」主題。共同形成了獨特的指紋。

引用此