首页> 外文会议>International Conference on Electrical and Information Technologies for Rail Transportation >Relationship Between Set Covering Location and Maximal Covering Location Problems in Facility Location Application
【24h】

Relationship Between Set Covering Location and Maximal Covering Location Problems in Facility Location Application

机译:设施定位应用中布景覆盖位置与最大覆盖位置问题的关系

获取原文

摘要

Covering problem is one of the classical facility location problems; set covering location model and maximal covering location model are two kinds of basic covering location models. After introducing those models, analyzing and expounding the relationship in application between the two kinds of model, the paper draws a conclusion that maximal covering location model needs to have qualification within the application, which is that its limited number of facilities is not greater than the minimum number of facilities obtained by set covering location model. Finally, the paper makes data experiment of traffic police allocation to verify the existence of relationship between the two models.
机译:覆盖问题是经典设施选址问题之一;设置覆盖物位置模型和最大覆盖物位置模型是两种基本的覆盖物位置模型。在介绍了这些模型之后,分析并阐明了两种模型之间在应用中的关系,得出了一个结论,即最大覆盖位置模型需要在应用程序内具有限定条件,即其有限的设施数量不大于模型数量。通过设置覆盖位置模型获得的最少设施数量。最后,对交通警察分配进行数据实验,以验证这两种模型之间的关系是否存在。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号