Developing Improved Greedy Crossover to Solve Symmetric Traveling Salesman Problem

2012/09/24 by Hassan Ismkhan, Ismkhan, Hassan, Kamran Zamanifar +1
Computer Science · Decision Sciences · #Advanced Multi-Objective Optimization Algorithms #Evolutionary Algorithms and Applications #FOS: Computer and information sciences #Metaheuristic Optimization Algorithms Research #Neural and Evolutionary Computing (cs.NE) #Scheduling and Timetabling Solutions

paper · pdf · doi:10.48550/arxiv.1209.5339

openalex publication_date 2012/09/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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

Related

• Study of Some Recent Crossovers Effects on Speed and Accuracy of Genetic\n Algorithm, Using Symmetric Travelling Salesman Problem
• A Powerful Genetic Algorithm for Traveling Salesman Problem
• An Empirical Analysis of Approximation Algorithms for the Euclidean Traveling Salesman Problem
• Using Ants as a Genetic Crossover Operator in GLS to Solve STSP
• Reinforced Hybrid Genetic Algorithm for the Traveling Salesman Problem