New evolutionary genetic algorithms for NP-complete combinatorial optimization problems

✍ Scribed by Fam Quang Bac; V. L. Perov

• Publisher: Springer-Verlag
• Year: 1993
• Tongue: English
• Weight: 424 KB
• Volume: 69
• Category: Article
• ISSN: 0340-1200
• DOI: 10.1007/bf00198963

✦ Synopsis

Evolutionary genetic algorithms have been proposed to solve NP-complete combinatorial optimization problems. A new crossover operator based on group theory has been created. Computational processes motivated by proposed evolutionary genetic algorithms were described as stochastic processes, using population dynamics and interactive markovian chains. The proposed algorithms were used in solving flowshop problems and an asymmetric traveling salesman problem. The experimental results showed the superiority of new evolutionary algorithms in comparison with the standard genetic algorithm.