首页> 外文期刊>International Journal of Services and Operations Management >Robust cooperative maximal covering location problem: a case study of the locating Tele-Taxi stations in Tabriz, Iran
【24h】

Robust cooperative maximal covering location problem: a case study of the locating Tele-Taxi stations in Tabriz, Iran

机译:强大的合作最大覆盖位置问题:伊朗塔里兹定位远程出租车站的案例研究

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

摘要

>Today, maximising the number of steady customers and consistency in meeting their needs are two important factors affecting the profitability of companies. Therefore, researchers are trying to model, study and analyse factors affecting the businesses. To this end and with regard to covering problem applications, this problem is inclusively studied in the operations research (OR) literature. This article proposes a novel maximal covering location problem (MCLP) in which different factors (capacity of facilities, budget, number of available facilities in different types) have been considered. To provide a real case problem, locating Tele-Taxi stations in Tabriz, Iran have been studied. Moreover, to analyse the effects of uncertainty in the rate of demand in each demand point and capacity of facilities as undeniable facts of real-world, the robust counterpart of the proposed model is developed. Furthermore, a sensitivity analysis on the constant perturbation for uncertain parameters has been conducted.
机译:>今天,最大化稳定客户的数量和满足他们需求的一致性是影响公司盈利能力的两个重要因素。因此,研究人员正在努力建模,研究和分析影响业务的因素。为此,在覆盖问题应用方面,在运营研究(或)文献中包括这个问题。本文提出了一种新颖的最大覆盖位置问题(MCLP),其中考虑了不同因素(设施,预算,不同类型的可用设施数量)。为了提供一个真正的案例问题,已经研究了伊朗在塔德里兹的远程出租车站。此外,为了分析不可遗传的环境的需求点和设施能力的需求率的影响,建议模型的稳健对应。此外,已经进行了对不确定参数恒定扰动的灵敏度分析。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号