The multi-depot k-traveling repairman problem

Autor: Maria Elena Bruni, Sara Khodaparasti, Iris Martínez-Salazar, Samuel Nucamendi-Guillén
Rok vydání: 2022
Předmět:
Zdroj: Optimization Letters. 16:2681-2709
ISSN: 1862-4480
1862-4472
DOI: 10.1007/s11590-021-01845-7
Popis: In this paper, we study the multi-depot k-traveling repairman problem. This problem extends the traditional traveling repairman problem to the multi-depot case. Its objective, similar to the single depot variant, is the minimization of the sum of the arrival times to customers. We propose two distinct formulations to model the problem, obtained on layered graphs. In order to find feasible solutions for the largest instances, we propose a hybrid genetic algorithm where initial solutions are built using a splitting heuristic and a local search is embedded into the genetic algorithm. The efficiency of the mathematical formulations and of the solution approach are investigated through computational experiments. The proposed models are scalable enough to solve instances up to 240 customers.
Databáze: OpenAIRE
Externí odkaz: