Scholarlink

In this paper the MILP model for Vehicle Routing Problem with Time Windows (VRPTW) is presented in application of building facilities maintenance. Real-life constraints such as time limit constraint and penalties for exceeding location time windows were formulated. Improved Tabu Search algorithm was proposed with an initial solution obtained by Greedy Nearest Neighbour heuristic and compared with Gurobi solver. Computer experiments were performed on Solomon instances with different length of time windows. The results show that Tabu search outperforms other methods in defined time limit and returns the best results for narrow time windows.

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

Analysis of the Impact of Time Window Lengths on Maintenance Vehicle Routing Problem Efficiency

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Konrad Pempera,
  • Michał Jaroszczuk

摘要

In this paper the MILP model for Vehicle Routing Problem with Time Windows (VRPTW) is presented in application of building facilities maintenance. Real-life constraints such as time limit constraint and penalties for exceeding location time windows were formulated. Improved Tabu Search algorithm was proposed with an initial solution obtained by Greedy Nearest Neighbour heuristic and compared with Gurobi solver. Computer experiments were performed on Solomon instances with different length of time windows. The results show that Tabu search outperforms other methods in defined time limit and returns the best results for narrow time windows.