Published on Fri Apr 10 2015

Study of Some Recent Crossovers Effects on Speed and Accuracy of Genetic Algorithm, Using Symmetric Travelling Salesman Problem

Hassan Ismkhan, Kamran Zamanifar

The Travelling Salesman Problem (TSP) is one of the most famous optimization problems. The Genetic Algorithm (GA) is a metaheuristics that has been applied to TSP. The Crossover and mutation operators are two important elements of GA.

0
0
0
Abstract

The Travelling Salesman Problem (TSP) is one of the most famous optimization problems. The Genetic Algorithm (GA) is one of metaheuristics that have been applied to TSP. The Crossover and mutation operators are two important elements of GA. There are many TSP solver crossover operators. In this paper, we state implementation of some recent TSP solver crossovers at first and then we use each of them in GA to solve some Symmetric TSP (STSP) instances and finally compare their effects on speed and accuracy of presented GA.

Mon Sep 24 2012
Neural Networks
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 is resolved by Genetic Algorithm (GA)
0
0
0
Tue Jan 14 2020
Neural Networks
New mechanism of combination crossover operators in genetic algorithm for solving the traveling salesman problem
Traveling salesman problem (TSP) is a well-known in computing field. There are many researches to improve the genetic algorithm for solving TSP. We propose two new crossover operators and new mechanism of combination crossover operators.
0
0
0
Wed Mar 14 2012
Neural Networks
A Comparative Study of Adaptive Crossover Operators for Genetic Algorithms to Resolve the Traveling Salesman Problem
Crossover operators play very important role by constructing competitive Genetic Algorithms (GAs) In this paper, the basic conceptual features and specific characteristics of various crossover operators are discussed. The results of experimental comparison of more than six different crossover operators for the TSP are presented.
0
0
0
Wed Jun 21 2017
Neural Networks
Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem
The algorithm incorporates several new features that contribute to its effectiveness. A new mutation performs a random jump within 3-opt or 4-opt neighborhood. A computational experiment shows that the proposed algorithm yields competitive results to other memetic algorithms.
0
0
0
Wed Mar 14 2012
Neural Networks
Analyzing the Performance of Mutation Operators to Solve the Travelling Salesman Problem
The Travelling Salesman Problem (TSP) is a combinatorial problem. A genetic algorithm includes some parameters that should be adjusted, so as to get reliable results.
0
0
0
Sat Aug 01 2015
Neural Networks
The Interactive Effects of Operators and Parameters to GA Performance Under Different Problem Sizes
The complex effect of genetic algorithm's (GA) operators and parameters to tumultuousits performance has been studied extensively by researchers in the past. We designed a GA to optimize a family of traveling salesman problems (TSP), with their optimal solutions known for convenient benchmarking. Using analysis of variance of factorial experiments, we found out that GA
0
0
0