Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
