Evaluating the Difficulty of Instances of the Travelling Salesman Problem in the Nearby of the Optimal Solution Based on Random Walk Exploration

Miguel Cárdenas Montes. Evaluating the Difficulty of Instances of the Travelling Salesman Problem in the Nearby of the Optimal Solution Based on Random Walk Exploration. In Francisco Martínez-Álvarez, Alicia Troncoso, Héctor Quintián, Emilio Corchado, editors, Hybrid Artificial Intelligent Systems - 11th International Conference, HAIS 2016, Seville, Spain, April 18-20, 2016, Proceedings. Volume 9648 of Lecture Notes in Computer Science, pages 299-310, Springer, 2016. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.