2015-09-10

The Cross Entropy (CE) method which was initiated and developed by Reuven Rubinstein has been applied to combinatorial optimization problems with promising results. The CE method is actually a generic approach for solving combinatorial optimization. The CE method has been applied successfully to well known optimization problems such as traveling salesman, quadratic assignment problem, and the maximal cuts. In this study, the solution methodology of Traveling Salesman Problem (TSP) for different CE parameters are considered and tested. Keywords: Travelling Salesman Problem, Genetic Algorithm, CE parameter