首页    期刊浏览 2025年03月01日 星期六
登录注册

文章基本信息

  • 标题:Facility location problem under users with two type criteria, min-max and max-min
  • 本地全文:下载
  • 作者:Hiroaki ISHII ; Hiroaki ISHII
  • 期刊名称:International Journal of Japan Association for Management Systems
  • 印刷版ISSN:1884-2089
  • 电子版ISSN:2188-2460
  • 出版年度:2015
  • 卷号:7
  • 期号:1
  • 页码:11-18
  • DOI:10.14790/ijams.7.11
  • 语种:English
  • 出版社:日本経営システム学会
  • 摘要:For a public facility construction, usually we use min-ma x or max-min criterion depending on fac ility nature, i.e., useful or obnoxious. City hall, hospital etc. are considered to be typical useful facility. While a disposal center, a waste disposal center etc. are considered to be a typical obnoxious facility. But even city center or hospital has many aspects and so users are divided into two groups. Each user in a group considers distance from the facility should be as close as possible (we call this group welcome group) and each user in the other group considers its distance should be as far as possible (we call the group not welcome group). Therefore, we seek a facility construction site in an urban area minimizing the maximum among all rectilinear distances from it to users of welcome group and maximizing the minimum among all rectilinear distances from it to users of not welcome group under the presence of barriers. But usually there are no fa cility construction site op timizing both criteria s imultaneously. T herefore we find some nondominated sites after defining non-domination about facility construction site. In order to find them, we utilize an id ea of fo rbidden regions where we cann ot construct a faci lity. First we consider the fi nite number case of candidate facility construction site and next discuss the infinite number case of them. For the finite number case, we reduce our problem into the shortest path problem with special network and obtain some non-dominated sites. For the infinite number case, we divide the feasible region of problem into sub-regions. For sub-problem corresponding to each sub-region , we propose an efficient solution procedure utilizing the results in th e finite number case. Based on th e optimal solution of ea ch subproblem, we obtain some non-dominated sites. Finally we summarize the result of this paper and discuss further research problems.
  • 关键词:Single facility location problem;Min-max and Max-min criteria;rectilinear distance;barriers;non-dominated site;shortest path problem
国家哲学社会科学文献中心版权所有