{"id":{"repo_id":"vilnius","oai_identifier":"oai:vu.lt:elaba:308336686"},"canonical_url":"https://search.ndltd.org/etd/vilnius/oai:vu.lt:elaba:308336686","repository":{"repo_id":"vilnius","name":"Vilnius University","base_url":"https://epublications.vu.lt/oai"},"display":{"title":"Genetiniai algoritmai ir jų taikymas gamtos ir tiksliuosiuose moksluose /","abstract":"This thesis examines genetic algorithms and their variations applied to optimization problems, with a particular focus on genetic and memetic algorithms. Other metaheuristic algorithms are also applied to the Sudoku solving problem for comparison. The thesis reviews the main principles of genetic algorithms, discusses theoretical aspects of their application, including schema theory and a Markov chain interpretation, and describes their practical implementation for solving selected optimization tasks. The practical part presents programs implementing memetic and genetic algorithms for optimization problems. In addition, several other metaheuristic methods are adapted and compared for the Sudoku problem. The experiments analyze how selected parameters, like mutation probability, population size and the number of iterations, affect algorithm convergence and solution quality. The results show that genetic, memetic and other metaheuristic algorithms can be applied to various optimization problems, although their effectiveness depends on the structure of the problem and the selected parameters.","abstract_html":"This thesis examines genetic algorithms and their variations applied to optimization problems, with a particular focus on genetic and memetic algorithms. Other metaheuristic algorithms are also applied to the Sudoku solving problem for comparison. The thesis reviews the main principles of genetic algorithms, discusses theoretical aspects of their application, including schema theory and a Markov chain interpretation, and describes their practical implementation for solving selected optimization tasks. The practical part presents programs implementing memetic and genetic algorithms for optimization problems. In addition, several other metaheuristic methods are adapted and compared for the Sudoku problem. The experiments analyze how selected parameters, like mutation probability, population size and the number of iterations, affect algorithm convergence and solution quality. The results show that genetic, memetic and other metaheuristic algorithms can be applied to various optimization problems, although their effectiveness depends on the structure of the problem and the selected parameters.","abstract_has_math":false,"creators":["Jusis, Vytautas,"],"institution":"Institutional Repository of Vilnius University","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2026,"date_issued":"2026","date_published":"2026","updated_at":"2026-11-19T10:12:59Z","subjects":[],"languages":["lit"],"rights":["info:eu-repo/semantics/openAccess"],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://repository.vu.lt/VU:ELABAETD308336686&prefLang=en_US","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://repository.vu.lt/VU:ELABAETD308336686&prefLang=en_US","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":"open","embargo_until":null,"access_note":null},"source_record":{"url":"https://epublications.vu.lt/oai?verb=GetRecord&metadataPrefix=oai_dc&identifier=oai%3Avu.lt%3Aelaba%3A308336686","prefix":"oai_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Jusis, Vytautas,"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2026"]},{"key":"dc:publisher","label":"Institution","values":["Institutional Repository of Vilnius University"]},{"key":"dc:relation","label":"Dc Relation","values":["https://epublications.vu.lt/object/elaba:308336686/308336686.pdf"]},{"key":"dc:type","label":"Dc Type","values":["info:eu-repo/semantics/bachelorThesis"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["lit"]},{"key":"dc:rights","label":"Dc Rights","values":["info:eu-repo/semantics/openAccess"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://repository.vu.lt/VU:ELABAETD308336686&prefLang=en_US"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["This thesis examines genetic algorithms and their variations applied to optimization problems, with a particular focus on genetic and memetic algorithms. Other metaheuristic algorithms are also applied to the Sudoku solving problem for comparison. The thesis reviews the main principles of genetic algorithms, discusses theoretical aspects of their application, including schema theory and a Markov chain interpretation, and describes their practical implementation for solving selected optimization tasks. The practical part presents programs implementing memetic and genetic algorithms for optimization problems. In addition, several other metaheuristic methods are adapted and compared for the Sudoku problem. The experiments analyze how selected parameters, like mutation probability, population size and the number of iterations, affect algorithm convergence and solution quality. The results show that genetic, memetic and other metaheuristic algorithms can be applied to various optimization problems, although their effectiveness depends on the structure of the problem and the selected parameters."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Genetiniai algoritmai ir jų taikymas gamtos ir tiksliuosiuose moksluose /","Genetic algorithms and their applications in the natural and exact sciences."]}]}],"canonical_facts":{"dc:creator":["Jusis, Vytautas,"],"dc:date":["2026"],"dc:description":["This thesis examines genetic algorithms and their variations applied to optimization problems, with a particular focus on genetic and memetic algorithms. Other metaheuristic algorithms are also applied to the Sudoku solving problem for comparison. The thesis reviews the main principles of genetic algorithms, discusses theoretical aspects of their application, including schema theory and a Markov chain interpretation, and describes their practical implementation for solving selected optimization tasks. The practical part presents programs implementing memetic and genetic algorithms for optimization problems. In addition, several other metaheuristic methods are adapted and compared for the Sudoku problem. The experiments analyze how selected parameters, like mutation probability, population size and the number of iterations, affect algorithm convergence and solution quality. The results show that genetic, memetic and other metaheuristic algorithms can be applied to various optimization problems, although their effectiveness depends on the structure of the problem and the selected parameters."],"dc:format":["application/pdf"],"dc:identifier":["https://repository.vu.lt/VU:ELABAETD308336686&prefLang=en_US"],"dc:language":["lit"],"dc:publisher":["Institutional Repository of Vilnius University"],"dc:relation":["https://epublications.vu.lt/object/elaba:308336686/308336686.pdf"],"dc:rights":["info:eu-repo/semantics/openAccess"],"dc:title":["Genetiniai algoritmai ir jų taikymas gamtos ir tiksliuosiuose moksluose /","Genetic algorithms and their applications in the natural and exact sciences."],"dc:type":["info:eu-repo/semantics/bachelorThesis"]},"updated_at":"2026-11-19T10:12:59Z"}