This paper presents an approach to combine competent crossover and mutation operators via probabilistic model building. Both operators are based on the probabilistic model buildin...
Traditionally, the mutation rates of genetic algorithms are fixed or decrease over the generations. Although it seems to be reasonable for classical genetic algorithms, it may not...
Recent work has provided functions that can be used to prove a principled distinction between the capabilities of mutation-based and crossover-based algorithms. However, prior fun...
This paper presents the virtual gene genetic algorithm (vgGA) which is a generalization of traditional genetic algorithms that use binary linear chromosomes. In the vgGA, tradition...
This paper presents a genetic algorithmic approach to the shortest path (SP) routing problem. Variable-length chromosomes (strings) and their genes (parameters) have been used for ...