Scholarlink

This article presents a MILP model for multimodal capacitated vehicle routing problem in application to delivery to small-format stores. Two solving methods were implemented - a greedy heuristic and a Tabu search algorithm. A comparison of these methods to the Gurobi commercial solver was made. Additionally, different neighbourhood types were implemented for Tabu search and compared with each other. Experiments show that reverse neighbourhood type returns the best results and that Gurobi can successfully solve problems of up to 10 recipients; therefore, metaheuristics must be applied to real-life scenarios.

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

Comparison of Optimization Methods for Multimodal VRP in Application to Stores Delivery

  • 会议论文

  • 发表日期：

    2026年

查看全文
  • Radosław Idzikowski,
  • Michał Jaroszczuk,
  • Piotr Nowak,
  • Mariusz Uchroński

摘要

This article presents a MILP model for multimodal capacitated vehicle routing problem in application to delivery to small-format stores. Two solving methods were implemented - a greedy heuristic and a Tabu search algorithm. A comparison of these methods to the Gurobi commercial solver was made. Additionally, different neighbourhood types were implemented for Tabu search and compared with each other. Experiments show that reverse neighbourhood type returns the best results and that Gurobi can successfully solve problems of up to 10 recipients; therefore, metaheuristics must be applied to real-life scenarios.