Local optimization and the traveling salesman problem
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Adaptive crossover in genetic algorithms using statistics mechanism
ICAL 2003 Proceedings of the eighth international conference on Artificial life
An analysis of the behavior of a class of genetic adaptive systems.
An analysis of the behavior of a class of genetic adaptive systems.
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Clustering-Based Adaptive Crossover and Mutation Probabilities for Genetic Algorithms
IEEE Transactions on Evolutionary Computation
| Hi-index | 0.00 |
Traveling salesman problem (TSP) is a classical NP-hard problem in combinational optimization. This paper adopted a novel genetic algorithm which adjust the crossover probability and mutation probability adaptively based on clustering and fuzzy system, and designed a new crossover operator to improve the performance of genetic algorithm (GA) for TSP. Experiments show that the proposed method is much better than the standard genetic algorithm with a higher convergent rate and success rate.