{"id":{"repo_id":"vilnius","oai_identifier":"oai:vu.lt:elaba:81918815"},"canonical_url":"https://search.dev.ndltd.org/etd/vilnius/oai:vu.lt:elaba:81918815","repository":{"repo_id":"vilnius","name":"Vilnius University","base_url":"https://epublications.vu.lt/oai"},"display":{"title":"Tvarkaraščio sudarymo bibliotekų tyrimas /","abstract":"Scheduling problems are common problems that we face when we want to distribute available resources in a limited span of time. These tasks are often solved manually, however complex scheduling tasks are solved only with high computing power. Computers have been used to help solve this problem for more than fifty years. First mention of this can be found in C. Gotlieb's research paper on school scheduling task automation. The aim of this thesis is to analyze the possibilities of one of the selected libraries used for solving planning problems (\"JacOp\", \"Optaplanner\", \"Choco Solver\") based on the restriction groups used in these tasks. The chosen library is tested by solving the university timetabling tasks. Firstly, all commonly used to plan problem restrictions are split into groups. Then all the tasks used in the experiments are designed. Tasks defined for the experiments are each using a different kind of restriction group. Every task is done multiple times using every one of the following algorithms: Tabu search, Simulated Annealing, Late Acceptance Hill Climbing and simple Hill Climbing. The results of this research can be used to help choose the best algorithm for solving a planning problem based on the restriction groups used to define it. Experiments have shown a correlation between different restriction groups and algorithm effectiveness. However the results are not precise enough to state the most effective algorithm for every situation. Therefore more experiments need to be done to get more precise data.","abstract_html":"Scheduling problems are common problems that we face when we want to distribute available resources in a limited span of time. These tasks are often solved manually, however complex scheduling tasks are solved only with high computing power. Computers have been used to help solve this problem for more than fifty years. First mention of this can be found in C. Gotlieb's research paper on school scheduling task automation. The aim of this thesis is to analyze the possibilities of one of the selected libraries used for solving planning problems ("JacOp", "Optaplanner", "Choco Solver") based on the restriction groups used in these tasks. The chosen library is tested by solving the university timetabling tasks. Firstly, all commonly used to plan problem restrictions are split into groups. Then all the tasks used in the experiments are designed. Tasks defined for the experiments are each using a different kind of restriction group. Every task is done multiple times using every one of the following algorithms: Tabu search, Simulated Annealing, Late Acceptance Hill Climbing and simple Hill Climbing. The results of this research can be used to help choose the best algorithm for solving a planning problem based on the restriction groups used to define it. Experiments have shown a correlation between different restriction groups and algorithm effectiveness. However the results are not precise enough to state the most effective algorithm for every situation. Therefore more experiments need to be done to get more precise data.","abstract_has_math":false,"creators":["Misiūnas, Simonas,"],"institution":"Institutional Repository of Vilnius University","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":["Birštunas, Adomas"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2019,"date_issued":"2019","date_published":"2019","updated_at":"2026-07-24T05:55:48Z","subjects":[],"languages":["lit"],"rights":["info:eu-repo/semantics/openAccess"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://repository.vu.lt/VU:ELABAETD81918815&prefLang=en_US","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Birštunas, Adomas"]},{"key":"dc:creator","label":"Author","values":["Misiūnas, Simonas,"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2019"]},{"key":"dc:publisher","label":"Institution","values":["Institutional Repository of Vilnius University"]},{"key":"dc:relation","label":"Dc Relation","values":["https://epublications.vu.lt/object/elaba:81918815/81918815.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:ELABAETD81918815&prefLang=en_US"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Scheduling problems are common problems that we face when we want to distribute available resources in a limited span of time. These tasks are often solved manually, however complex scheduling tasks are solved only with high computing power. Computers have been used to help solve this problem for more than fifty years. First mention of this can be found in C. Gotlieb's research paper on school scheduling task automation. The aim of this thesis is to analyze the possibilities of one of the selected libraries used for solving planning problems (\"JacOp\", \"Optaplanner\", \"Choco Solver\") based on the restriction groups used in these tasks. The chosen library is tested by solving the university timetabling tasks. Firstly, all commonly used to plan problem restrictions are split into groups. Then all the tasks used in the experiments are designed. Tasks defined for the experiments are each using a different kind of restriction group. Every task is done multiple times using every one of the following algorithms: Tabu search, Simulated Annealing, Late Acceptance Hill Climbing and simple Hill Climbing. The results of this research can be used to help choose the best algorithm for solving a planning problem based on the restriction groups used to define it. Experiments have shown a correlation between different restriction groups and algorithm effectiveness. However the results are not precise enough to state the most effective algorithm for every situation. Therefore more experiments need to be done to get more precise data."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Tvarkaraščio sudarymo bibliotekų tyrimas /","Research of the timetable generation libraries."]}]}],"canonical_facts":{"dc:contributor":["Birštunas, Adomas"],"dc:creator":["Misiūnas, Simonas,"],"dc:date":["2019"],"dc:description":["Scheduling problems are common problems that we face when we want to distribute available resources in a limited span of time. These tasks are often solved manually, however complex scheduling tasks are solved only with high computing power. Computers have been used to help solve this problem for more than fifty years. First mention of this can be found in C. Gotlieb's research paper on school scheduling task automation. The aim of this thesis is to analyze the possibilities of one of the selected libraries used for solving planning problems (\"JacOp\", \"Optaplanner\", \"Choco Solver\") based on the restriction groups used in these tasks. The chosen library is tested by solving the university timetabling tasks. Firstly, all commonly used to plan problem restrictions are split into groups. Then all the tasks used in the experiments are designed. Tasks defined for the experiments are each using a different kind of restriction group. Every task is done multiple times using every one of the following algorithms: Tabu search, Simulated Annealing, Late Acceptance Hill Climbing and simple Hill Climbing. The results of this research can be used to help choose the best algorithm for solving a planning problem based on the restriction groups used to define it. Experiments have shown a correlation between different restriction groups and algorithm effectiveness. However the results are not precise enough to state the most effective algorithm for every situation. Therefore more experiments need to be done to get more precise data."],"dc:format":["application/pdf"],"dc:identifier":["https://repository.vu.lt/VU:ELABAETD81918815&prefLang=en_US"],"dc:language":["lit"],"dc:publisher":["Institutional Repository of Vilnius University"],"dc:relation":["https://epublications.vu.lt/object/elaba:81918815/81918815.pdf"],"dc:rights":["info:eu-repo/semantics/openAccess"],"dc:title":["Tvarkaraščio sudarymo bibliotekų tyrimas /","Research of the timetable generation libraries."],"dc:type":["info:eu-repo/semantics/bachelorThesis"]},"updated_at":"2026-07-24T05:55:48Z"}