Abstract

This paper represents a hybrid algorithm for travelling salesman problem. The main idea of the hybrid algorithm is to harness the strong global search ability of the genetic algorithm and the high local search capability of the simulated annealing algorithm. The real distance between customers has been used on the basis of GIS in order to make the result more suitable to be used in real-life. The algorithm has been tested on standard examples and it showed that the algorithm proposed in this paper has improved the results.

Full Text
Published version (Free)

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 call