首页> 外文期刊>Computers & operations research >Exact method for the capacitated competitive facility location problem
【24h】

Exact method for the capacitated competitive facility location problem

机译:限制竞争性设施选址问题的精确方法

获取原文
获取原文并翻译 | 示例
           

摘要

We consider a competition between two parties maximizing their profit from servicing customers. A decision making process is assumed to be organized in a Stackelberg game framework. In the model, we are given with two finite sets: a set of customers and a set of potential facilities' locations. The parties, called the Leader and the Follower, sequentially open their facilities in some of the potential locations. A party opening the most preferable facility for a customer captures him or her. Facilities' capacities are assumed to be finite, and the problem is to decide where to open facilities and how to assign them to service captured customers provided that capacity constraints are satisfied.
机译:我们考虑了两方之间的竞争,从而最大限度地提高了为客户提供服务的利润。假定决策过程是在Stackelberg游戏框架中组织的。在模型中,我们有两个有限集:一组客户和一组潜在设施的位置。称为领导者和跟随者的当事方依次在某些潜在位置开放其设施。为客户开设最优惠设施的聚会吸引了他或她。假定设施的容量是有限的,问题是要确定在满足容量限制的情况下在何处开设设施以及如何将其分配给服务的已捕获客户。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号