Neighborhood Hybrid Structure for Discrete Optimization Problems

In this paper a comparative analysis of a neighborhood structures group are presented, including a hybrid structure, which arises of a combination of this set of structures. The efficiency and effectiveness of each structure was tested using the Classical Symmetric Travelling Salesman Problem. This study identifies the neighborhood structure that allows performing a better exploration and exploitation of the space solutions to discrete optimization problems. A neighborhood hybrid structure proposed has better performance comparing with other techniques, this is experimentally proved, in addition a competitive efficiency is shown.