Dynamic diversity control in genetic algorithm for mining unsearched solution space in TSP problems

Authors:
Pei-Chann Chang;Wei-Hsiu Huang;Ching-Jung Ting
Affiliations:
Department of Information Management, Yuan Ze University, Taoyuan 32026, Taiwan, ROC and Department of Industrial Engineering and Management, Yuan Ze University, Taoyuan 32026, Taiwan, ROC;Department of Industrial Engineering and Management, Yuan Ze University, Taoyuan 32026, Taiwan, ROC;Department of Industrial Engineering and Management, Yuan Ze University, Taoyuan 32026, Taiwan, ROC
Venue:
Expert Systems with Applications: An International Journal
Year:
2010

Citing 13
Cited 4

Genetic algorithms with sharing for multimodal function optimization

Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
An analysis of the effects of selection in genetic algorithms

An analysis of the effects of selection in genetic algorithms
The GENITOR algorithm and selection pressure: why rank-based allocation of reproductive trials is best

Proceedings of the third international conference on Genetic algorithms
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators

Artificial Intelligence Review
Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization

Proceedings of the 5th International Conference on Genetic Algorithms
A New Genetic Algorithm Using Large Mutation Rates and Population-Elitist Selection (GALME)

ICTAI '96 Proceedings of the 8th International Conference on Tools with Artificial Intelligence
GA-EDA: hybrid evolutionary algorithm using genetic and estimation of distribution algorithms

IEA/AIE'2004 Proceedings of the 17th international conference on Innovations in applied artificial intelligence
Sub-population genetic algorithm with mining gene structures for multiobjective flowshop scheduling problems

Expert Systems with Applications: An International Journal
Using a co-operative co-evolutionary genetic algorithm to solve optimal control problems in a hysteresis system

CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Mining gene structures to inject artificial chromosomes for genetic algorithm in single machine scheduling problems

Applied Soft Computing
Forking genetic algorithms: Gas with search space division schemes

Evolutionary Computation
Multiobjective optimization and multiple constraint handling with evolutionary algorithms. I. A unified formulation

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

A new geometric shape-based genetic clustering algorithm for the multi-depot vehicle routing problem

Expert Systems with Applications: An International Journal
Application of Genetic Algorithm in unit selection for Malay speech synthesis system

Expert Systems with Applications: An International Journal
Application of neural networks to the study of the influence of diet and lifestyle on the value of bone mineral density in post-menopausal women

Mathematical and Computer Modelling: An International Journal
Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	12.06

Visualization

Abstract

The applications of genetic algorithms (GAs) in solving combinatorial problems are frequently faced with a problem of early convergence and the evolutionary processes are often trapped in a local optimum. This premature convergence occurs when the population of a genetic algorithm reaches a suboptimal state that the genetic operators can no longer produce offspring with a better performance than their parents. In the literature, plenty of work has been investigated to introduce new methods and operators in order to overcome this essential problem of genetic algorithms. As these methods and the belonging operators are rather problem specific in general. In this research, we take a different approach by constantly observing the progress of the evolutionary process and when the diversity of the population dropping below a threshold level then artificial chromosomes with high diversity will be introduced to increase the average diversity level thus to ensure the process can jump out the local optimum and to revolve again. A dynamic threshold control mechanism is built up during the evolutionary process to further improve the system performance. The proposed method is implemented independently of the problem characteristics and can be applied to improve the global convergence behavior of genetic algorithms. The experimental results using TSP instances show that the proposed approach is very effective in preventing the premature convergence when compared with other approaches.