首页> 外文期刊>Computers & Industrial Engineering >The continuous maximal covering location problem in large-scale natural disaster rescue scenes
【24h】

The continuous maximal covering location problem in large-scale natural disaster rescue scenes

机译:大型自然灾害救援场景中的连续最大覆盖位置问题

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

摘要

This study proposes a continuous maximal covering location problem (C-MCLP) that is often confronted in the rescuing scenes of natural disasters such as earthquakes, floods, and storms. The aim of the research is to optimize (dynamically and rapidly) the continuous locations of the communication hub-centers (e.g., moving vehicles or boats) of the self-organizing mobile network that is quickly established in such signal-free fields. The proposed C-MCLP well represents the real emergency rescues, but it is more complex to solve than the traditional discrete MCLP models, where the hub facilities are typically immobile and placed only within a limited set of candidate sites. We developed two mixed-integer linear programming (MILP) models for the C-MCLP. The first model is the single-period C-MCLP model, which is applicable to a stochastic rescuing environment where the rescue teams (RTs) do not have planned movements and can move towards any direction. The second one is the multi-period C-MCLP model, which is for cases where RTs have planned movements in multiple periods/phases. We introduced a new linearization method for the non-linear Euclidean distance with a controllable approximation error allowance, by which the proposed models are linearized and can be solved optimally using commercial MIP solvers such as CPLEX and Lingo. To solve large-sized problems, we provide a MILP-based fix-and-optimize heuristic approach to obtain near-optimal solutions with high computational efficiency. Then we conduct simulation experiments to verify the proposed models and heuristic approach with an intended time-limit setting on small-sized and large-sized test problem instances, respectively, with up to 1000 nodes of rescue teams. Finally, experimental results are analyzed and compared with those obtained using the traditional k-means clustering algorithms, which confirm that the proposed models and approach are applicable for the C-MCLPs in emergency rescue scenes, and can yield rapid and good solutions.
机译:本研究提出了一种连续的最大覆盖位置问题(C-MCLP),通常遇到救援场景,如地震,洪水和风暴等自然灾害的场景。该研究的目的是优化(动态且快速地)通过在这种无信号领域中快速建立的自组织移动网络的通信中心的连续位置(例如,移动车辆或船只)。所提出的C-MCLP井代表了真正的紧急救援,但是要解决比传统的离散MCLP模型更复杂,其中集线器设施通常是固定的,只在一组有限的候选地点。我们为C-MCLP开发了两个混合整数线性编程(MILP)模型。第一个模型是单期C-MCLP模型,适用于随机救援环境,其中救援团队(RTS)没有计划的运动,可以朝向任何方向移动。第二个是多时段C-MCLP模型,其用于RTS在多个时段/阶段的计划移动的情况下。我们介绍了一种具有可控近似误差允许的非线性欧几里德距离的新的线性化方法,通过该近似误差允许,所提出的型号是线性化的,并且可以使用诸如CPLEX和LINGO的商业MIP溶剂来最佳地解决。为了解决大规模的问题,我们提供了基于MILP的修复和优化启发式方法,以获得具有高计算效率的近最佳解决方案。然后,我们进行仿真实验,以验证提出的模型和启发式方法,分别具有对小型和大型测试问题实例的预期时限设置,最多有多达1000个救援团队节点。最后,分析了实验结果,并与使用传统的K-means聚类算法获得的那些相比,这证明了所提出的模型和方法适用于紧急救援场景中的C-MCLPS,并可以产生快速和良好的解决方案。

著录项

  • 来源
    《Computers & Industrial Engineering》 |2020年第8期|106608.1-106608.16|共16页
  • 作者单位

    School of Reliability and Systems Engineering Beihang University Beijing 100191 China;

    School of Reliability and Systems Engineering Beihang University Beijing 100191 China School of Engineering & Applied Science Aston University Birmingham B4 7ET United Kingdom;

    School of Reliability and Systems Engineering Beihang University Beijing 100191 China;

    School of Reliability and Systems Engineering Beihang University Beijing 100191 China;

    School of Reliability and Systems Engineering Beihang University Beijing 100191 China;

    School of Engineering & Applied Science Aston University Birmingham B4 7ET United Kingdom;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    Set covering; Location problem; Mobile communication network; Disaster rescue; Optimization;

    机译:设置覆盖物;位置问题;移动通信网络;灾难救援;优化;
  • 入库时间 2022-08-18 21:30:41

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号