首页    期刊浏览 2025年06月26日 星期四
登录注册

文章基本信息

  • 标题:New methods for solving a vertex p-center problem with uncertain demand-weighted distance: A real case study
  • 本地全文:下载
  • 作者:Nematian, J. ; Nematian, J. ; Sadati, M.
  • 期刊名称:International Journal of Industrial Engineering Computations
  • 印刷版ISSN:1923-2926
  • 电子版ISSN:1923-2934
  • 出版年度:2015
  • 卷号:6
  • 期号:2
  • 页码:253-266
  • DOI:10.5267/j.ijiec.2014.10.004
  • 语种:English
  • 出版社:Growing Science Publishing Company
  • 摘要:Vertex and p-center problems are two well-known types of the center problem. In this paper, a p-center problem with uncertain demand-weighted distance will be introduced in which the demands are considered as fuzzy random variables (FRVs) and the objective of the problem is to minimize the maximum distance between a node and its nearest facility. Then, by introducing new methods, the proposed problem is converted to deterministic integer programming (IP) problems where these methods will be obtained through the implementation of the possibility theory and fuzzy random chance-constrained programming (FRCCP). Finally, the proposed methods are applied for locating bicycle stations in the city of Tabriz in Iran as a real case study. The computational results of our study show that these methods can be implemented for the center problem with uncertain frameworks.
  • 关键词:Fuzzy random chance-constrained programming; Fuzzy random variable; Possibility theory; Vertex p-center problem
国家哲学社会科学文献中心版权所有