首页> 外文期刊>International Journal of Engineering and Technology >Solving Maximal Covering Location with Particle Swarm Optimization
【24h】

Solving Maximal Covering Location with Particle Swarm Optimization

机译:用粒子群算法求解最大覆盖位置

获取原文
           

摘要

The use of ambulance location model is significant in determining the best ambulance locations to ensure efficient emergency medical services (EMS) delivery. Maximal Covering Location Problem (MCLP) is one of the most common location models. It is an NP-hard problem and the objective is to maximize the coverage by a fixed number of ambulances. In this study, the demand zones are distributed in a grid based hypothetical region and each zone can host at most one ambulance only. The effectiveness of using Particle Swarm Optimization (PSO) algorithm in finding the best solution for MCLP problem is investigated. The result is compared with the random search technique. It was found that the proposed method manages to identify global optimal solution at a reasonable search time.
机译:救护车位置模型的使用对于确定最佳的救护车位置以确保有效的紧急医疗服务(EMS)交付具有重要意义。最大覆盖位置问题(MCLP)是最常见的位置模型之一。这是一个NP难题,目标是通过固定数量的救护车来最大程度地覆盖范围。在这项研究中,需求区域分布在基于网格的假设区域中,每个区域最多只能容纳一辆救护车。研究了使用粒子群优化(PSO)算法寻找MCLP问题的最佳解决方案的有效性。将结果与随机搜索技术进行比较。发现所提出的方法设法在合理的搜索时间识别全局最优解。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号