GRASP with path-relinking for the TSP

Abstract

This paper presents a new GRASP for the TSP. Two versions utilizing two distinct implementations of the LK neighborhood are introduced. Those heuristics are hybridized with a path-relinking procedure. A distance metric, previously proposed to fitness analysis landscape is utilized to decide whether to apply path-relinking between a pair of solutions. A computational experiment is reported to support conclusions about efficiency of the proposed approach. © 2007 by Springer Science+Business Media, LLC.