Proceedings of the third international conference on Genetic algorithms
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Genetic algorithms and tabu search: hybrids for optimization
Computers and Operations Research - Special issue on genetic algorithms
Pattern classification with genetic algorithms: incorporation of chromosome differentiation
Pattern Recognition Letters
Genotypic and phenotypic assortative mating in genetic algorithm
Information Sciences: an International Journal
Incorporating chromosome differentiation in genetic algorithms
Information Sciences: an International Journal
niGAVaPS — outbreeding in genetic algorithms
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Using assortative mating in genetic algorithms for vector quantization problems
Proceedings of the 2001 ACM symposium on Applied computing
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Tabu Search
Intelligent Optimisation Techniques: Genetic Algorithms, Tabu Search, Simulated Annealing and Neural Networks
Enhancing GA Performance through Crossover Prohibitions Based on Ancestry
Proceedings of the 6th International Conference on Genetic Algorithms
When Selection Meets Seduction
Proceedings of the 6th International Conference on Genetic Algorithms
A New GA Approach for the Vehicle Routing Problem
ICTAI '99 Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence
DCGA: a diversity control oriented genetic algorithm
ICTAI '97 Proceedings of the 9th International Conference on Tools with Artificial Intelligence
An analysis of the behavior of a class of genetic adaptive systems.
An analysis of the behavior of a class of genetic adaptive systems.
Parameter control in evolutionary algorithms
IEEE Transactions on Evolutionary Computation
Genetic algorithms for generation of class boundaries
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A tabu genetic algorithm with search area adaptation for the job-shop scheduling problem
AIKED'07 Proceedings of the 6th Conference on 6th WSEAS Int. Conf. on Artificial Intelligence, Knowledge Engineering and Data Bases - Volume 6
A tabu search approach for the minimum sum-of-squares clustering problem
Information Sciences: an International Journal
Sim-paramecium algorithm based on enhanced livability and competition
ICS'09 Proceedings of the 13th WSEAS international conference on Systems
Adaptive life-cycle and viability based paramecium-imitated evolutionary algorithm
WSEAS Transactions on Computers
Information Sciences: an International Journal
Honey bees mating optimization algorithm for the Euclidean traveling salesman problem
Information Sciences: an International Journal
Combinatorial complexity problem reduction by the use of artificial vaccines
Expert Systems with Applications: An International Journal
A novel mating approach for genetic algorithms
Evolutionary Computation
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
Genetic algorithms (GAs) are well-known heuristic algorithms and have been applied to solve a variety of complicated problems. When adopting GA approaches, two important issues--selection pressure and population diversity--must be considered. This work presents a novel mating strategy, called tabu genetic algorithm (TGA), which harmonizes these two issues by integrating tabu search (TS) into GA's selection. TGA incorporates the tabu list to prevent inbreeding so that population diversity can be maintained, and further utilizes the aspiration criterion to supply moderate selection pressure. An accompanied self-adaptive mutation method is also proposed to overcome the difficulty of determining mutation rate, which is sensitive to computing performance. The classic traveling salesman problem is used as a benchmark to validate the effectiveness of the proposed algorithm. Experimental results indicate that TGA can achieve harmony between population diversity and selection pressure. Comparisons with GA, TS, and hybrids of GA and TS further confirm the superiority of TGA in terms of both solution quality and convergence speed.