Age and life-span was imported to genetic algorithm for overcoming the low efficiency, when the algorithm is used to Vehicle Routing Problem. Multi-generation Compete Genetic Algorithm is put forward. At each iteration some individuals are updated by descendible mode. Each individual, according to its age and life-span, is judged whether it is kept down to next generation population, or its life was terminated. By this means, survived generations of some better individuals were prolonged in the generation population and the probability of their propagation increased. Some better solutions are presented through using the algorithms.
Multi-Generation Compete Genetic Algorithms and Its Application in Vehicle Routing Problem
First International Conference on Transportation Engineering ; 2007 ; Southwest Jiaotong University, Chengdu, China
2007-07-09
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Multi-Generation Compete Genetic Algorithms and Its Application in Vehicle Routing Problem
British Library Conference Proceedings | 2007
|Genetic Algorithms for Vehicle Routing Problem in Deliver System
British Library Conference Proceedings | 1994
|Vehicle routing problem using genetic algorithms based on adjacency relations
Kraftfahrwesen | 1995
|Vehicle Routing Problem Using Genetic Algorithms Based on Adjacency Relations
British Library Conference Proceedings | 1995
|