Scholarlink

<p>We describe a rule-based process to design a granular tabu search for the multi-depot vehicle routing problem. Using this process, only known and simple algorithmic components from the literature are required to achieve a reasonable performance compared to state-of-the-art metaheuristics. In each step, we analyze a single algorithmic component by comparing different settings for this component. The selection of the best setting for each component relies on two clear rules that are based on the Wilcoxon signed-rank test and a straightforward tradeoff measure. By either focussing on quality or on speed, we derive two final granular tabu search configurations. The decisions on the algorithmic components are partly in line with previous recommendations for other types of vehicle routing problems from the literature but also differ in some important aspects.</p>

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

Rule-based design of a granular tabu search for the multi-depot vehicle routing problem

  • 期刊论文

  • 发表日期：

    2026年2月9日

查看全文
  • Christian Becker,
  • Rossana Cavagnini,
  • Stefan Irnich,
  • Michael Schneider

摘要

We describe a rule-based process to design a granular tabu search for the multi-depot vehicle routing problem. Using this process, only known and simple algorithmic components from the literature are required to achieve a reasonable performance compared to state-of-the-art metaheuristics. In each step, we analyze a single algorithmic component by comparing different settings for this component. The selection of the best setting for each component relies on two clear rules that are based on the Wilcoxon signed-rank test and a straightforward tradeoff measure. By either focussing on quality or on speed, we derive two final granular tabu search configurations. The decisions on the algorithmic components are partly in line with previous recommendations for other types of vehicle routing problems from the literature but also differ in some important aspects.