Optimalaus mokyklos tvarkaraščio sudarymo problema
Lina Pupeikienė, Eugenijus Kurilovas
Informacijos Mokslai · 2009
doi:10.15388/im.2009.0.3303 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
Straipsnyje aprašomas profi linių klasių tvarkaraščio sudarymas. Šio tipo uždaviniams spręsti nėra sukurta polinominio sudėtingumo algoritmų, todėl naudojami euristiniai optimizavimo metodai. Šiame straipsnyje aprašomi rezultatai, gauti naudojant lokalios paieškos metodus – lokalų determinuotą, lokalų atsitiktinį, atkaitinimo modeliavimo ir Bayeso – siekiant palengvinti profi linių klasių uždavinio sprendimą. Straipsnyje aprašoma nauja metodika tokio tipo uždaviniams spręsti. Tai Atkaitinimo modeliavimo parametrų optimizavimas naudojant Bayeso metodus. Kitas naujumas, aprašomas šiame straipsnyje, yra vektorinis optimizavimas naudojant tokius Pareto optimalius tvarkaraščius, kurie tenkintų individualius euristinius mokyklos kriterijus. Sukurtoje programoje „Optima“ yra įdiegti keturi optimizavimo metodai. Analizuojami rezultatai gauti taikant šiuos metodus. Optimal School Scheduling Problem Lina Pupeikienė, Eugenijus Kurilovas Summary The main problem investigated in the paper is optimization of the profi led school schedule. This kind of task does not have any algorithms of polynomial complexity therefore the principal attention is paid to heuristic methods. The paper reports on the results of experimentation with the local search techniques – such as Local, Local Random, Simulated Annealing and Bayes – for optimization of the profi led school schedule. A new element of this work is optimization of Simulated Annealing (SA) parameters using special Bayes (BA) methods. Another new element is application of vectorial optimization theory by fi xing Pareto optimal schedules such that would satisfy the subjective criteria of a concrete school. The created “Optima” program has four optimization algorithms for making the best school schedule. The results of application of each technique are analyzed.
Abstract licence: CC BY
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.