Spelling suggestions: "subject:"schedule optimization"" "subject:"aschedule optimization""
1 |
Mokyklos tvarkaraščių optimizavimas / School schedule optimizingPupeikienė, Lina 25 May 2004 (has links)
In this work was created algorithm of SA – Simulated Annealing method and GMJ – Global Minimizer for Java. GMJ it’s solution of so called frames of optimised tasks. The method of SA is a technique that has attracted significant attention as suitable for optimization problems of large scale. For practical purposes, simulated annealing has effectively “solved” the famous travelling salesman. At the heart of the method of simulated annealing is an analogy with thermodynamics, specifically with the way that liquids freeze and crystallize, or metals cool and anneal. So the essence of the process is slow cooling, allowing ample time for redistribution of the atoms as they lose mobility. This is the technical definition of annealing, and it is essential for ensuring that a low energy state will be achieved. GMJ – it’s a software solution of so called frames of global optimisation tasks. This method realizes: · algorithms of global optimisation (methods), · functions, that’s can be optimised (tasks), · objects, that’s can be showed on display (analysis). After the program was created, exhaustive inquiry of in this work realized methods was done: analysed influence of teachers, students and others different restrains multipliers to school scheduler making. The research was done using the data of college of Marijampolė. There was accomplished theoretical and experimental comparison of SA and the school schedule programs of others firms.
|
2 |
Optimerad schemaläggning av mötesbokningarAndersson, Viktor January 2020 (has links)
Kommunikation är en grundpelare för alla verksamheter och företag där möten är ett av de primära sätten för att samtala och fatta gemensamma beslut. Problemet som kan uppstå i samband med att en bokning av ett möte ska utföras är att försöka finna en tid då alla önskade mötesdeltagare kan delta vilket kan vara en tröttsam och tidskrävande process om många deltagare ska ingå i mötet. Detta är ett bekymmer som uppstår hos IT-företaget Easit som fokuserar på mjukvarulösningar åt företag och myndigheter. Arbetet syftar till att undersöka de anställdas uppfattning kring mötesbokningar, vilka verktyg de använder i dagsläget för att boka möten och slutligen formulera och implementera en byggsten i form av en målfunktion för att förhindra de problem som beskrivs i undersökningen. Konstruktionen sker i form av en webbapplikation skapat med främst programmeringsspråket Java men också olika ramverk och verktyg för att förenkla processen i att uppnå en dynamisk applikation. Applikationen upprättar koppling till Microsoft Outlooks API där data sedan extraheras från kalendrar baserat på delvis modifierad data från en anställds schema på företaget. Målfunktionen tillämpas på den data som extraherats för villkor som användaren fyllt i, på det vis beräkna ett slags betyg för potentiella mötesbokningar. Målfunktionen som är en optimerad algoritm jämförs med en greedy-algoritm för att presentera den optimerade algoritmens potential för problembeskrivningen. Den fortsatta utvecklingen utförs genom att formulera bivillkor vars syfte är att bredda den optimerade algoritmens flexibilitet och djup. Resultatet för arbetet är en grund för optimering av scheman med potential för fortsatt utveckling. / Communication is a foundation pillar for all businesses and companies where meetings is one of the primary ways to converse and take collective decisions. The problem which can arise in the procedure of booking a meeting is trying to find a suitable time for every desired participant which could be a tedious and time-consuming task if many participants are to be included in the meeting. This is an issue that has risen at an IT company named Easit which focuses on software solutions for other companies and authorities. The aim of the project is to investigate the employees opinion of this issue, the tools they use today for the process of booking a meeting and finally formulate and implement a building block in the form of a target function which will be used to prevent the problems that are stated in the investigation. The construction is to be performed in the form of a web application created with the programming language Java together with different frameworks and tools to simplify the process of achieving a dynamic application. The application establishes a connection to the Microsoft Outlook API which will then be used to extract data from different calendars based of partly modified data from an employee’s schedule. The target function will be applied to the data extracted dependent on the conditions stated by the user and based on that; a kind of grade will be applied to every possible meeting time found. The target function which is an optimized algorithm is compared to a greedy-algorithm to present the optimized functions potential for the problem specified. If future work is to be done on the project, the main focus should lie on formulating additional constraints and parameters which can widen the optimized algorithm flexibility and depth. The result for this project is a foundation for optimizing schedules depending on multiple calendars together with potential for future work.
|
3 |
Investigation and Applikation of Profilled Schools Schedulling Tasks Optimimization Methods / Optimizavimo metodų tyrimas ir taikymas profiliuotų mokyklų tvarkaraščių sudarymo uždaviniuosePupeikienė, Lina 08 June 2009 (has links)
The problem of profiled school scheduling is important for Lithuanian schools and for similar schools in many other countries. No polynomial time methods are known for this problem.
The objective of this PhD thesis is to investigate heuristic methods for optimization of profiled school schedules. The convenience of application in real-life situations is provided by the vector optimization approach using platform-independent software implementation.
The task of experimental investigation is to select such parameters of heuristic methods that minimize expected deviation from the optimum.
Four optimization methods were regarded: Local Deterministic (LD), Local Randomized (LR), Simulated Annealing (SA), and SA with parameters optimized using the Bayesian approach (BA). The composite method of AM and BA provided the best results.
In Chapter 1 of the dissertation, various aspects of work of optimization methods as well as popular program languages suitable for school schedule optimization are analyzed. Literature about school scheduling is analysed.
In Chapter 2, conclusions are drawn how the optimization of heuristic parameters influences the speed and accuracy of finding the optimal solution. A technical rating analysis of popular schedule programs is made and technical disadvantages are listed. Criteria for evaluating the quality of results are proposed that include heuristic parameters in search of optimal schedules. Recommendations are states how to assess the choice and... [to full text] / Profiliuotos mokyklos tvarkaraščio kūrimas yra aktualus uždavinys tiek Lietuvoje, tiek kitose šalyse. Nėra žinoma polinominių būdų šiai problemai spręsti.
Pagrindinis šios daktaro disertacijos objektas yra ištirti euristinius metodus, skirtus profiliuotos mokyklos tvarkaraščio optimizavimui. Tvarkaraščio formavimo kriterijai, kurie yra reikalingi realiame gyvenime, nustatomi vektorinio optimizavimo metodais bei realizuojami nuo operacinės sistemos nepriklausoma programine įranga.
Eksperimentinių tyrimų uždavinys – surasti tokius euristinių metodų parametrus, kurie minimizuotų numatytą nuokrypį.
Disertacijoje aprašomi keturi optimizavimo metodai: lokalus determinuotas (LD), lokalus atsitiktinis (LA), atkaitinimo modeliavimo (AM) ir AM parametrų optimizavimas naudojant Bayes (BA) metodą. Kombinuotas AM ir Bayes metodas duoda geriausius rezultatus.
Pirmajame apžvelgiama su mokyklos tvarkaraščių formavimu susijusi literatūra. Analizuojami tinkamiausi optimizavimo metodų darbo aspektai. Analizuojamos populiariausios programavimo kalbos, tinkančios kurti mokyklų tvarkaraščių optimizavimo programą.
Antrajame skyriuje formuluojamas profiliuotų mokyklų tvarkaraščio kūrimo matematinis modelis. Analizuojami profiliuotose mokyklose naudojami euristiniai parametrai. Atlikti populiarių tvarkaraščių programų vertinimai ir analizės. Įvardijami šių programų trūkumai.
Trečiajame skyriuje, remiantis 2 skyriaus analize ir išvadomis, pateiktas profiliuotos mokyklos lanksčios tvarkaraščio... [toliau žr. visą tekstą]
|
4 |
Optimizavimo metodų tyrimas ir taikymas profiliuotų mokyklų tvarkaraščių sudarymo uždaviniuose / Investigation and applikation of profilled schools schedulling tasks optimimization methodsPupeikienė, Lina 08 June 2009 (has links)
Profiliuotos mokyklos tvarkaraščio kūrimas yra aktualus uždavinys tiek Lietuvoje, tiek kitose šalyse. Nėra žinoma polinominių būdų šiai problemai spręsti.
Pagrindinis šios daktaro disertacijos objektas yra ištirti euristinius metodus, skirtus profiliuotos mokyklos tvarkaraščio optimizavimui. Tvarkaraščio formavimo kriterijai, kurie yra reikalingi realiame gyvenime, nustatomi vektorinio optimizavimo metodais bei realizuojami nuo operacinės sistemos nepriklausoma programine įranga.
Eksperimentinių tyrimų uždavinys – surasti tokius euristinių metodų parametrus, kurie minimizuotų numatytą nuokrypį.
Disertacijoje aprašomi keturi optimizavimo metodai: lokalus determinuotas (LD), lokalus atsitiktinis (LA), atkaitinimo modeliavimo (AM) ir AM parametrų optimizavimas naudojant Bayes (BA) metodą. Kombinuotas AM ir Bayes metodas duoda geriausius rezultatus.
Pirmajame apžvelgiama su mokyklos tvarkaraščių formavimu susijusi literatūra. Analizuojami tinkamiausi optimizavimo metodų darbo aspektai. Analizuojamos populiariausios programavimo kalbos, tinkančios kurti mokyklų tvarkaraščių optimizavimo programą.
Antrajame skyriuje formuluojamas profiliuotų mokyklų tvarkaraščio kūrimo matematinis modelis. Analizuojami profiliuotose mokyklose naudojami euristiniai parametrai. Atlikti populiarių tvarkaraščių programų vertinimai ir analizės. Įvardijami šių programų trūkumai.
Trečiajame skyriuje, remiantis 2 skyriaus analize ir išvadomis, pateiktas profiliuotos mokyklos lanksčios tvarkaraščio... [toliau žr. visą tekstą] / The problem of profiled school scheduling is important for Lithuanian schools and for similar schools in many other countries. No polynomial time methods are known for this problem.
The objective of this PhD thesis is to investigate heuristic methods for optimization of profiled school schedules. The convenience of application in real-life situations is provided by the vector optimization approach using platform-independent software implementation.
The task of experimental investigation is to select such parameters of heuristic methods that minimize expected deviation from the optimum.
Four optimization methods were regarded: Local Deterministic (LD), Local Randomized (LR), Simulated Annealing (SA), and SA with parameters optimized using the Bayesian approach (BA). The composite method of AM and BA provided the best results.
In Chapter 1 of the dissertation, various aspects of work of optimization methods as well as popular program languages suitable for school schedule optimization are analyzed. Literature about school scheduling is analysed.
In Chapter 2, conclusions are drawn how the optimization of heuristic parameters influences the speed and accuracy of finding the optimal solution. A technical rating analysis of popular schedule programs is made and technical disadvantages are listed. Criteria for evaluating the quality of results are proposed that include heuristic parameters in search of optimal schedules. Recommendations are states how to assess the choice and... [to full text]
|
Page generated in 0.1262 seconds