...
首页> 外文期刊>Acta Ciencia Indica >A LEXI-SEARCH ALGORITHM FOR P-MEDIAN PROBLEM
【24h】

A LEXI-SEARCH ALGORITHM FOR P-MEDIAN PROBLEM

机译:P中值问题的LEXI-SEARCH算法

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

摘要

The p-median problem is location-allocation problem that takes into account the average (total) distance between demand points and facility. The practical utility of the problem is obvious by the number of solutions developed in the literature. A formulation is presented and computational experience is offered. Lexi-search algorithm can be used effectively, which takes care of simple and combinatorial structure of the p-median problem. For this problem a computer programme is developed for the algorithm and is tested. !t is observed that it takes less time for solving fairly higher dimension problems also. For this problem the definition, notation and algorithm are illustrated with the help of a numerical example.
机译:p中位数问题是位置分配问题,它考虑了需求点和设施之间的平均(总)距离。通过文献中开发的解决方案的数量,该问题的实际用途显而易见。提出了一个公式并提供了计算经验。可以有效使用Lexi-search算法,该算法可以考虑p中值问题的简单和组合结构。针对该问题,针对该算法开发了计算机程序并进行了测试。观察到,t还花费更少的时间来解决相当大的尺寸问题。针对此问题,通过一个数字示例说明了定义,符号和算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号