Wyniki wyszukiwania:

The traveling salesman problem (TSP) is one of the most widely studied NP hard combinatorial optimization problems and has already solved in the semi-optimal manners using numbers of different methods. Among them, Genetic Algorithms (GA) is pre-dominating. In this paper I solve the problem with a new operator, Inver-over, for an evolutionary algorithm for the TSP. This operator outperforms all other genetic operators, whether unary or binary, which was first introduced by Guo Tao and Zbigniew Michalewicz. I also propose a new algorithm for solving TSP and also introduced it modified version....

Now a day s Genetic Algorithms (GAs) become a rapidly growing field of computer science. In a Genetic Algorithms (GAs) have many fields to consider for development and have a lot of properties that makes it a good choice when one needs to solve very complicated problems. The performance of genetic algorithms is varied for different parameters that are used. So optimization of a problem by using Genetic algorithms (GAs) is one of the most popular research fields. One of the reasons for this is because of the complicated relation between the parameters and factors such as the complexity of the...