Developing Improved Greedy Crossover to Solve Symmetric Traveling Salesman Problem

Developing Improved Greedy Crossover to Solve Symmetric Traveling Salesman Problem

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 improv...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Ismkhan, Hassan, Zamanifar, Kamran
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Neural and Evolutionary Computing
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
DOI:10.48550/arxiv.1209.5339