A NEW HYBRID APPROACH FOR SOLVING TRAVELLING SALESMAN PROBLEM USING ORDERED CROSS OVER 1(OX1) AND GREEDY APPROACH

Komal Joshi, Ram Lal Yadav

Abstract: Travelling Salesman Problem is a well known NP problem. It is an optimization problem. Genetic Algorithms are the evolution techniques to solve optimization problems. In this paper a new hybrid technique using ordered cross over 1 (OX1) and greedy approach has been proposed. Experiment results shows that the proposed hybrid cross over is better than the existing cross over operator as the new operator provide a better path when executed for the same number of iterations.

Keywords: Travelling Salesman Problem, ordered cross over 1 (OX1)

DOI: https://doi.org/10.15623/ijret.2015.0405060