Francisco Ángel-Bello

TL;DR: This work presents a mathematical formulation for the bi-objective TLRP and proposes a new representation for the TLRP based on priorities, which lets us manage the problem easily and reduces the computational effort.

TL;DR: AMetaheuristic algorithm based on multi-start algorithm and variable neighbourhood descent metaheuristic is proposed that considerably improved the performance of the algorithm providing small deviations from optimal solutions in medium-sized instances and outperforming the best known solutions for large instances.

TL;DR: A new mixed integer formulation and a simple and efficient metaheuristic algorithm for k-Travelling Repairmen Problem that allows solving to optimality more than three times larger data instances than the previous formulation published in literature.

TL;DR: The solution provided by the method proposed in this paper improves the solution implemented by the company, and is motivated by a real problem posed to the authors by a company in Tenerife, Spain.

TL;DR: This work has developed two integer formulations for the minimum latency problem and compared them with other two formulations from the literature for the time-dependent traveling salesman problem and highlights the similarities and differences between the different formulations.