Developing Improved Greedy Crossover to Solve Symmetric Traveling\n Salesman Problem

The Traveling Salesman Problem (TSP) is one of the most famous optimization\nproblems. Greedy crossover designed by Greffenstette et al, can be used while\nSymmetric TSP (STSP) is resolved by Genetic Algorithm (GA). Researchers have\nproposed several versions of greedy crossover. Here we propose improved version\nof it. We compare our greedy crossover with some of recent crossovers, we use\nour greedy crossover and some recent crossovers in GA then compare crossovers\non speed and accuracy.\n