首页> 外文会议>2012 Third Global Congress on Intelligent Systems. >A Quick and Efficient Algorithm to the Emergency Supplies Distribution Centers Location Problem
【24h】

A Quick and Efficient Algorithm to the Emergency Supplies Distribution Centers Location Problem

机译:紧急物资配送中心选址问题的快速高效算法

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

摘要

Being high restricted by the conditions of roads, places and facilities under emergency situations, the location problems of emergency supplies distribution centers are suitable to adopt scattered optimization location modeling. The paper firstly set up the objective function of the location problem of emergency supplies distribution centers based P-centre model. And for meeting the needs of quickly get the solutions under the emergency requirements, the paper proposed an optimizing location algorithm according to the principles of 0-1 programming and dynamic programming, which could simply the solving process and to get the solutions of the best number of distribution centers and the optimal supplies distributing schemes at the same time. The efficiency of the algorithm is then estimated, and it is proved to have the functions of effectively cutting down the complexity of the calculations and improving the speeds in solving this kind of problems. Finally, a calculating case is demonstrated and the practicability of the algorithm is validated.
机译:应急物资配送中心的选址问题在紧急情况下受到道路,场所和设施条件的高度限制,适合采用分散的优化选址模型。本文首先建立了基于P中心模型的应急物资配送中心选址问题的目标函数。为了满足紧急情况下快速获得解决方案的需求,根据0-1规划和动态规划的原理,提出了一种优化定位算法,该算法可以简化求解过程,得到最优解。同时配置配送中心和最佳耗材配送方案。估计了算法的效率,证明了该算法具有有效降低计算复杂度,提高解决此类问题的速度的功能。最后,给出了一个计算实例,验证了该算法的实用性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号