C++ Implementation of Hill-climbing and Simulated Annealing applied to Travelling Salesman Problems

Introduction Following from a previous post, I have extended the ability of the program to implement an algorithm based on Simulated Annealing and hill-climbing and applied it to some standard test problems. Once you get to grips with the terminology and background of this algorithm, it’s implementation is mercifully simple. The algorithm can be tweaked …

Continue reading ‘C++ Implementation of Hill-climbing and Simulated Annealing applied to Travelling Salesman Problems’ »