Scholarlink

<p>We consider the robust <i>p</i>-median problem, where the stability associated with consumer demand is optimized. Since the known software requires high CPU time and memory, we develop approximate methods. We propose a problem-oriented version of the variable neighborhood search algorithm. The results are compared with known results, and the experimental data are discussed.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

VARIABLE NEIGHBORHOOD SEARCH ALGORITHM FOR THE ROBUST p-MEDIAN PROBLEM

  • 期刊论文

  • 发表日期：

    2026年6月24日

查看全文
  • Tatiana Levanova,
  • Ivan Khmara

摘要

We consider the robust p-median problem, where the stability associated with consumer demand is optimized. Since the known software requires high CPU time and memory, we develop approximate methods. We propose a problem-oriented version of the variable neighborhood search algorithm. The results are compared with known results, and the experimental data are discussed.