9783659891908 - The Role of Selection in Genetic Algorithms di Shakir, Ali; Ali, Salim; Mohd Rahim, Mohd Shafry (9 risultati)

Condizione: New.

Paperback. Condizione: Brand New. 88 pages. 8.66x5.91x0.20 inches. In Stock.

Taschenbuch. Condizione: Neu. The Role of Selection in Genetic Algorithms | Ali Shakir (u. a.) | Taschenbuch | 88 S. | Englisch | 2017 | LAP LAMBERT Academic Publishing | EAN 9783659891908 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.

Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Genetic algorithm has become a suitable searching or optimization tool for solving many complex problems comparing with the traditional search techniques. Genetic algorithm contains many manipulations to speed up and improve the genetic algorithm performance; one of these manipulations is the selection operations. The selection refers to select the best individual in the population and make it as parent in the next generation; the worst individual may be not select always. This process is done by using many different selection schemes. Three problems, Traveling Salesman Problem, Knapsack Problem and Solving Instantaneous Linear Algebraic Equation Problem are solved in this thesis by genetic algorithms with six different selection strategies, these schemes, the implementation, discussion of their effects on the performance of genetic algorithm and comparison between them as well as with the other works which are illustrated in this thesis. Finally, it is found that the uses of selection mechanisms are important to make genetic algorithm less susceptible to premature convergence and speed up the search process of finding the optimal solution. 88 pp. Englisch.

Condizione: New. Print on Demand.

Condizione: New. PRINT ON DEMAND.

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Shakir AliAli Shakir Mahmood is a lecturer in AL-Mustansiriyah University, Iraq, birthday at 18th December 1981. The bachelor in Science of Programming Engineering from Al-Rafidain University College/Iraq. The master in Computer Scie.

Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Genetic algorithm has become a suitable searching or optimization tool for solving many complex problems comparing with the traditional search techniques. Genetic algorithm contains many manipulations to speed up and improve the genetic algorithm performance; one of these manipulations is the selection operations. The selection refers to select the best individual in the population and make it as parent in the next generation; the worst individual may be not select always. This process is done by using many different selection schemes. Three problems, Traveling Salesman Problem, Knapsack Problem and Solving Instantaneous Linear Algebraic Equation Problem are solved in this thesis by genetic algorithms with six different selection strategies, these schemes, the implementation, discussion of their effects on the performance of genetic algorithm and comparison between them as well as with the other works which are illustrated in this thesis. Finally, it is found that the uses of selection mechanisms are important to make genetic algorithm less susceptible to premature convergence and speed up the search process of finding the optimal solution.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 88 pp. Englisch.

Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Genetic algorithm has become a suitable searching or optimization tool for solving many complex problems comparing with the traditional search techniques. Genetic algorithm contains many manipulations to speed up and improve the genetic algorithm performance; one of these manipulations is the selection operations. The selection refers to select the best individual in the population and make it as parent in the next generation; the worst individual may be not select always. This process is done by using many different selection schemes. Three problems, Traveling Salesman Problem, Knapsack Problem and Solving Instantaneous Linear Algebraic Equation Problem are solved in this thesis by genetic algorithms with six different selection strategies, these schemes, the implementation, discussion of their effects on the performance of genetic algorithm and comparison between them as well as with the other works which are illustrated in this thesis. Finally, it is found that the uses of selection mechanisms are important to make genetic algorithm less susceptible to premature convergence and speed up the search process of finding the optimal solution.