Scholarlink

This paper is inspired by a real-world scenario found in the maintenance sector of an electricity distribution company. In this problem, a set of tasks (clients) must be executed by a set of maintenance teams. There is not enough time capacity to visit all clients in the specified period, so a subset of tasks must be chosen to be performed. To address this problem, this paper derives a variation of the well-known Prize-collecting Vehicle Routing Problem and proposes two solving approaches: a MILP formulation and an Iterated Local Search (ILS) algorithm. As presented in our results, the ILS was able to find suitable solutions in an acceptable running time.

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

Solving a Shareable-Setup Time Prize Collection VRP Applied to an Electrical Maintenance Sector

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • R. F. Tavares,
  • A. Nogueira,
  • M. O. Batalha,
  • R. A. Martins,
  • H. F. Moralles,
  • R. Seeberger,
  • G. Mendonca,
  • M. Goncalves

摘要

This paper is inspired by a real-world scenario found in the maintenance sector of an electricity distribution company. In this problem, a set of tasks (clients) must be executed by a set of maintenance teams. There is not enough time capacity to visit all clients in the specified period, so a subset of tasks must be chosen to be performed. To address this problem, this paper derives a variation of the well-known Prize-collecting Vehicle Routing Problem and proposes two solving approaches: a MILP formulation and an Iterated Local Search (ILS) algorithm. As presented in our results, the ILS was able to find suitable solutions in an acceptable running time.