國立虎尾科技大學 |

A Comparison of the Genetic Algorithm and the Mixing Genetic Algorithm.

紀錄類型:	書目-語言資料,手稿 : Monograph/item
正題名/作者:	A Comparison of the Genetic Algorithm and the Mixing Genetic Algorithm./
作者:	Gulfam, Muhammad.
面頁冊數:	1 online resource (94 pages)
附註:	Source: Masters Abstracts International, Volume: 82-03.
Contained By:	Masters Abstracts International82-03.
標題:	Computer science. -
電子資源:	click for full text (PQDT)
ISBN:	9798664770391

A Comparison of the Genetic Algorithm and the Mixing Genetic Algorithm.
Gulfam, Muhammad.

A Comparison of the Genetic Algorithm and the Mixing Genetic Algorithm. - 1 online resource (94 pages)

Source: Masters Abstracts International, Volume: 82-03.

Thesis (M.S.)--University of Minnesota, 2020.

Includes bibliographical references

Genetic Algorithms (GAs) are optimization techniques inspired by the idea of evolution. They can sometimes take a long time to find the solution to a problem, but it is not always obvious when, or how to configure their various parameters.Recently, a new GA was introduced [8] that has a lot of potential for parallelization. This algorithm, called the Mixing Genetic Algorithm, has shown promising results on the well-known Traveling Salesman Problem.In this work, we have compared the effectiveness of the Mixing GA over a traditional GA on three discrete optimization problems: the OneMax problem and two topologies of the Ising Model (Ising Model on Tree and Ising Model on Ring). The comparison has been done for the success rate at the given time, for the given problem size and size of population. The comparison has been done for, both, serial and parallel implementations. Overall, the success rate for the Mixing GA is better than the traditional GA. We have also compared two population selection methods, namely, tournament selection and generational population selection. The tournament selection outperformed generational population selection for all the problems and problem sizes that we experimented with.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2024

Mode of access: World Wide Web

ISBN: 9798664770391Subjects--Topical Terms:

573171
Computer science.
Subjects--Index Terms:

AlgorithmIndex Terms--Genre/Form:

554714
Electronic books.

A Comparison of the Genetic Algorithm and the Mixing Genetic Algorithm.
LDR:02521ntm a22003857 4500 001 1151961
005 20241125080153.5
006 m o d
007 cr mn ---uuuuu
008 250605s2020 xx obm 000 0 eng d
020 $a 9798664770391
035 $a (MiAaPQ)AAI28024571
035 $a AAI28024571
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Gulfam, Muhammad. $3 1478811
245 1 2 $a A Comparison of the Genetic Algorithm and the Mixing Genetic Algorithm.
264 0 $c 2020
300 $a 1 online resource (94 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Masters Abstracts International, Volume: 82-03.
500 $a Advisor: Sutton, Andrew.
502 $a Thesis (M.S.)--University of Minnesota, 2020.
504 $a Includes bibliographical references
520 $a Genetic Algorithms (GAs) are optimization techniques inspired by the idea of evolution. They can sometimes take a long time to find the solution to a problem, but it is not always obvious when, or how to configure their various parameters.Recently, a new GA was introduced [8] that has a lot of potential for parallelization. This algorithm, called the Mixing Genetic Algorithm, has shown promising results on the well-known Traveling Salesman Problem.In this work, we have compared the effectiveness of the Mixing GA over a traditional GA on three discrete optimization problems: the OneMax problem and two topologies of the Ising Model (Ising Model on Tree and Ising Model on Ring). The comparison has been done for the success rate at the given time, for the given problem size and size of population. The comparison has been done for, both, serial and parallel implementations. Overall, the success rate for the Mixing GA is better than the traditional GA. We have also compared two population selection methods, namely, tournament selection and generational population selection. The tournament selection outperformed generational population selection for all the problems and problem sizes that we experimented with.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2024
538 $a Mode of access: World Wide Web
650 4 $a Computer science. $3 573171
653 $a Algorithm
653 $a Comparison
653 $a Genetic
653 $a Ising model
653 $a Mixing
653 $a Genetic Algorithms
655 7 $a Electronic books. $2 local $3 554714
690 $a 0984
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a University of Minnesota. $b Computer Science. $3 1180176
773 0 $t Masters Abstracts International $g 82-03.
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28024571 $z click for full text (PQDT)