A study of permutation crossover operators on the traveling salesman problem
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
A parallel tabu search algorithm for large traveling salesman problems
Discrete Applied Mathematics
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators
Artificial Intelligence Review
Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator
Proceedings of the 3rd International Conference on Genetic Algorithms
A New Approach on the Traveling Salesman Problem by Genetic Algorithms
Proceedings of the 5th International Conference on Genetic Algorithms
Applying Genetic Algorithms To Finding The Optimal Gene Order In Displaying The Microarray Data
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
New Operators of Genetic Algorithms for Traveling Salesman Problem
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 2 - Volume 02
Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
Computers and Operations Research
Finding the optimal gene order in displaying microarray data
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
An evolutionary algorithm for large traveling salesman problems
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A novel genetic algorithm based on immunity
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Biologically inspired non-mendelian repair for constraint handling in evolutionary algorithms
Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
Hi-index | 0.00 |
This paper deals with some new operators of genetic algorithms and demonstrates their effectiveness to the traveling salesman problem (TSP) and microarray gene ordering. The new operators developed are nearest fragment operator based on the concept of nearest neighbor heuristic, and a modified version of order crossover operator. While these result in faster convergence of Genetic Algorithm (GAs) in finding the optimal order of genes in microarray and cities in TSP, the nearest fragment operator can augment the search space quickly and thus obtain much better results compared to other heuristics. Appropriate number of fragments for the nearest fragment operator and appropriate substring length in terms of the number of cities/genes for the modified order crossover operator are determined systematically. Gene order provided by the proposed method is seen to be superior to other related methods based on GAs, neural networks and clustering in terms of biological scores computed using categorization of the genes.