...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Discrete Applied Mathematics >The Ordered Gradual Covering Location Problem on a Network
【24h】

The Ordered Gradual Covering Location Problem on a Network

机译：网络上的有序渐进覆盖位置问题

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In this paper we develop a network location model that combines the characteristics of ordered median and gradual cover models resulting in the Ordered Gradual Covering Location Problem (OGCLP). The Gradual Cover Location Problem (GCLP) was specifically designed to extend the basic cover objective to capture sensitivity with respect to absolute travel distance. The Ordered Median Location problem is a generalization of most of the classical locations problems like p-median or p-center problems. The OGCLP model provides a unifying structure for the standard location models and allows us to develop objectives sensitive to both relative and absolute customer-to-facility distances. We derive Finite Dominating Sets (FDS) for the one facility case of the OGCLP. Moreover, we present efficient algorithms for determining the FDS and also discuss the conditional case where a certain number of facilities is already assumed to exist and one new facility is to be added. For the multi-facility case we are able to identify a finite set of potential facility locations a priori, which essentially converts the network location model into its discrete counterpart. For the multi-facility discrete OGCLP we discuss several Integer Programming formulations and give computational results.
机译：在本文中，我们开发了一个网络位置模型，该模型结合了有序中位数和渐变覆盖模型的特征，从而导致了有序渐进覆盖位置问题（OGCLP）。渐变掩体位置问题（GCLP）专门用于扩展基本掩体物镜，以捕获相对于绝对行进距离的敏感性。有序中位数位置问题是大多数经典位置问题（如p中值或p中心问题）的推广。 OGCLP模型为标准位置模型提供了统一的结构，并允许我们制定对相对和绝对的客户到设施距离都敏感的目标。我们为OGCLP的一种设施案例推导了有限支配集（FDS）。此外，我们提出了确定FDS的有效算法，并讨论了已经假定存在一定数量的设施并要增加一个新设施的条件情况。对于多设施情况，我们能够先验地确定一组有限的潜在设施位置，这实际上将网络位置模型转换为离散的对应位置。对于多设施离散OGCLP，我们讨论了几种整数编程公式并给出了计算结果。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号