A Multi-Start Procedure for the Minimum Latency Problem

In this paper we address a minimum latency problem and propose a multi-start strategy for solving it. For constructing initial solutions two procedures are designed, which are based on metaheuristic GRASP. We also develop a post-processing procedure based on Path Relinking to improve the obtained solutions. We carry up an extensive experimentation with 225 symmetrical instances to evaluate our procedures. In addition, using instances from literature, we compare our best procedure with previously reported methods, showing that the proposed procedure outperforms them in terms of solution quality and in elapsed CPU time to reach the solution.