...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Applied Mathematical Modelling >Multi-period hub set covering problems with flexible radius: A modified genetic solution
【24h】

Multi-period hub set covering problems with flexible radius: A modified genetic solution

机译：涵盖半径灵活问题的多周期枢纽集：一种改进的遗传算法

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

摘要

Traditionally, in hub covering problems, it is assumed that the covering radius is an exogenous parameter which cannot be controlled by the decision maker. In many real-world cases, with a negligible increase in covering radius, considerable savings in hub establishment costs are possible. On the contrary, changes in problem parameters during the planning horizon cause the results of theoretical models to be impractical in real-world situations. This article proposes a mixed integer model for a multi-period single-allocation hub set covering problem in which the covering radius is a decision variable. The proposed model is validated through a real world case study. Also, due to the NP-Hardness of the problem a modified genetic algorithm (GA) is proposed for solving that. The proposed GA benefits from a dynamic stopping criteria and immigration operator. The performance of the proposed GA is compared with the original GA and imperialist competitive algorithm (ICA). Computational results corroborated efficiency of the proposed algorithm in achieving high-quality solutions in a reasonable time.
机译：传统上，在轮毂覆盖问题中，假设覆盖半径是决策者无法控制的外生参数。在许多实际情况下，覆盖半径的增加可以忽略不计，可以大大节省集线器的建设成本。相反，在规划阶段内问题参数的变化导致理论模型的结果在现实世界中不切实际。本文提出了一种混合整数模型，用于覆盖周期为决策变量的多周期单分配集线器覆盖问题。通过实际案例研究验证了所提出的模型。此外，由于问题的NP-Hardness，提出了一种改进的遗传算法（GA）来解决该问题。拟议的通用航空受益于动态的停车标准和移民经营者。将拟议的遗传算法的性能与原始遗传算法和帝国主义竞争算法（ICA）进行了比较。计算结果证实了该算法在合理的时间内获得高质量解决方案的效率。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号