Multi-period Maximal Covering Location Problem with Modular Facilities for Locating Emergency Facilities with Back-up Services

Multi-period Maximal Covering Location Problem with Modular Facilities for Locating Emergency Facilities with Back-up Services
复制标题

带后备服务的应急设施定位模块化设施多周期最大覆盖定位问题

DOI：
10.1109/ieem.2018.8607705
复制
发表时间：
2018
期刊：
Proceedings of 2018 IEEE International Conference on Industrial Engineering and Engineering Management
影响因子：
--
通讯作者：
Rogyayyeh Alizadeh and Tatsushi Nishi
Rogyayyeh Alizadeh and Tatsushi Nishi
中科院分区：
--
文献类型：
--
作者：
Aiko SHIMADA;Masashi TAKADA and Shin TOYODA;Katsumasa Nishide;Rogyayyeh Alizadeh and Tatsushi Nishi

文献摘要

相似文献

本文研究了由离散构件组成的应急设施的最大覆盖定位问题的推广。这些组件被称为设施模块。在开发的模型中，首先将需求节点分配给模块，然后将模块分配给设施。由于不同时段的应急需求不同，因此本文采用多时段研究。该问题被表述为一个整数规划模型。我们利用遗传算法来解决这个问题，因为这种元启发式算法在解决二进制优化问题和MCLP的其他扩展方面的优势。计算实验进行，以获得管理的见解。
In this paper, an extension of Maximal Covering Location Problem (MCLP) has been developed for locating emergency facilities, composed of discrete structural components. These components are called modules of facilities. In the developed model, demand nodes are assigned to modules first and then modules are allocated to facilities. As the demands in emergency cases vary in different time periods, the problem is studied in multi-time periods. The problem is formulated as an integer programming model. We utilize a genetic algorithm to solve the problem because of this metaheuristic's strength to solve binary optimization problems and other extension of MCLP. Computational experiments are conducted to derive managerial insights.