首页> 外文会议>Hybrid metaheuristics >A Hybrid Tabu Search Heuristic for a Bilevel Competitive Facility Location Model
【24h】

A Hybrid Tabu Search Heuristic for a Bilevel Competitive Facility Location Model

机译:双层竞争设施定位模型的混合禁忌搜索启发式方法

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

摘要

We consider a problem in which a firm or franchise enters a market by locating new facilities where there are existing facilities belonging to a competitor. The firm aims at finding the location and attractiveness of each facility to be opened so as to maximize its profit. The competitor, on the other hand, can react by adjusting the attractiveness of its existing facilities, opening new facilities and/or closing existing ones with the objective of maximizing its own profit. The demand is assumed to be aggregated at certain points in the plane and the facilities of the firm can be located at prespecified candidate sites. We employ Huff's gravity-based rule in modeling the behavior of the customers where the fraction of customers at a demand point that visit a certain facility is proportional to the facility attractiveness and inversely proportional to the distance between the facility site and demand point. We formulate a bilevel mixed-integer nonlinear programming model where the firm entering the market is the leader and the competitor is the follower. In order to find a feasible solution of this model, we develop a hybrid tabu search heuristic which makes use of two exact methods as subroutines: a gradient ascent method and a branch-and-bound algorithm with nonlinear programming relaxation.
机译:我们考虑的问题是,公司或特许经营商会通过在现有设施属于竞争对手的地方设置新设施来进入市场。该公司的目的是找到每个设施的位置和吸引力,以使其利润最大化。另一方面,竞争者可以通过调整其现有设施的吸引力,开设新设施和/或关闭现有设施的吸引力来做出反应,以实现自身利润的最大化。假设需求是在飞机上的某些点汇总的,并且公司的设施可以位于预先指定的候选地点。我们使用霍夫基于重力的规则对客户的行为进行建模,其中在需求点上访问特定设施的客户比例与设施吸引力成正比,与设施站点与需求点之间的距离成反比。我们制定了一个双层混合整数非线性规划模型,其中进入市场的公司是领导者,竞争对手是跟随者。为了找到该模型的可行解决方案,我们开发了一种混合禁忌搜索启发式方法,该方法使用两种精确的方法作为子例程:梯度上升方法和具有非线性规划松弛的分支定界算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号