Pour voir les autres types de publications sur ce sujet consultez le lien suivant : Heuristiek.
Thèses sur le sujet « Heuristiek »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Consultez les 50 meilleures thèses pour votre recherche sur le sujet « Heuristiek ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Parcourez les thèses sur diverses disciplines et organisez correctement votre bibliographie.
1
Buvari, Oscar. « Heuristisk utvärdering : En jämförelse mellan heuristiska uppsättningar för användargränssnitt i spel ». Thesis, Högskolan i Skövde, Institutionen för informationsteknologi, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-13868.
Texte intégralRésumé :
Det användarcentrerande tillvägagångssättet från människa-datorinteraktion (MDI) har anammats av många andra discipliner – där två aktuella discipliner som gjort detta är User Experience Design (UXD), vars mål är att skapa användbara mjukvaror ifrån användarnas perspektiv, och speldesign, som syftar till att skapa underhållande mjukvaror. För att göra detta använder båda dessa discipliner heuristisk utvärdering; där UXD använder traditionella heuristiker för användbarhet, medan speldesign på akademisk nivå utvecklat nya uppsättningar med spelheuristiker som är anpassade för spel. Dessa nya uppsättningar är inte validerade, då de brister i empiriska studier. Därför syftar detta arbete till att validera två nya uppsättningar spelheuristiker, samt att undersöka vilket extra värde de har, om något, gentemot traditionella uppsättningar heuristiker för användbarhet under utvärdering av gränssnitt i spel. Metoden bestod först av en heuristisk utvärdering där tre utvärderare utvärderade den globala Spelmenyn i RPG-spelet The Witcher 3: Wild Hunt, där båda uppsättningarna spelheuristiker och Nielsens 10 heuristiker för användbarhet användes, och sedan gjordes ett användartest på samma gränssnitt. Användartestet bestod av fem deltagare, alla män mellan åldrarna 20-23 och var studenter vid Högskolan i Skövde. Undersökningen resulterade i tre totala listor problem, en från respektive uppsättning, som sedan jämfördes med en lista med problem från användartestet. Slutsatsen blev att spelheuristikerna är lämpliga att använda under utvärderingen av menyer som liknar Spelmenyn, och är därmed validerade under dessa omständigheter. Dock finns det inget underlag att anta att spelheuristikerna medför ett extra märkbart värde än heuristikerna för användbarhet under utvärderingen av gränssnitt i spel.
2
Peake, Katharine Louise. « Composition heuristics and theories and a proposed heuristic for business writing ». CSUSB ScholarWorks, 2007. https://scholarworks.lib.csusb.edu/etd-project/3282.
Texte intégral
3
Menchini, Tom, et Karl Åkerlund. « Jämförelse av nya och gamla heuristiker inom heuristisk utvärdering : Är det dags för förändring ? » Thesis, Umeå universitet, Institutionen för psykologi, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-122223.
Texte intégralRésumé :
Heuristisk utvärdering av användargränssnitt är känt för att vara billigare och snabbare än användarutvärdering. Ett problem är att den inte finner samma användbarhetsproblem som riktiga användare. Petrie och Powers heuristiker för heuristisk utvärdering utvärderades för att utreda ifall de löst detta problem. Syftet för studien var att bidra till forskningsområdet genom att styrka eller motsäga tidigare fynd. Genom en fallstudie utfördes användarutvärdering och heuristisk utvärdering och mått på Validity, Thoroughness och Effectiveness jämfördes mellan tre olika studier. Vid användarutvärdering användes riktiga användare som arbetar med programvaran. Utvärderarna vid heuristisk utvärdering läste kognitionsvetenskap och räknades som noviser inom användbarhetsutvärdering. Petrie och Powers heuristiker presterade likvärdigt med Nielsens heuristiker i de andra studierna som jämfördes mot. Hypotesen att Petrie och Powers heuristiker bättre skulle predicera användbarhetsproblem gick följaktligen inte att styrka.
4
Silva, Renato Teixeira da [UNESP]. « Aplicação de meta-heurísticas na resolução do problema de balanceamento e designação de trabalhadores com deficiência em linha de produção ». Universidade Estadual Paulista (UNESP), 2012. http://hdl.handle.net/11449/93081.
Texte intégralRésumé :
Made available in DSpace on 2014-06-11T19:26:18Z (GMT). No. of bitstreams: 0
Previous issue date: 2012-10-26Bitstream added on 2014-06-13T19:33:57Z : No. of bitstreams: 1
silva_rt_me_guara.pdf: 445223 bytes, checksum: f6563e16194940a8f4f8abc7c03ac033 (MD5)Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
A Organização Internacional do Trabalho estima que existem cerca de 650 milhões de pessoas com deficiência em idade produtiva. No entanto, esta parcela da população possui altos índices de desemprego devido a várias barreiras. Uma alternativa para facilitar a inclusão dessas pessoas é a criação de Centros de Trabalho para pessoas com Deficiência (CTD`s) onde as pessoas com deficiência tenham a oportunidade de experimentar um ambiente de trabalho real antes de irem para um emprego “normal”. Neste tipo de ambiente, onde é impossível ao gestor prever quais trabalhadores estarão disponíveis a cada dia devido às altas taxas de absenteísmo, há a necessidade de se definir uma organização mais produtiva diariamente. Neste contexto se torna oportuna a utilização do Problema de Balanceamento de Linha e Designação de Trabalhadores (em inglês ALWABP), onde se busca minimizar o tempo de ciclo a partir de um dado número de trabalhadores, alocando tarefas às estações de trabalho e trabalhadores às estações, tendo em vista que alguns trabalhadores podem ser muito lentos para executar certas tarefas ou até incapazes, devido a alguma deficiência que eles apresentam, e muito eficientes na execução de outras. O objetivo geral desta dissertação consiste em empregar diferentes meta-heurísticas para resolver o ALWABP, comparando com os melhores resultados das instâncias encontradas na literatura. Dentre várias meta-heurísticas disponíveis na literatura foram utilizados o Harmony Search (HS), o Adaptive Large Neighborhood Search (ALNS) e o Clustering Search (CS) utilizando o HS e o ALNS como heurísticas geradoras de soluções. Cada uma das quatro implementações foram testadas em 320 instâncias propostas na literatura divididas em quatro famílias. Os experimentos computacionais mostraram bons resultados...
The International Labour Organization estimates that there are approximately 650 million disabled people in working age. However, this population presents high rates of unemployment due to numerous barriers. An alternative to facilitate the inclusion of these people is the establishment of Centers for Working People with Disabilities where people with disabilities have the opportunity to experience a real work environment before going to a “normal” job. In this type of environment, where it is impossible to predict which workers will be available each day due to high rates of absence in this population, there is a need to define a more productive organization on a daily basis. In this context it becomes appropriate to use the Assembly Line Worker Assignment and Balancing Problem (ALWABP), which seeks to minimize the cycle time for a given number of workers, assigning tasks to workstations and workers to stations, considering that some workers may be too slow to perform certain tasks, or even unable due to some deficiency they present, and very efficient in performing others. The aim of this dissertation is to employ different meta-heuristics to solve the ALWABP, comparing with the best results of instances found in the literature. Among several meta-heuristics available in the literature were used Harmony Search (HS), Adaptive Large Neighborhood Search (ALNS) and Clustering Search (CS) using the HS and ALNS as heuristics for the generation of solutions. Each of the four implementations has been tested in 320 instances proposed in the literature, classified into four families. The computational experiments showed good results, and in some instances obtaining better solution values best known. Conclusions regarding... (Complete abstract click electronic access below)
5
Silva, Renato Teixeira da. « Aplicação de meta-heurísticas na resolução do problema de balanceamento e designação de trabalhadores com deficiência em linha de produção / ». Guaratinguetá : [s.n.], 2012. http://hdl.handle.net/11449/93081.
Texte intégralRésumé :
Orientador: Galeno José de SenaBanca: Marcos Antonio Pereira
Banca: Anibal Tavares de Azevedo
Resumo: A Organização Internacional do Trabalho estima que existem cerca de 650 milhões de pessoas com deficiência em idade produtiva. No entanto, esta parcela da população possui altos índices de desemprego devido a várias barreiras. Uma alternativa para facilitar a inclusão dessas pessoas é a criação de Centros de Trabalho para pessoas com Deficiência (CTD's) onde as pessoas com deficiência tenham a oportunidade de experimentar um ambiente de trabalho real antes de irem para um emprego "normal". Neste tipo de ambiente, onde é impossível ao gestor prever quais trabalhadores estarão disponíveis a cada dia devido às altas taxas de absenteísmo, há a necessidade de se definir uma organização mais produtiva diariamente. Neste contexto se torna oportuna a utilização do Problema de Balanceamento de Linha e Designação de Trabalhadores (em inglês ALWABP), onde se busca minimizar o tempo de ciclo a partir de um dado número de trabalhadores, alocando tarefas às estações de trabalho e trabalhadores às estações, tendo em vista que alguns trabalhadores podem ser muito lentos para executar certas tarefas ou até incapazes, devido a alguma deficiência que eles apresentam, e muito eficientes na execução de outras. O objetivo geral desta dissertação consiste em empregar diferentes meta-heurísticas para resolver o ALWABP, comparando com os melhores resultados das instâncias encontradas na literatura. Dentre várias meta-heurísticas disponíveis na literatura foram utilizados o Harmony Search (HS), o Adaptive Large Neighborhood Search (ALNS) e o Clustering Search (CS) utilizando o HS e o ALNS como heurísticas geradoras de soluções. Cada uma das quatro implementações foram testadas em 320 instâncias propostas na literatura divididas em quatro famílias. Os experimentos computacionais mostraram bons resultados... (Resumo completo, clicar acesso eletrônico abaixo)
Abstract: The International Labour Organization estimates that there are approximately 650 million disabled people in working age. However, this population presents high rates of unemployment due to numerous barriers. An alternative to facilitate the inclusion of these people is the establishment of Centers for Working People with Disabilities where people with disabilities have the opportunity to experience a real work environment before going to a "normal" job. In this type of environment, where it is impossible to predict which workers will be available each day due to high rates of absence in this population, there is a need to define a more productive organization on a daily basis. In this context it becomes appropriate to use the Assembly Line Worker Assignment and Balancing Problem (ALWABP), which seeks to minimize the cycle time for a given number of workers, assigning tasks to workstations and workers to stations, considering that some workers may be too slow to perform certain tasks, or even unable due to some deficiency they present, and very efficient in performing others. The aim of this dissertation is to employ different meta-heuristics to solve the ALWABP, comparing with the best results of instances found in the literature. Among several meta-heuristics available in the literature were used Harmony Search (HS), Adaptive Large Neighborhood Search (ALNS) and Clustering Search (CS) using the HS and ALNS as heuristics for the generation of solutions. Each of the four implementations has been tested in 320 instances proposed in the literature, classified into four families. The computational experiments showed good results, and in some instances obtaining better solution values best known. Conclusions regarding... (Complete abstract click electronic access below)
Mestre
6
Méllo, Fábio Gavião Avelino de [UNESP]. « Método heurístico para criação de linhas de trabalho em problemas de escalonamento de pessoal ». Universidade Estadual Paulista (UNESP), 2014. http://hdl.handle.net/11449/106401.
Texte intégralRésumé :
Made available in DSpace on 2014-06-11T19:35:40Z (GMT). No. of bitstreams: 0
Previous issue date: 2014-02-28Bitstream added on 2014-06-13T20:07:10Z : No. of bitstreams: 1
000757731.pdf: 2807037 bytes, checksum: 5aa196a9569db15583f96a6a1fbce2c8 (MD5)A presente pesquisa trata do desenvolvimento de um método de solução do problema de construção de linhas de trabalho para a área de escalonamento de pessoal. Foram investigados diversos artigos da área de programação de pessoal com o objetivo de escolher precisamente o tema da pesquisa. Este tema escolhido foi o da construção de linhas de trabalho para empresas de ônibus interurbanos no Brasil. De posse do tema escolhido, foram analisados os métodos usados para formular e resolver o problema. Como resultado foi decidido o uso de uma formulação de cobertura de conjuntos não unicusto para representar o problema em estudo e o uso de um método heurístico para resolver o mesmo. Esta heurística divide a solução do problema em duas fases. A primeira é a fase construtiva, em que o espaço de solução é montado e linhas de trabalho são investigadas e aquelas viáveis são agrupadas formando um conjunto de linhas viáveis e qualificadas. A segunda é a fase de otimização ou de busca local em que um algoritmo evolutivo, baseado em algoritmo genético, irá procurar a melhor solução dentro desse subconjunto de linhas viáveis e qualificadas obtidas na primeira fase. Estes dois procedimentos se repetem até que um critério de parada seja atingido. Testes computacionais foram realizados no sentido de demonstrar a eficácia e eficiência do método proposto. Em seguida, o problema da programação de dias de expediente e de folga, neste trabalho denominado problema de padrões de folga, é formulado e resolvido. Algumas propostas para integrar a solução do problema de criação de linhas de trabalho à do problema de padrões de folga são apresentadas e discutidas
This thesis deals with the development of a method for solving the problem of construction of lines of work for the application area of personnel scheduling. Several articles were analyzed in order to matching precisely the subject of the research. An in-depth review of the processes used for formulating and solving such a kind of problem in the literature was conducted. As a result, it was decided to formulating the problem as a non unicost set covering problem and to use a heuristic method to solve it. The proposed heuristic is a twofold algorithm. The first is the construction phase, in which the solution space is scanned and working lines are investigated and those feasible are grouped together forming a set of feasible and qualified lines. The second phase is the optimization or local search in which an evolutionary algorithm based on genetic algorithm will search for the best solution within this set of feasible and qualified lines obtained in the first phase. These two phases are repeated until a stop criterion is reached. Computational tests were performed to demonstrate the effectiveness and efficiency of the proposed method. Then, the tour scheduling problem is addressed in the context of finding shifts of work-days and days-off scheduling. Its resolved by deterministic techniques. Some methods are then discussed on how to integrating both of the solutions of the lines of work and the tour scheduling problems
7
Méllo, Fábio Gavião Avelino de. « Método heurístico para criação de linhas de trabalho em problemas de escalonamento de pessoal / ». Guaratinguetá, 2014. http://hdl.handle.net/11449/106401.
Texte intégralRésumé :
Orientador: Edson Luiz França SenneBanca: Galeno José de Sena
Banca: José Roberto Dale Luche
Banca: Anibal Tavares de Azevedo
Banca: Kelly Cristina Poldi
Resumo : A presente pesquisa trata do desenvolvimento de um método de solução do problema de construção de linhas de trabalho para a área de escalonamento de pessoal. Foram investigados diversos artigos da área de programação de pessoal com o objetivo de escolher precisamente o tema da pesquisa. Este tema escolhido foi o da construção de linhas de trabalho para empresas de ônibus interurbanos no Brasil. De posse do tema escolhido, foram analisados os métodos usados para formular e resolver o problema. Como resultado foi decidido o uso de uma formulação de cobertura de conjuntos não unicusto para representar o problema em estudo e o uso de um método heurístico para resolver o mesmo. Esta heurística divide a solução do problema em duas fases. A primeira é a fase construtiva, em que o espaço de solução é montado e linhas de trabalho são investigadas e aquelas viáveis são agrupadas formando um conjunto de linhas viáveis e qualificadas. A segunda é a fase de otimização ou de busca local em que um algoritmo evolutivo, baseado em algoritmo genético, irá procurar a melhor solução dentro desse subconjunto de linhas viáveis e qualificadas obtidas na primeira fase. Estes dois procedimentos se repetem até que um critério de parada seja atingido. Testes computacionais foram realizados no sentido de demonstrar a eficácia e eficiência do método proposto. Em seguida, o problema da programação de dias de expediente e de folga, neste trabalho denominado problema de padrões de folga, é formulado e resolvido. Algumas propostas para integrar a solução do problema de criação de linhas de trabalho à do problema de padrões de folga são apresentadas e discutidas
Abstract: This thesis deals with the development of a method for solving the problem of construction of lines of work for the application area of personnel scheduling. Several articles were analyzed in order to matching precisely the subject of the research. An in-depth review of the processes used for formulating and solving such a kind of problem in the literature was conducted. As a result, it was decided to formulating the problem as a non unicost set covering problem and to use a heuristic method to solve it. The proposed heuristic is a twofold algorithm. The first is the construction phase, in which the solution space is scanned and working lines are investigated and those feasible are grouped together forming a set of feasible and qualified lines. The second phase is the optimization or local search in which an evolutionary algorithm based on genetic algorithm will search for the best solution within this set of feasible and qualified lines obtained in the first phase. These two phases are repeated until a stop criterion is reached. Computational tests were performed to demonstrate the effectiveness and efficiency of the proposed method. Then, the tour scheduling problem is addressed in the context of finding shifts of work-days and days-off scheduling. Its resolved by deterministic techniques. Some methods are then discussed on how to integrating both of the solutions of the lines of work and the tour scheduling problems
Doutor
8
Aliano, Filho Angelo [UNESP]. « Metaheurísticas em um problema de rotação de culturas ». Universidade Estadual Paulista (UNESP), 2012. http://hdl.handle.net/11449/95055.
Texte intégralRésumé :
Made available in DSpace on 2014-06-11T19:27:25Z (GMT). No. of bitstreams: 0
Previous issue date: 2012-03-06Bitstream added on 2014-06-13T19:35:31Z : No. of bitstreams: 1
alianofilho_a_me_botib.pdf: 803708 bytes, checksum: 7df8e5e731e86aee69b812455f899135 (MD5)Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Um dos focos centrais na produção vegetal, discutidos ultimamente, e a utilização de medidas que visam um planejamento sustentável e ecológico, tendo em vista a degradação ambiental ocorrida nos ultimos anos. Por este motivo, a Rotação de Culturas tem ganhado destaque na literatura, pois e um meio de produção cujos princípios práticos viabilizam uma agricultura ecológica e produtiva. Esta prática, uma vez bem conduzida pelos agricultores rurais, traz inúmeros benefícios, visto que o controle de pragas, patógenos e de plantas daninhas e realizado biologicamente, diminuindo a ação de pesticidas prejudiciais ao meio ambiente e medidas de recuperação do solo, tornando-o sempre fértil. Nesta dissertação, e apresentado um modelo de otimização 0-1 para o problema de Rotação de Culturas, cujo objetivo foi encontrar uma programação de plantio de hortaliças que maximize o lucro da produção, levando-se em consideração restrições de epoca de semeadura para cada cultura considerada, o não cultivo de plantas de mesma família em lotes vizinhos, proibição de plantio consecutivo de plantas de mesma família botânica em um mesmo lote, a necessidade de adubação verde, período de descanso do solo e de demanda. Nesta modelagem, foi considerada uma area de plantio genérica, cujos lotes são irregularmente distribuídos e de diferentes tamanhos. Para resolução do problema, foram desenvolvidas e implementadas a seguintes metaheurísticas: (a) Algoritmo Gen etico, (b) Simulated Annealing, e as abordagens mistas (c) Algoritmo Gen etico com Simulated Annealing e (d) Algoritmo Genético com Busca Local (Memético). Para avaliar os comportamentos computacionais das heurísticas, considerou-se instâncias de diferentes formas com variações nas geometrias e area de plantio. Adicionalmente, uma aplicação destes métodos para um...
The environmental degradation that has occurred throughout the world claims for sustainable and ecological plant production. In this context, agricultural planning based on crop rotation has been addressed in many studies. Once appropriately applied by farmers, this practice brings many bene ts. In fact, it enables biological control of pests, pathogens and weeds, thus reducing the action of pesticides which are harmful to the environment. Planting according to crop rotation also restores the soil, making it always fertile. This thesis presents a binary linear optimization model to the problem of crop rotation aiming to nd a planting schedule for vegetables that maximizes the pro ts of production. The problem constraints include a speci c period for planting each crop, a prede ned demand per crop, the need for green manure and rest period. Other restraints prevent planting of vegetables of the same family consecutively in the same lot, as well as in neighboring lots. A general planting area with irregularly distributed and di erent sized lots is considered. Four metaheuristics were speci cally developed for the above crop rotation problem and the respective algorithms were implemented: (a) a Genetic Algorithm, (b) a Simulated Annealing, and two hybrid approaches - (c) a Genetic Algorithm with Simulated Annealing and (d) a Genetic Algorithm with Local Search, that is, a Memetic algorithm. To evaluate the computing behavior of these algorithms, we considered a crop rotation instance from literature and also an instance built with real data from a Brazilian agricultural company. The computational results showed that the algorithms, specially the hybrid... (Complete abstract click electronic access below)
9
Aliano, Filho Angelo. « Metaheurísticas em um problema de rotação de culturas / ». Botucatu, 2012. http://hdl.handle.net/11449/95055.
Texte intégralRésumé :
Orientador: Helenice de Oliveira Florentino SilvaCoorientador: Margarida Vaz Pato
Banca: Fernando Luiz Pio dos Santos
Banca: Silvio Alexandre Araújo
Resumo: Um dos focos centrais na produção vegetal, discutidos ultimamente, e a utilização de medidas que visam um planejamento sustentável e ecológico, tendo em vista a degradação ambiental ocorrida nos ultimos anos. Por este motivo, a Rotação de Culturas tem ganhado destaque na literatura, pois e um meio de produção cujos princípios práticos viabilizam uma agricultura ecológica e produtiva. Esta prática, uma vez bem conduzida pelos agricultores rurais, traz inúmeros benefícios, visto que o controle de pragas, patógenos e de plantas daninhas e realizado biologicamente, diminuindo a ação de pesticidas prejudiciais ao meio ambiente e medidas de recuperação do solo, tornando-o sempre fértil. Nesta dissertação, e apresentado um modelo de otimização 0-1 para o problema de Rotação de Culturas, cujo objetivo foi encontrar uma programação de plantio de hortaliças que maximize o lucro da produção, levando-se em consideração restrições de epoca de semeadura para cada cultura considerada, o não cultivo de plantas de mesma família em lotes vizinhos, proibição de plantio consecutivo de plantas de mesma família botânica em um mesmo lote, a necessidade de adubação verde, período de descanso do solo e de demanda. Nesta modelagem, foi considerada uma area de plantio genérica, cujos lotes são irregularmente distribuídos e de diferentes tamanhos. Para resolução do problema, foram desenvolvidas e implementadas a seguintes metaheurísticas: (a) Algoritmo Gen etico, (b) Simulated Annealing, e as abordagens mistas (c) Algoritmo Gen etico com Simulated Annealing e (d) Algoritmo Genético com Busca Local (Memético). Para avaliar os comportamentos computacionais das heurísticas, considerou-se instâncias de diferentes formas com variações nas geometrias e area de plantio. Adicionalmente, uma aplicação destes métodos para um... (Resumo completo, clicar acesso eletrônico abaixo)
Abstract: The environmental degradation that has occurred throughout the world claims for sustainable and ecological plant production. In this context, agricultural planning based on crop rotation has been addressed in many studies. Once appropriately applied by farmers, this practice brings many bene ts. In fact, it enables biological control of pests, pathogens and weeds, thus reducing the action of pesticides which are harmful to the environment. Planting according to crop rotation also restores the soil, making it always fertile. This thesis presents a binary linear optimization model to the problem of crop rotation aiming to nd a planting schedule for vegetables that maximizes the pro ts of production. The problem constraints include a speci c period for planting each crop, a prede ned demand per crop, the need for green manure and rest period. Other restraints prevent planting of vegetables of the same family consecutively in the same lot, as well as in neighboring lots. A general planting area with irregularly distributed and di erent sized lots is considered. Four metaheuristics were speci cally developed for the above crop rotation problem and the respective algorithms were implemented: (a) a Genetic Algorithm, (b) a Simulated Annealing, and two hybrid approaches - (c) a Genetic Algorithm with Simulated Annealing and (d) a Genetic Algorithm with Local Search, that is, a Memetic algorithm. To evaluate the computing behavior of these algorithms, we considered a crop rotation instance from literature and also an instance built with real data from a Brazilian agricultural company. The computational results showed that the algorithms, specially the hybrid... (Complete abstract click electronic access below)
Mestre
10
Hong, Libin. « Hyper-heuristic approaches to automatically designing heuristics as mutation operators for evolutionary programming on function classes ». Thesis, University of Nottingham, 2018. http://eprints.nottingham.ac.uk/52348/.
Texte intégralRésumé :
A hyper-heuristic is a search method or learning mechanism for selecting or generating heuristics to solve computational search problems. Researchers classify hyper-heuristics according to the source of feedback during learning: Online learning hyper-heuristics learn while solving a given instance of a problem; Offline learning hyper-heuristics learn from a set of training instances, a method that can generalise to unseen instances. Genetic programming (GP) can be considered a specialization of the more widely known genetic algorithms (GAs) where each individual is a computer program. GP automatically generates computer programs to solve specified tasks. It is a method of searching a space of computer programs. GP can be used as a kind of hyper-heuristic to be a learning algorithm when it uses some feedback from the search process. Our research mainly uses genetic programming as offline hyper-heuristic approach to automatically design various heuristics for evolutionary programming.
11
Bergmark, Max. « Tetris : A Heuristic Study : Using height-based weighing functions and breadth-first search heuristics for playing Tetris ». Thesis, KTH, Skolan för teknikvetenskap (SCI), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-168306.
Texte intégralRésumé :
This paper studies the performance of height-based weighing functions and compares the results to using the commonly used non height-based weighing functions for holes. For every test performed, the heuristic methods studied in this paper performed better than the commonly used heuristic function. This study also analyses the effect of adding levels of prediction to the heuristic algorithm, which increases the average number of cleared lines by a factor of 85 in total. Utilising these methods can provide increased performance for a Tetris AI. The polynomic weighing functions discussed in this paper provide a performance increase without increasing the needed computation, increasing the number of cleared lines by a factor of 3. The breadth-first search provide a bigger performance increase, but every new level of prediction requires 162 times more computation. Every level increases the number of cleared lines by a factor of 9 from what has been observed in this study.
12
Johnsson, Pontus. « Riskbedömning och beslutsfattande vid bränder : En utvärdering av verkliga scenarion utifrån ett heuristiskt perspektiv ». Thesis, Linköping University, Department of Computer and Information Science, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-57152.
Texte intégralRésumé :
I syfte att förbättra kunskapsläget kring människors beteenden vid bränder och utrymningar studerades fyra brandsituationer hämtade från ett flertal verkliga händelser ur ett beslutsfattande- och riskbedömningsperspektiv. Det teoretiska underlaget hämtades ur Kahnemans och Tverskys forskning kring heuristiker (Kahneman och Tversky, 1974; Kahneman, Slovic & Tversky, 1982; Gilovich, Griffin & Kahneman, 2002). För ändamålet användes tre heuristiska regler: tillgänglighet, representativitet och affekt. Dessa tre heuristiker möjliggör ögonblickssnabba riskbedömningar genom att allt utom en särskild variabel bortses från i beslutsprocessen. När människor blir stressade tenderar de att förlita sig mer på heuristiker i sina bedömningar. Analysen visar att det är rimligt att anta att de beteenden som observerats i samband med bränder i de fyra fallen beror på beslut huvudsakligen fattade med hjälp av någon av de tre heuristikerna. Denna kunskap kan öppna upp nya möjligheter för att förebygga dödsfall på grund av felaktiga beteenden i samband med bränder och utrymningar.
13
Ramstedt, Hampus, et Palo Jari Thorup. « Heuristiker för Sociala Spel : En studie om design och utvärdering av sociala digitala spel ». Thesis, Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-17928.
Texte intégralRésumé :
Sociala digitala spel har ökat i popularitet sedan genren etablerades år 2007. Sociala spel är en vardag för många människor och återfinns på- eller runtomkring sociala nätverk, exempelvis Facebook. För att skapa kvalitativa sociala spel kan tydliga direktiv användas för hur design och utvärdering ska genomföras. En brist uppmärksammades av denna typ av direktiv i form av färdigutvecklade heuristiker för att designa och utvärdera sociala spel. För att undersöka hur sociala spel kan designas och utvärderas användes initiala heuristiker som kompletterades via en litteraturstudie. Dessa kompletterade heuristiker undersöktes sedan kvalitativt med hjälp av spelutvecklare och spelare. Denna studie resulterade i utvecklade heuristiker för design och utvärdering av sociala spel med spelbarhet och sociabilitet i fokus.Nyckelord: sociala spel, heuristiker, sociabilitet, spelbarhetSocial digital games have grown in popularity since the genre was established in 2007. Social games are an everyday reality for many people and can be found on- or around social networks such as Facebook. In order to create as qualitative social games as possible, clear directives can be used to know how these games should be designed and evaluated. This study highlights a lack of this type of directives in the form of fully developed heuristics for designing and evaluating social games. To examine how social games can be designed and evaluated initial heuristics were used and then supplemented by a literature review. These complementary heuristics were then examined qualitatively with help of game developers and players. This study resulted in developed heuristics for design and evaluation of social games with playability and sociability in focus.Keywords: social games, heuristics, sociability, playability
14
Škopek, Michal. « Problém obchodního cestujícího a metoda GENIUS ». Master's thesis, Vysoká škola ekonomická v Praze, 2009. http://www.nusl.cz/ntk/nusl-76829.
Texte intégralRésumé :
The target of this thesis is to explain the Travelling Salesman Problem and also create a special program, which will be able to make calculations using the heuristics GENIUS. The Travelling Salesman Problem will be described from two different points of view. The first one is the historical description of the idea of the Travelling Salesman Problem and later will be the problem will be described with some of the very wide number of the calculation methods. For the explanation of the methods, in the thesis there has been chosen some of the algorithms which belong to that methods. The heuristics and also the exact algorithms will be explained. The focus of this thesis is on the heuristics called GENIUS and also in the creation of the program which can calculate it. The program works first with the GENI algorithm and after that it works with US post-optimization algorithm. The program will be described from the point of view of the user and the manual will be written as well. The program will be tested on two different examples and will be compared with the exact algorithm.
15
Johansson, Vikström Emma. « Heuristic Evaluation of Network Management Systems - Using Axis Communications’ Network Management System Music in Creation of Usability Heuristics ». Thesis, Malmö universitet, Fakulteten för teknik och samhälle (TS), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-20555.
Texte intégralRésumé :
Hantering av nätverk är en utmaning för dagens företag.Nätverkshanteringssystem är ofta komplexa och felbenägna, vilket gör demtröttsamma och svåra att arbeta med för nätverksansvariga. Tidigare forskningvisar att dessa system oftast inte är särskilt användbara, med den förmodadeanledningen att mer fokus läggs på funktionalitet än användbarhet då säkerhetär en så viktig del av nätverkshantering. Dock kommer ett system som inte byggsefter användbarhets- och user experience-kriterier att generera fel även omfunktionaliteten är korrekt byggd. Tidigare forskning visar också att det finns enavsaknad av effektiva användbarhetstester specifikt för nätverkshantering.I den här studien skapas ett set heuristiker (riktlinjer för användbarhet),skräddarsytt för nätverkshantering. Dessa heuristiker kan sedan användas ianvändbarhetstester för nätverkshanteringssystem. Studien är genomförd isamarbete med Axis Communications AB. Deras nätverkshanteringssystem”Music” används som en hjälp för att hitta och validera lämpliga heuristiker, ochheuristikerna används också för att testa Musics användbarhet. En systematisklitteraturstudie och användarintervjuer på Axis används för att upptäcka viktigaaspekter inom nätverkshantering. Setet med heuristiker skapas sedan genomatt sätta upp ett start-set med klassiska heuristiker och modifiera dessa utifrånde tidigare upptäckta viktiga aspekterna. Heuristikerna valideras sedan genomatt använda dem i användbarhetstester av Music. Valideringen visar att de nyaheuristikerna är mer effektiva vad gäller att hitta problem i ettnätverkshanteringssystem än ett klassiskt set av användbarhets-heuristiker(Nielsens heuristiker). Utöver setet med heuristiker resulterar studien också irekommendationer på förbättringar av Musics användbarhet, mock-ups med ettnytt designförslag för Musics GUI och generella rekommendationer för företagmed nätverkshanteringssystem.Network management is a challenge for today’s enterprises. Networkmanagement systems are usually complex and error prone, making themtedious and difficult to work with for network managers. Related work show thatthese systems are often not very usable, the reason probably being that morefocus is put on functionality rather than usability since security is a veryimportant aspect of network management. However, a system not builtaccording to usability and user experience guidelines will generate errors eventhough the functionality is correctly built. Related work also show that there isa lack of efficient usability testing methods specifically for network management.In this study, a set of heuristics (usability guidelines), tailor-made for networkmanagement, is being created. These heuristics can then be used in usabilitytesting of network management systems. The study is conducted incollaboration with Axis Communications AB. Their network management system“Music” is used as a help in finding and validating appropriate heuristics, andthe heuristics are also used for testing the usability of Music. A systematicliterature review and user interviews at Axis are used to learn important aspectsof network management systems. The heuristic set is then created by setting upa starting set of classical heuristics and modifying it according to previouslyfound network management aspects. These heuristics are then validated byusing them in usability tests of Music. The validation proves the new set ofheuristics to be more effective in finding issues for a network managementsystem than a classical set of usability heuristics (namely Nielsen’s heuristics).Besides the set of heuristics, the study also results in recommendations ofimprovements on the usability of Music, mock-ups proposing a new design forMusic’s GUI and general recommendations for enterprises with networkmanagement systems.
16
Munisamy, Kolandai Ammu Prabha. « A Method for Evaluating the Persuasive Potential of Software Programs ». Thesis, Linköpings universitet, Interaktiva och kognitiva system, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-98002.
Texte intégralRésumé :
Today, web, Internet, mobile and other ambient technologies engage in persuasive interaction with people. The technology designed to reinforce and change user’s attitude or behaviors or both through persuasion and social influence are persuasive technologies. Recently, persuasive systems and services are becoming increasingly abundant and ubiquitous. Evaluation of these systems is a challenging endeavor and typically requires a simple and efficient method. Nielsen suggests heuristic evaluation as a method for intuitive, inexpensive and easy evaluation of a user interface design. The purpose of this thesis is to examine heuristic evaluation as a method to evaluate the persuasive potential of software programs. The Heuristics used were operationalized version of Fogg’s persuasive design principles. Software programs MS Word, MS PowerPoint, Counter-Strike, The Sims, Stone and Plan Eat Smile were chosen with the goal of measuring their ability to change behavior or attitude of users. The Evaluation was performed on the software programs using three evaluators and the test results indicated that they possess significant persuasive potential. It was concluded that the set of heuristics which were developed can be used to perform summative heuristic evaluation and the method used was helpful in evaluating the persuasive potential of software programs.
17
Rýdlová, Lenka. « Randomizovaná heuristika pro úlohu listonoše s kapacitami ». Master's thesis, Vysoká škola ekonomická v Praze, 2014. http://www.nusl.cz/ntk/nusl-193550.
Texte intégralRésumé :
Graph theory is a large mathematical discipline. Chinese postman problem falls under category of arc vehicle routing problems. Chinese postman problems are very extensive and difficult to calculate in practice. They belong to NP-hard problems. For this reason, heuristics are proposed to provide acceptably good solution in polynomial time. The focus of this thesis is to propose a randomized heuristic which does not follow deterministic rules but is ruled by random. Monte Carlo simulation is launched to find the best solution. Heuristic is formulated for undirected capacitated rural postman problem. It is programmed in VBA and validated on testing problems. At the end of the thesis is a case study about municipal garbage collection.
18
Barbosa, Eduardo Batista de Moraes. « Uma heurística para otimização de meta-heurísticas por meio de métodos estatísticos / ». Guaratinguetá, 2016. http://hdl.handle.net/11449/141911.
Texte intégralRésumé :
Orientador: Edson Luiz França SenneCoorientador: Messias Borges Silva
Banca: Marcos Antonio Pereira
Banca: Fernando Augusto Silva Marins
Banca: Antonio Augusto Chaves
Banca: Fabrício Maciel Gomes
Resumo: A configuração de parâmetros de algoritmos, em especial, das meta-heurísticas, nem sempre é trivial e, frequentemente, é realizada ad hoc de acordo com o problema sob análise. A fim de resolver o problema de sintonização de meta-heurísticas, a presente pesquisa propõe uma metodologia que combina o uso de técnicas estatísticas robustas (ex.: Planejamento de Experimentos) e métodos eficientes de Inteligência Artificial (ex.: Algoritmos de Corrida). A ideia central desta metodologia é um método heurístico, denominado Algoritmo de Corrida Orientada por Heurística (HORA), capaz de explorar o espaço de busca para perseguir diferentes alternativas na vizinhança de uma configuração de parâmetros promissora e encontrar sistematicamente boas configurações candidatas para diferentes algoritmos. Em síntese, o método HORA concentra as buscas sobre configurações candidatas promissoras, criadas dinamicamente em um processo iterativo, e utiliza uma técnica estatística robusta para avaliar as diferentes alternativas e descartar aquelas de qualidade inferior, assim que reunir evidências estatísticas suficientes contra elas. A partir dos resultados de diversos estudos computacionais, em que diferentes meta-heurísticas foram aplicadas sobre dois problemas clássicos de otimização combinatória, apresentam-se evidências estatísticas que as sintonizações obtidas pelo HORA são competitivas em relação ao método de Corrida e seu tempo no processo de sintonização é amplamente vantajoso. Em um estudo com... (Resumo completo, clicar acesso eletrônico abaixo)
Abstract: The fine-tuning of the algorithms parameters, specially, of the meta-heuristics, it is not always trivial and often is performed by ad hoc methods according to the problem under analysis. In order to solve the problem of tuning metaheuristics, this research proposes a methodology combining statistical robust techniques (e.g.: Design of Experiments) and efficient methods from Artificial Intelligence (e.g.: Racing Algorithms). The key idea of this methodology is a heuristic method, called Heuristic Oriented Racing Algorithm (HORA), which explores the search space looking for alternatives near of a promising candidate and consistently finds good candidates configuration for different algorithms. Briefly, HORA focuses its searches over the promising candidates configuration, dynamically created in an iterative process, and employs a robust statistical method to evaluate and discarding them, as soon as gather enough statistical evidence against them. The results of several studies, where different metaheuristics were applied to solve two classical combinatorial optimization problems, present statistical evidences that the settings obtained by HORA are competitive to the Racing Algorithms and its time in the fine-tuning process is widely advantageous. In a complementary study, an already well setting algorithm from the literature was tuned by means of the proposed methodology and the new settings were compared with the literature. The results show that the fine-tuning from HORA can... (Complete abstract click electronic access below)
Doutor
19
Daňková, Tereza. « Racionalita versus iracionalita v manažerském rozhodování ». Master's thesis, Vysoká škola ekonomická v Praze, 2013. http://www.nusl.cz/ntk/nusl-193768.
Texte intégralRésumé :
The thesis focuses on rationality in decisions by managers. The terms rationality, irrationality and bounded rationality are defined in the first part. The current state of knowledge on the concept of bounded rationality in decision making is then followed by a specific consideration of managerial decision making. The chosen bounded rationality effects, including heuristics, are also described. The purpose of the second part of this study is to examine experimentally the differential uses of heuristics among the students of the Faculty of Management relative to completion of the Managerial Decision Making course. The effect of time to use of heuristics is examined as well.
20
[UNESP], Silva Marcelo Andrade da. « Critérios compostos para delineamentos ótimos robustos ». Universidade Estadual Paulista (UNESP), 2014. http://hdl.handle.net/11449/110368.
Texte intégralRésumé :
Made available in DSpace on 2014-11-10T11:09:40Z (GMT). No. of bitstreams: 0
Previous issue date: 2014-02-18Bitstream added on 2014-11-10T11:58:48Z : No. of bitstreams: 1
000784115.pdf: 429663 bytes, checksum: da7e91933ccbc6fd035c544a77ff2715 (MD5)Neste trabalho propomos a incorporação de uma propriedade relacionada a robustez de delineamentos frente a perda de observações em experimentos fatoriais, a qual denominamos critério H, na expressão de um critério composto. Para a otimização, implementamos duas versões modificadas do algoritmo de troca de Fedorov (1972), que é um método heurístico para encontrar delineamentos ótimos ou quase ótimos exatos. Apresentamos quatro exemplos para examinar a performance de delineamentos construídos com o novo critério composto, os exemplos 1, 3 e 4 visam o modelo de segunda ordem completo e o exemplo 2 visa o modelo de segunda ordem sem os efeitos quadráticos. Nos exemplos 1 e 3, para preservar bom desempenho em outras propriedades, a eficiência H não foi alta. Os resultados obtidos no exemplo 2 mostraram grande contribuição do uso da propriedade H no critério composto, produzindo delineamentos com alta eficiência nos demais quesitos. Em geral, o novo critério composto produziu delineamentos mais atrativos que os DP-ótimos de Gilmour & Trinca (2012), com valores de leverages mais homogêneos, e portanto mais robustos à perda de observações. Produziu também delineamentos com melhores propriedades do que os delineamentos construídos por subconjuntos em Ahmad & Gilmour (2010)
In this work we propose the use of a robustness measure to missing data to construct designs for factorial experiments. The robustness property is denoted the H criterion and it is added to a compound design criterion expression. Two versions of the modified exchange algorithm of Fedorov (1972) were implemented computationally for the search of exact optimum designs. Four examples are presented, examples 1, 3 and 4 consider the full second-order model and example 2 considers second-order model excluding the quadratic effects. The examples 1 and 3, in order to preserve good efficiency with respect to other properties, their H efficiency is not high. The results for example 2 showed good performance of the new compound criterion since it produced designs high by efficient for all other properties. In general, the new compound criterion produced more attractive designs than the DP criterion of Gilmour & Trinca (2012) since their leverages were more homogeneous and thus, the designs were more robust to missing data. The designs were also more attractive than those constructed by subsets as in Ahmad & Gilmour (2010)
21
Silva, Marcelo Andrade da. « Critérios compostos para delineamentos ótimos robustos / ». Botucatu, 2014. http://hdl.handle.net/11449/110368.
Texte intégralRésumé :
Orientador: Luzia Aparecida TrincaBanca: Silvio Sandoval Zocchi
Banca: Miriam Harumi Tsunemi
Resumo: Neste trabalho propomos a incorporação de uma propriedade relacionada a robustez de delineamentos frente a perda de observações em experimentos fatoriais, a qual denominamos critério H, na expressão de um critério composto. Para a otimização, implementamos duas versões modificadas do algoritmo de troca de Fedorov (1972), que é um método heurístico para encontrar delineamentos ótimos ou quase ótimos exatos. Apresentamos quatro exemplos para examinar a performance de delineamentos construídos com o novo critério composto, os exemplos 1, 3 e 4 visam o modelo de segunda ordem completo e o exemplo 2 visa o modelo de segunda ordem sem os efeitos quadráticos. Nos exemplos 1 e 3, para preservar bom desempenho em outras propriedades, a eficiência H não foi alta. Os resultados obtidos no exemplo 2 mostraram grande contribuição do uso da propriedade H no critério composto, produzindo delineamentos com alta eficiência nos demais quesitos. Em geral, o novo critério composto produziu delineamentos mais atrativos que os DP-ótimos de Gilmour & Trinca (2012), com valores de leverages mais homogêneos, e portanto mais robustos à perda de observações. Produziu também delineamentos com melhores propriedades do que os delineamentos construídos por subconjuntos em Ahmad & Gilmour (2010)
Abstract: In this work we propose the use of a robustness measure to missing data to construct designs for factorial experiments. The robustness property is denoted the H criterion and it is added to a compound design criterion expression. Two versions of the modified exchange algorithm of Fedorov (1972) were implemented computationally for the search of exact optimum designs. Four examples are presented, examples 1, 3 and 4 consider the full second-order model and example 2 considers second-order model excluding the quadratic effects. The examples 1 and 3, in order to preserve good efficiency with respect to other properties, their H efficiency is not high. The results for example 2 showed good performance of the new compound criterion since it produced designs high by efficient for all other properties. In general, the new compound criterion produced more attractive designs than the DP criterion of Gilmour & Trinca (2012) since their leverages were more homogeneous and thus, the designs were more robust to missing data. The designs were also more attractive than those constructed by subsets as in Ahmad & Gilmour (2010)
Mestre
22
Altmanová, Lenka. « Procesorová výroba v rámci logistickeho řetězce firmy ». Master's thesis, Vysoká škola ekonomická v Praze, 2008. http://www.nusl.cz/ntk/nusl-10532.
Texte intégralRésumé :
The paper describes how logistic influence process in the firm, also there is a comparation with other firms in automobile section. And second part describes a case study of job scheduling in a mechanical-engineering production, the goal is to minimise the overall processing time. The production jobs are processed by machines. This problem is treated as a hybrid five-stage flow-shop. In other words, the job-processing job consists of maximum five tasks, it depends on product, because there is 12 products, each has own production flow. It is a new type of flow-shop in which the first-stage scheduling depends upon the time scheduling of the second stage, and so on. A mathematical model and a heuristic method is formulated, The problem is the NP hardness. The case study is solved with the heuristic method and the solution achieved represents a 10% reduction of the processing time for the given set of jobs.
23
Särnbrink, Henrik, et Klas Johansson. « Användbarhetsutvärdering av en grafiskt visualiserad patientjournal ». Thesis, Linköping University, Department of Science and Technology, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-12331.
Texte intégralRésumé :
First-year students at Linköping University have developed a prototype that graphically visualizes a medical record in a new way. The customer of that project was the Department of Biomedical Engineering at Linköping University. They now want a usability evaluation to be performed of the prototype. The prototype is to be used by employees in the public health care and is supposed to be used on a small portable unit with a multi-touch interface. For this reason the prototype will be used as a complement to existing systems when the users work near the patients. Since the prototype is still in the design phase it is important that the continuing development is carried out in close collaboration with the users.
The purpose of this thesis was to point out which usability problems the prototype violates and which needs it must satisfy. The purpose was also to examine how the users interact with an iPod touch and what they consider of using an iPod touch. Usability is created when human interacts with a product to achieve specified goals, where the product is easy to learn, effective to use, easy to remember, has few errors and is satisfactory to use. By early and continuously involving the users in its development a product is able to reach a high level of usability. In this thesis a number of well known usability methods were used, e.g. interviews, heuristic evaluation and thinking aloud protocol. All these methods are described thoroughly in this report among with a review of how they were implemented. Finally, these methods are being discussed together with the obtained results.
During the interviews with the users a number of usability problems in the prototype were discovered together with the users’ needs which it must satisfy. It was also discovered that most of the users thought positive of working with an iPod touch. In the continuing development of the prototype these usability problems should be fixed in order to satisfy the users’ needs.
Förstaårsstudenter vid Linköpings Universitet har utvecklat en prototyp som på ett nytt sätt visualiserar en patientjournal grafiskt. Beställare av projektet var Institutionen för medicinsk teknik vid Linköpings Universitet som nu vill att en användbarhetsutvärdering genomförs av prototypen. Prototypen riktar sig till anställda inom sjukvården och ska användas på en liten handhållen enhet med pekskärm. Av denna anledning ska den vara ett komplement till befintliga system när användarna arbetar nära patienterna. Då den ännu befinner sig tidigt i utvecklingsstadiet är det nödvändigt att fortsatt utveckling sker i nära kontakt med användarna.
Detta examensarbete syftade till att peka på vilka användbarhetsprinciper prototypen bryter mot, vilka behov den måste tillgodose, att undersöka hur användarna interagerar med en Ipod touch och vad de anser om att arbeta med en sådan enhet. Användbarhet uppstår när människan interagerar med en produkt för att lösa givna uppgifter, där produkten är lätt att lära, effektiv att använda, har få fel, är subjektivt tilltalande och där det är lätt att komma ihåg hur den används. Genom att tidigt och kontinuerligt involvera användarna i utvecklingsarbetet uppnås god användbarhet. I detta arbete tillämpades ett flertal kända användbarhetsmetoder, bl.a. intervjuer, heuristisk utvärdering och tänka högt. Alla metoder finns beskrivna teoretiskt i rapporten tillsammans med en redogörelse för hur de tillämpades. Slutligen följer en diskussion kring dem och det resultat som erhölls.
Under intervjuerna med användarna framkom flera användbarhetsproblem i prototypen samt de behov den måste tillgodose. Arbetet kom även fram till att användarna över lag ställer sig positiva till att arbeta med en Ipod touch. I den fortsatta vidareutvecklingen av prototypen bör dessa användbarhetsproblem åtgärdas för att prototypen ska tillgodose användarnas behov.
24
Schulz, Stephan. « Leaning search control knowlledge for equational deduction / ». Berlin : AKA, 2000. http://www.loc.gov/catdir/toc/fy0804/2007440965.html.
Texte intégral
25
Ohlsson, Patrik. « Computer Assisted Music Creation : A recollection of my work and thoughts on heuristic algorithms, aesthetics, and technology ». Thesis, Kungl. Musikhögskolan, Institutionen för komposition, dirigering och musikteori, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kmh:diva-2090.
Texte intégralRésumé :
Denna text är delvis en dokumentation av min egna resa inom datorbaserat tonsättande, specifikt inom algoritmisk komposition. Det är även ett utforskande av den tankevärld som finns i anknytning till dessa metoder – där estetiska koncept och konsekvenser diskuteras. Texten kommer huvudsakligen att beröra metoder som gynnas av eller möjliggörs av teknologi. Jag har försökt att närma mig dessa ämnen holistiskt genom att diskutera allt från estetik, teknik, till konkreta realiseringar av särskilda musikaliska idéer. Till detta tillkommer även många notexempel, lite kod, och illustrationer – specifikt för att stödja förklaringarna av, för många musikstudenter, främmande utommusikaliska koncept.
26
Håkansson, Robin, et Christina Tsigara. « Att skapa en uppsättning användbarhetsheuristiker som är lämpliga vid heuristisk utvärdering av matbeställningsapplikationer för smartphones ». Thesis, Malmö universitet, Fakulteten för teknik och samhälle (TS), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-20875.
Texte intégralRésumé :
I takt med att smartphones blir allt vanligare växer marknaden för mobilapplikationer, av vilka en kategori är matbeställningsapplikationer. En ny rapport visar att så många som en av fyra konsumenter har minst en matbeställningsapplikation installerad på sin smartphone. Nielsens tio generella användbarhetsheuristiker som skapades på 1990-talet används fortfarande av utvecklare av olika typer av applikationer, men då de inte alltid täcker de specifika användbarhetsproblem som uppkommer inom olika domäner skapas det fortlöpande domänspecifika heuristiker. Det saknas dock domänspecifika heuristiker för matbeställningsapplikationer, trots att det finns behov av sådana i och med att beställning av mat via applikationer för smartphones växer i omfattning. Heuristiker för denna domän bör utvecklas för att möjliggöra heuristiska utvärderingar och förbättra användbarheten för matbeställningsapplikationer.Syftet med detta arbete var därför att undersöka användbarhetsheuristiker och skapa en uppsättning heuristiker som är lämpliga för heuristisk utvärdering av matbeställningsapplikationer för smartphones.Genom litteraturstudier undersöktes och sammanställdes befintliga användbarhetsheuristiker för den mobila domänen och en uppsättning heuristiker för mobilapplikationer skapades. Olika matbeställningsapplikationer analyserades för att identifiera element som var lämpliga ur ett användbarhetsperspektiv. Tillsammans med den skapade uppsättningen heuristiker för mobilapplikationer lade dessa sedan grunden för skapandet av en domänspecifik uppsättning heuristiker för matbeställningsapplikationer. Dessa validerades sedan genom inhämtande av expertutlåtanden och heuristisk utvärdering via enkätundersökningar.Den skapade uppsättningen heuristiker för matbeställningsapplikationer kan vidareutvecklas i framtida studier eller användas för att utföra heuristiska utvärderingar i samband med utveckling av matbeställningsapplikationer i syfte att förbättra deras användbarhet.As smartphones become increasingly common, the market for smartphone applications is growing, and one subset of this is food-ordering applications. A new report shows that as many as four out of ten consumers have installed at least one food-ordering application on their smartphone. The ten heuristics for user-interface design created by Nielsen in the 1990s are still used by the developers of various applications; due to their general scope, however, they are sometimes insufficient for solving specific usability problems, which is the reason domain-specific heuristics are constantly being created for different types of application. Despite the increasing use of food-ordering applications and the ensuing need for domain-specific heuristics, no such exist. Heuristics should be developed for this domain in order to enable heuristic evaluation and improve the usability of food-ordering applications.The aim of this research work is to investigate existing usability heuristics and create a set of heuristics that are suitable for use during heuristic evaluation of food-ordering applications for smartphones.Existing usability heuristics for the mobile domain, as described in the literature, were studied and compiled to form a set of heuristics for smartphone applications. Several existing food-ordering applications were analysed in order to identify elements that were beneficial to from a usability perspective. The identified elements, together with the compiled set of heuristics for smartphone applications, were then used as the basis for the creation of a domain-specific set of heuristics for food-ordering applications, which was subsequently validated by experts and heuristic evaluation performed using a questionnaire.The set of heuristics for food-ordering applications can be developed in future research or used in heuristic evaluations during development of such applications in order to improve their usability.
27
Bartásková, Petra. « Metoda tvorby tras přepravní úlohy ». Master's thesis, Vysoká škola ekonomická v Praze, 2010. http://www.nusl.cz/ntk/nusl-75633.
Texte intégralRésumé :
This thesis is focused on optimizing the routes which are implemented in our country at night. Goods are transporting between designated central cities. It deals with creating cyclic routs, along which the goods should be effectively transported, with the respect of the cost. The instruction how to create these paths represents a heuristic method for generating cyclic paths. The algorithm uses the results provided by model that is based on a search for multiple product chart. The chart contains the minimum number of vehicles that provide transport and individual amount of transported goods. The principle of this heuristic method is to create cyclic paths in such a way to be able to serve all transportation requirements with the lowest number of reloads. This approach leads to the fact that the direct paths are preferred.
28
Mischel, Magnus. « Heuristisk detektering av trojaner ». Thesis, Linköping University, Department of Electrical Engineering, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-2826.
Texte intégralRésumé :
The heuristic methods used by the anti-trojan application TrojanHunter have been evaluated. The evaluation shows that the heuristic scan engine of TrojanHunter has a very good detection ratio and that the detection ratio can be even further improved by implementing the suggested improvements, the most important of which is a white list to avoid misidentifying files that are known not to be trojans.
29
Hanek, Petr. « Implementace problému směrování vozidel pomocí algoritmu mravenčích kolonií a částicových rojů ». Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2019. http://www.nusl.cz/ntk/nusl-400931.
Texte intégralRésumé :
This diploma thesis focuses on meta-heuristic algorithms and their ability to solve difficult optimization problems in polynomial time. The thesis describes different kinds of meta-heuristic algorithms such as genetic algorithm, particle swarm optimization or ant colony optimization. The implemented application was written in Java and contains ant colony optimization for capacitated vehicle routing problem and particle swarm optimization which finds the best possible parameters for ant colonies.
30
Nowak, Maciek A. « The Pickup and Delivery Problem with Split Loads ». Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/7223.
Texte intégralRésumé :
This dissertation focuses on improvements in vehicle routing that can be gained by allowing multiple vehicles to service a common load. We explore how costs can be reduced through the elimination of the constraint that a load must be serviced by only one vehicle. Specifically, we look at the problem of routing vehicles to service loads that have distinct origins and destinations, with no constraint on the amount of a load that a vehicle may service. We call this the Pickup and Delivery Problem with Split Loads (PDPSL). We model this problem as a dynamic program and introduce structural results that can help practitioners implement the use of split loads, including the definition of an upper bound on the benefit of split loads. This bound indicates that the routing cost can be reduced by at most one half when split loads are allowed. Furthermore, the most benefit occurs when load sizes are just above one half of vehicle capacity.
We develop a heuristic for the solution of large scale problems, and apply this heuristic to randomly generated data sets. Various load sizes are tested, with the experimental results supporting the finding that most benefit with split loads occurs for load sizes just above one half vehicle capacity. Also, the average benefit of split loads is found to range from 6 to 7% for most data sets. The heuristic was also tested on a real world example from the trucking industry. These tests reveal the benefit of both using split loads and allowing fleet sharing. The benefit for split loads is not as significant as with the random data, and the various business rules added for this case are tested to find those that have the most impact. It is found that an additional cost for every stop the vehicle makes strictly limits the potential for benefit from split loads. Finally, we present a simplified version of the PDPSL in which all origins are visited prior to any destination on a route, generalizing structural results from the Split Delivery Vehicle Routing Problem for this problem.
31
Atala, Ali Veggi [UNESP]. « Programação de horários usando um algoritmo genético especializado ». Universidade Estadual Paulista (UNESP), 2014. http://hdl.handle.net/11449/111140.
Texte intégralRésumé :
Made available in DSpace on 2014-12-02T11:16:57Z (GMT). No. of bitstreams: 0
Previous issue date: 2014-02-27Bitstream added on 2014-12-02T11:20:50Z : No. of bitstreams: 1
000797336.pdf: 8867207 bytes, checksum: ee77fd35abfa82d47da021f7f3043be1 (MD5)O problema de programação ótima de horários consiste em programar eventos aulas em um determinado número de salas, para um determinado número de alunos, com o objetivo de satisfazer certas condições de factibilidade. O problema é representado por um modelo de programação linear inteira mista e foi resolvido pela implementação de um algoritmo genético de Chu-Beasley, que apresenta as características de evitar a homogeinização da população, permitindo encontrar melhores soluções, modificado em três pontos fundamentais: (i) na geraçao da população inicial; (ii) na fase de melhoría local; (iii) no incremento da da diversidade. Adicionalmente, é apresentado um algoritmo construtivo na fase da geração da população inicial e na busca local, a fin de se permiter corrigir possíveis infactibilidades e melhorar a qualidade da população, tanto na fase inicial quanto na de melhoria local. O controle da diversidade e atualização da população são feitos obedecendo parâmetro que garante que o novo individuo tenha número de genes diferentes em relação aos demais individuos da população, evitando a homogeinização da mesma. O método proposto é aplicado no caso de testes da literatura especializada, e os dados do problema são os apresentados pela International Timebling Competition
The problem with optimum schedule programming consists of programming class-events for a given number of classrooms and students, with the goal of satisfying certain factibility conditions. The problem is represented by a full mixed linear programming model and has been solved by use of a genetic Chu-Beasley algorithm, that presents population homogenization avoidance features, allowing for best solutions, modified in three core points: (i) initial population generation; (ii) local improvement phase; (iii) diversity increase. Additionally, a constructive algorithm for the initial phase of initial population generation and local search is presented, this allows for correction of possible unsuitabilities and improves population quality, such in initial phase as in local improvements. Population diversity and updating control is done according to parameters that assure each new individual has a different genes number in relation to the other individuals of the population, avoiding homogenization. The proposed method is applied for test cases of specialized literature, and data for the tests are presented by International Timebling Competition
32
Atala, Ali Veggi. « Programação de horários usando um algoritmo genético especializado / ». Ilha Solteira, 2014. http://hdl.handle.net/11449/111140.
Texte intégralRésumé :
Orientador: Rubén Augusto Romero LázaroBanca: José Roberto Sanches Mantovani
Banca: Sergio Azevedo de Oliveira
Banca: Carlos Alberto Mendonça da Rocha
Banca: Elizete de Andredade Amorim
Resumo: O problema de programação ótima de horários consiste em programar eventos aulas em um determinado número de salas, para um determinado número de alunos, com o objetivo de satisfazer certas condições de factibilidade. O problema é representado por um modelo de programação linear inteira mista e foi resolvido pela implementação de um algoritmo genético de Chu-Beasley, que apresenta as características de evitar a homogeinização da população, permitindo encontrar melhores soluções, modificado em três pontos fundamentais: (i) na geraçao da população inicial; (ii) na fase de melhoría local; (iii) no incremento da da diversidade. Adicionalmente, é apresentado um algoritmo construtivo na fase da geração da população inicial e na busca local, a fin de se permiter corrigir possíveis infactibilidades e melhorar a qualidade da população, tanto na fase inicial quanto na de melhoria local. O controle da diversidade e atualização da população são feitos obedecendo parâmetro que garante que o novo individuo tenha número de genes diferentes em relação aos demais individuos da população, evitando a homogeinização da mesma. O método proposto é aplicado no caso de testes da literatura especializada, e os dados do problema são os apresentados pela International Timebling Competition
Abstract: The problem with optimum schedule programming consists of programming class-events for a given number of classrooms and students, with the goal of satisfying certain factibility conditions. The problem is represented by a full mixed linear programming model and has been solved by use of a genetic Chu-Beasley algorithm, that presents population homogenization avoidance features, allowing for best solutions, modified in three core points: (i) initial population generation; (ii) local improvement phase; (iii) diversity increase. Additionally, a constructive algorithm for the initial phase of initial population generation and local search is presented, this allows for correction of possible unsuitabilities and improves population quality, such in initial phase as in local improvements. Population diversity and updating control is done according to parameters that assure each new individual has a different genes number in relation to the other individuals of the population, avoiding homogenization. The proposed method is applied for test cases of specialized literature, and data for the tests are presented by International Timebling Competition
Doutor
33
Kim, Dong-Gook. « An Analysis of Ecological and Social Rationality : When are Lexicographic Heuristics Preferred ? » unrestricted, 2008. http://etd.gsu.edu/theses/available/etd-08182008-212550/.
Texte intégralRésumé :
Thesis (Ph. D.)--Georgia State University, 2008.Title from file title page. Thomas Whalen, committee chair; Julian Diaz III, C. S. Thachenkary, Rodney Schultz, committee members. Electronic text (168 p. : ill. (some col.)) : digital, PDF file. Description based on contents viewed November 3, 2008. Includes bibliographical references (p. 164-168).
34
Ackerholm, Nils. « Att stödja utan att styra eller störa : Användbarhetsstudie av personlig anpassning på webbsidor ». Thesis, Linköping University, Department of Computer and Information Science, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-2682.
Texte intégralRésumé :
Ett överflöd av information gör att den information vi verkligen vill ha blir svårare att hitta. För att råda bot på detta har det gjorts försök att hjälpa användaren att hitta genom personlig anpassning av webbsidor. Meningen är att personlig anpassning ska göra det enkelt för användaren, och att systemet därmed har hög användbarhet. Att se om det verkligen är så är syftet med denna studie.
Inom ett projekt som avser ge familjer med tonåriga diabetiker IT-stöd gjordes en heuristisk utvärdering och intervjuer för att undersöka ett antal funktioner för personlig anpassning ur användbarhetsperspektiv.
På det hela taget går det inte att säga att personlig anpassning vare sig är bra eller dåligt användbarhetsmässigt utan det avgörs av funktionernas utformning och kontexten. Det viktiga är att ge användaren stöd i sitt användande utan att för den skull styra eller störa hennes användning.
35
Hinze, Richard. « Makespan Minimization in Re-entrant Permutation Flow Shops ». Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2018. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-234685.
Texte intégralRésumé :
Re-entrant permutation flow shop problems occur in practical applications such as wafer manufacturing, paint shops, mold and die processes and textile industry. A re-entrant material flow means that the production jobs need to visit at least one working station multiple times. A comprehensive review gives an overview of the literature on re-entrant scheduling. The influence of missing operations received just little attention so far and splitting the jobs into sublots was not examined in re-entrant permutation flow shops before. The computational complexity of makespan minimization in re-entrant permutation flow shop problems requires heuristic solution approaches for large problem sizes. The problem provides promising structural properties for the application of a variable neighborhood search because of the repeated processing of jobs on several machines. Furthermore the different characteristics of lot streaming and their impact on the makespan of a schedule are examined in this thesis and the heuristic solution methods are adjusted to manage the problem’s extension.
36
Svensson, Philip. « Designing bus route networks with algorithms ». Thesis, KTH, Optimeringslära och systemteori, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-276961.
Texte intégralRésumé :
The aim of this thesis is to make use of real world travel time and demand data and implement an algorithm which designs bus networks. Consideration is taken to both passenger and bus operator interests. Thereafter answering the questions: How well does the algorithm perform when applied to Södertälje, Sweden? Can the proposed method assist in the network design stage of real bus network planning? Heuristics and the multiobjective genetic algorithm NSGA-II (Non-dominated Sorting Genetic Algorithm II) were chosen. Three different problem cases were set up. It was found that the high computation time poses a great obstacle, over 80 hours for a network of 58 stations and 18 routes. Even then a longer run time would have led to improved results. When comparing a smaller problem, 24 stations and four routes, to the real bus routes it is based on, a superior solution was found based on the model. It is however not possible to argue for the proposed network being superior to the existing one if replaced in reality due to the fact a subsystem is modelled. It is believed that the proposed algorithm may be of assistance to traffic planners in the way of suggesting single links or routes, not replacing the complete bus network design process.Målet med denna studie är att använda verklig resedata och efterfrågan och implementera en algoritm som designar busslinjenät med avseende på passagerar -och operatörsintressen. Därefter svara på frågorna: Hur bra presterar algoritmen när den tillämpas på Södertälje, Sverige? Kan den föreslagna algoritmen bidra i designfasen av ett verkligt busslinjenät? Heuristik och den multiobjektiva genetiska algoritmen NSGA-II (Non-dominated Sorting Genetic Algorithm II) användes. Tre olika problem ställdes upp. Det framkom att den långa beräkningstiden är ett stort hinder, över 80 timmar för ett busslinjenät med 58 stationer och 18 busslinjer. Den begränsande faktorn var den långa körtiden, bättre lösningar hade kunnat hittas om programmet fått fortsätta köra. Endast ett mindre nätverk, 24 stationer med fyra busslinjer, baserades på verkliga busslinjer och kunde jämföras. Det resulterade i lösningar som var bättre än de verkliga busslinjerna inom ramen för modellen. Det kan dock inte betraktas som bättre än det verkliga nätverket i mån av att ersätta det, då endast ett subsystem modellerades. Det anses att den föreslagna algoritmen kan vara av assistans för trafikplanerare genom att föreslå länkar mellan busstationer eller hela busslinjer, däremot inte ersätta den nuvarande processen av att designa bussnätverk.
37
Zahid, Taiba. « A dynamic heuristics approach for proactive production scheduling under robustness targets ». Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2017. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-224647.
Texte intégralRésumé :
In den vergangenen Jahrzehnten konzentrierte sich das Operations Management auf Optimierungsstrategien, insbesondere wurden Meta-Heuristiken für das komplexe, kombinatorische Problem der ressourcenbegrenzten Ablaufplanung erforscht. In einfachen Worten gehört dieses Problem zu den NP-schweren Problemen, die einen derart großen Lösungsraum besitzen, der mittels Enumerationverfahren rechnerisch unlösbar ist. Daher erfordert die Exploration von optimalen Lösungen andere Methoden als Zufallssuchverfahren. Solche Suchalgorithmen in Meta-Heuristik starten mit einer oder mehreren Ausgangslösung und erkunden den Suchraum nach optimalen Lösungen. Jedoch stellen die existierenden Forschungsansätze zur Lösungssuche nur diejenigen Lösungen bereit, die ausschließlich unter den gegebenen Eingangsbedingungen optimal sind. Diese Eingabebedingungen definieren einen Lösungsraum, in dem alles nach Plan geht. Jedoch ist das in der Praxis sicherlich nicht der Fall. Wie wir sagen, der Wandel ist die einzige Konstante in dieser Welt. Risiken und Unsicherheiten begegnen stets im täglichen Leben. Die vorliegende Dissertation untersucht Optimierungsansätze unter Unsicherheit. Der Forschungsbeitrag ist zweigeteilt. Wie bereits gesagt, wurden Optimierungsstrategien zum Durchsuchen des Lösungsraums in den letzten Jahren stark erforscht. Obwohl es eine anerkannte Tatsache ist, dass die Verbesserung und die Leistung von Optimierungsstrategien stark mit den Initiallösungen korreliert, scheint die Literatur diesbezüglich inexistent, während zumeist auf die Entwicklung von meta-heuristischen Algorithmen wie Genetische Algorithmen und Particle-Swarm-Optimierung fokussiert wird. Die Initiallösungen werden durch simulationsbasierte Strategien entwickelt, die typischerweise gierige Regeln und ereignisbasierte Simulation nutzen. Allerdings verhalten sich kommerzielle Basis-Softwareprodukte meist als Black-Box und stellen keine Informationen über das interne Verhalten bereit. Außerdem erfordern derartige Softwareprodukte meist spezielle Architekturen und missachten Ressourcenbeschränkungen. Die vorliegende Studie diskutiert die ressourcenbeschränkte Projektplanung mit alternativen Modi und schlägt ein simulationsbasiertes Rahmenwerk vor, mit dem ein heuristisches Multi-Pass-Verfahren zur Verfügung gestellt wird. Das erweiterte Multi-Modus-Problem ist in der Lage, den Produktionsbereich in einer besseren Art und Weise nachzubilden, bei dem eine Aktivität von mehreren Ressourcen unterschiedlicher Qualifikation ausgeführt werden kann. Der vorgeschlagene Rahmen diskutiert die Leistung von Algorithmen und verwendet hierfür Benchmark-Instanzen. Das Verhalten verschiedener Projektnetze und deren Eigenschaften werden auch innerhalb des vorgeschlagenen Rahmenwerks bewertet. Darüber hinaus hilft das offene Rahmenwerk, besondere Eigenschaften von Aktivitäten zu analysieren, um deren Verhalten im Fall von Störungen zu prognostizieren. Die traditionellen Methoden der Risikoanalyse schlagen Slack-basierte Maßzahlen vor, um die Effizienz von Basisplänen zu bestimmen. Das Rahmenwerk wird weiter entwickelt, um mit diesem einen Prüfstand zu gestalten, mit dem nicht-reguläre Maßzahlen bestimmt werden können. Diese Maßnahmen werden als Robustheitsindikatoren bezeichnet und korrelieren mit der Verzögerung derartiger Multi-Modus-Probleme. Solche Leistungsmaße können genutzt werden, um die Wirksamkeit von Basisplänen zu bewerten und ihr Verhalten unter Unsicherheiten zu prognostizieren. Die Ergebnisse dieser Tests werden als modifizierte Zielfunktion verwendet, in der ein bi-objektives Leistungsmaß aus Durchlaufzeit und Robustheit eingesetzt wird, um die Effizienz der vorgeschlagenen Heuristiken zu testen. Da diese Leistungsmaße das Verhalten von Aktivitäten unter Störungen zeigen, werden diese auch genutzt, um die Formfaktoren und Puffergrößen für die Entwicklung eines stochastischen Modells zu bestimmen. Die Analyse der Projektergebnisse, durchgeführt mittels Monte-Carlo-Simulationen, unterstützt das Argument von Teilpuffern für die Modellierung von Aktivitätsdauern anstatt Ansätze mit Extrempuffern und PERT-beta-SchätzungenOver the past decades, researches in the field of operations management have focused on optimization strategies based on meta-heuristics for the complex-combinatorial problem of resource constrained scheduling. In simple terms, the solution for this particular problem categorized as NP-hard problem, exhibits a large search space, is computationally intractable, and requires techniques other than random search. Meta-heuristic algorithms start with a single or multiple solutions to explore and optimize using deterministic data and retrieve a valid optimum only under specified input conditions. These input conditions define a solution search space for a theoretical world undergoing no disturbance. But change is inherent to the real world; one is faced with risks and uncertainties in everyday life. The present study explores solution methodologies in the face of uncertainties. The contributions of this thesis are two-fold. As mentioned earlier, existing optimization strategies have been vigorously investigated in the past decade with respect to exploring large solution search space. Although, it is an established fact that the improvement and performance of optimization strategies is highly correlated with the initial solutions, existing literature regarding this area is not exhaustive and mostly focuses on the development of meta-heuristic algorithms such as genetic algorithms and particle swarm optimization. The initial solutions are developed through simulation based strategies mainly based on greedy rules and event based simulation. However, the available commercial softwares are primarily modeled as a black box and provide little information as to internal processing. Additionally, such planners require special architecture and disregard resource constraints. The present study discusses the multi-mode resource constrained scheduling problem and proposes a simulation-based framework to provide a multi-pass heuristic method. The extended version of multi-mode problem is able to imitate production floor in an improved manner where a task can be performed with multiple resources with certain qualifications. The performance of the proposed framework was analyzed using benchmark instances. The behavior of different project networks and their characteristics is also evaluated within the proposed framework. In addition, the open framework aids in determining the particular characteristic of tasks in order to analyze and forecast their behavior in case of disruptions. The traditional risk analysis techniques suggest slack-based measures in order to determine the efficiency of baseline schedules. The framework is further developed to design a test bench in order to determine non-regular performance measures named as robustness indicators which correlate with the delay of such cases as multi-mode problem. Such performance measures can be used to indicate the effectiveness of baseline schedules and forecast their behavior. The outputs of these tests are used to modify the objective function which uses makespan and robustness indicators as a bi-objective performance measure in order to test the efficiency of proposed heuristics. Furthermore, since these measures indicate the behavior of tasks under disruptions, they are utilized in order to determine the shape factors and buffers for the development of a stochastic model. The analysis of project outcomes performed through Monte-Carlo simulations supports the argument of partial buffer sizing for modeling activity duration estimates rather than extreme buffer approaches proposed via PERT-beta estimates
38
Burdová, Jana. « Heuristické a metaheuristické metody řešení úlohy obchodního cestujícího ». Master's thesis, Vysoká škola ekonomická v Praze, 2010. http://www.nusl.cz/ntk/nusl-75095.
Texte intégralRésumé :
Minimal length of a travelling salesman's problem had been studied in this diploma these. Travelling salesman must come trough each place just once and then go back to the starting place. This problem can be illustrated as a problem of graph theory, such that places are the vertices, roads are the edges, distances of roads are the lengths of edges. The optimal travelling salesman's problem tour is the shortest Hamiltionian cycle in the graph. It is a classical NP-complete problem. There is no algorithm that solves this problem in polynomial time. This problem can be solved by using various approximation algorithms, they offer less time consumption and lowest quality than optimization. This diploma these had been dedicated to approximation algorithms, for example: nearest neighbor method, minimal spanning tree method, Christofide's method, 2-opt., genetic algorithm, etc.
39
Gondeková, Tatiana. « Optimalizácia investičných rozhodnutí v medzinárodnom prostredí ». Master's thesis, Vysoká škola ekonomická v Praze, 2009. http://www.nusl.cz/ntk/nusl-76701.
Texte intégralRésumé :
In this thesis, a portfolio optimization with integer variables which influence optimal assets allocation in domestic as well as in international environment, is studied. At the beginning with basic terms, assets and portfolio background, incentives of portfolio creation, fields of portfolio application and portfolio management is dealt. Following the characteristics of assets and portfolios (expected return, risk, liquidity), which are used by investors to value their properties, are introduced. Next the mean-risk models are derived for the measures of risk - variance, Value at Risk, Conditional Value at Risk and prepared for a practical application. Heuristics implemented in Matlab and standard algorithms of software GAMS are used for solving problems of the portfolio optimization. At the end optimization methods are applied on real financial data and an outputs are compared.
40
Künzelová, Barbora. « Rozvozní problém s heterogenními vozidly ». Master's thesis, Vysoká škola ekonomická v Praze, 2014. http://www.nusl.cz/ntk/nusl-193549.
Texte intégralRésumé :
The master's thesis deals with the new modification of vehicle routing problem -- 3PL vehicle routing problem with heterogeneous fleet and split delivery. In addition to classical vehicle routing problem, we consider a heterogeneous suppliers fleet and also external carrier, which charges a fixed value per unit of transported goods. The reader is first introduces to vehicle routing problem, its history and possible solutions. Furthermore, the reader is acquainted with logistics and logistics providers. In the main part of this thesis is described 3PL vehicle routing problem and its mathematical model. At first we try to get optimal solution via CPLEX solver. But since this is an NP-hard task, heuristic method is proposed (in two variants) for solving this problem. The heuristic is then tested on the selected test tasks. Results obtained using the proposed heuristics are compared with the optimal solution. Even larger problems are then solved using this heuristics. In the end other modifications and possible improvements of this heuristic method are proposed.
41
Franc, Zdeněk. « Kapacitní problém listonoše ». Master's thesis, Vysoká škola ekonomická v Praze, 2014. http://www.nusl.cz/ntk/nusl-193813.
Texte intégralRésumé :
The Capacitated Arc Routing Problem has many applications in real life. The aim of this problem is to minimize the total cost at fulfilment of the requirements of arcs. The Capacitated Arc Routing Problem is an extension of the Chinese Postman Problem, which is a special type of the Vehicle Routing Problems. In this thesis is explained the issue of the Chinese Postman Problem and its extensions at first. Subsequently the applications of mathematical models are illustrated on a model example. However these mathematical models, which are searching the optimal solution, do not use so much in reality. Therefore the randomized heuristic algorithm for solving these problems is suggested and programmed in this thesis. Subsequently this heuristic was applied to case study of garbage collection in Podebrady city.
42
Anagrius, Jimmy. « Kontextstyrd heuristik : användbarhetsutvärdering av Alfresco ». Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-169577.
Texte intégralRésumé :
Syftet med detta examensarbete att undersöka om systemsuiten Alfresco uppfyller krav på användbarhet för dokumenthantering och samarbete i interaktiva miljöer. Vidare är syftet att analysera om heuristisk utvärdering en lämplig utvärderingsmetod för konsultbolag att använda sig av vid utvärdering av olika systemalternativ för dokumenthantering då kund och målgrupp är okänd. Detta undersöktes genom en heuristisk utvärdering baserad på tre olika ramverk lämpade för utvärdering av användbarhet, samarbete och dokumenthantering i interaktiva miljöer. Utvärderingen utfördes på två av Alfrescos applikationer; Alfresco Explorer och Alfresco Share. Resultatet visar att det finns en del brister i Alfresco kopplade till användbarhet, dokumenthantering samt samarbete. 15 av 62 heuristiker bedömdes som ej uppfyllda och 27 av 62 som delvis uppfyllda men inget av dessa beror på allvarliga problem. Utvärderingsmetoden som användes har en hel del brister som gör att resultatet måste ifrågasättas och inte ses som definitivt. Även det faktum att utvärderingen endast utförts av en person gör att resultatens reliabilitet minskar. Vad som är viktigt att poängtera är att utvärderingen har påvisat användbarhetsbrister i gränssnitten samt avsaknad av funktioner som påverkar möjligheten för god kollaboration. Bristerna är dock inte så allvarliga vilket gör att bedömningen är att Alfresco uppfyller grundläggande krav för dokumenthantering och samarbete.
43
Ambrogi, Timothy. « Heuristic counterpoint ». Diss., Connect to the thesis, 2004. http://hdl.handle.net/10066/1484.
Texte intégral
44
Tjärnberg, Wilmer. « Heuristisk Utvärdering av Virtual Reality-Spel ». Thesis, Högskolan i Skövde, Institutionen för informationsteknologi, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-17719.
Texte intégralRésumé :
Detta arbete undersöker hur User Experience Design-utvärderingsmetoden heuristisk utvärdering kunde anpassas till utvärderingen av TV-spel inom kontexten av immersive Virtual Reality. Rapporten börjar med att redogöra för TV-spel, Virtual Reality och User Experience som fält, med särskild fokus på utvärderingsmetoder. En genomgång av tidigare, relevant litteratur och utförandet av heuristiska utvärderingar ledde till skapandet av en lista med heuristiker utformade för immersive Virtual Reality-spel. En manual med riktlinjer för utförandet av utvärderingar inom en Virtual Reality-kontext skapades också. Både heuristikerna och manualen validerades och reviderades utefter resultaten av de heuristiska utvärderingar som utfördes under arbetets gång. Resultaten visade på att heuristisk utvärdering går att använda inom en VR-spelskontext, men att det kräver vissa modifikationer. Detta har implikationer för användandet av andra utvärderingsmetoder i samma kontext.
45
Neufeld, Janis Sebastian. « Problem specific heuristics for group scheduling problems in cellular manufacturing ». Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2016. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-207063.
Texte intégralRésumé :
The group scheduling problem commonly arises in cellular manufacturing systems, where parts are grouped into part families. It is characterized by a sequencing task on two levels: on the one hand, a sequence of jobs within each part family has to be identified while, on the other hand, a family sequence has to be determined. In order to solve this NP-hard problem usually heuristic solution approaches are used. In this thesis different aspects of group scheduling are discussed and problem specific heuristics are developed to solve group scheduling problems efficiently. Thereby, particularly characteristic properties of flowshop group scheduling problems, such as the structure of a group schedule or missing operations, are identified and exploited. In a simulation study for job shop manufacturing cells several novel dispatching rules are analyzed. Furthermore, a comprehensive review of the existing group scheduling literature is presented, identifying fruitful directions for future research.
46
Murthy, Sapna Guniguntla. « Disaster recovery heuristic : a mapping heuristic for optimum retrieval / ». Online version of thesis, 2009. http://hdl.handle.net/1850/10733.
Texte intégral
47
Bieneck, Steffen. « Soziale Informationsverarbeitung in der juristischen Urteilsfindung : experimentelle Untersuchungen zur Ankerheuristik ». Phd thesis, Universität Potsdam, 2006. http://opus.kobv.de/ubp/volltexte/2006/784/.
Texte intégralRésumé :
Heuristiken der Urteilsbildung umfassen bottom-up bzw. schemagesteuerte Strategien innerhalb der sozialen Informationsverarbeitung, mit deren Hilfe trotz unsicherer Datenlage hinreichend genaue Urteile gefällt werden können. Die Anker- und Anpassungsheuristik als eine Form solcher Faustregeln beschreibt im Wesentlichen die Wirkung von vorgegebenen Zahlen (den so genannten Ankerwerten) auf numerische Schätzungen. Urteile unter Unsicherheit sind zum Beispiel im Bereich der Rechtsprechung zu beobachten, wobei die Entscheidungsprozesse hier eher normativ auf der Basis der vorliegenden Informationen, d.h. einer datengesteuerten Verarbeitung, erfolgen sollten.
In einer Serie von drei Experimenten wurde die Ankerheuristik auf den Bereich der Rechtsprechung übertragen. Mit Hilfe der Vignettentechnik wurden N = 229 Rechtsreferendare sowie N = 600 Studierende der Rechtswissenschaften zu ihrem Strafverhalten befragt. Im Mittelpunkt standen drei Zielsetzungen: (1) die Replikation und Erweiterung der Ankereffekts in Bezug auf eine größere Gruppe von Deliktarten; (2) die Analyse individueller Unterschiede in der Ankernutzung unter Berücksichtigung verschiedener Persönlichkeitsvariablen (Need for Cognition und Need for Cognitive Closure) sowie (3) die Anregung zu verstärkter systematischer Informationsverarbeitung durch die Indizierung einer Genauigkeitsmotivation.
Der Ankereffekt in der juristischen Urteilsfindung konnte für die verschiedenen Deliktgruppen repliziert werden. Die Ergebnisse zeigen, dass die wahrgenommene Schwere der geschilderten Taten mit dem Strafmaß korrelierte. Dieser Zusammenhang wurde durch die Einführung von Ankerwerten deutlich reduziert. Entgegen den bisherigen Untersuchungen war zwar auch bei den Rechtsreferendaren ein Ankereffekt zu beobachten, der jedoch geringer ausfiel als bei den Studierenden der Rechtswissenschaften. Im Hinblick auf die Persönlichkeitsmerkmale konnte die Erwartung bestätigt werden, dass ein geringes Kognitionsbedürfnis sowie ein hohes Geschlossenheitsbedürfnis mit höherer Anfälligkeit für die Ankerheuristik einhergehen. Die Erzeugung eines Rechtfertigungsdrucks dagegen veranlasste die Probanden, sich intensiver mit den Materialien zu beschäftigen und eher datengeleitet vorzugehen. Implikationen für die juristische Praxis werden diskutiert.
Decisions are usually based on beliefs about the likelihood that an uncertain event will occur (i.e., the results of an election or the liability of the accused). In estimating the likelihood of those events people often revert to heuristics as a theory-driven processing strategy in order to reduce the effort of the decision-making process. On the one hand heuristics might be quite helpful in controlling information processing; on the other hand they can lead to systematic biases in judgments. Anchoring and adjustment describe a judgmental heuristic, where individuals gauge numerical size by starting from an initial arbitrary or irrelevant value (an anchor) and adjusting it during the subsequent course of judgment to arrive at their final judgment. However, the adjustment of the judgment typically remains insufficient, thus leading to judgments that are biased in the direction of the starting value.
The concept of judgmental heuristics can be applied to legal decision making. Legal decision-making is normatively defined as data-driven, which means that judgements about the culpability of a defendant need to be corroborated by evidence specific to the case at hand. Individuals involved in this process are required to assess the evidence without being affected by personal feelings and beliefs or by extraneous evidence.
A series of three experiments tested the impact of anchoring and adjustment on legal decision making. Using the vignette technique, N = 229 junior barristers and N = 600 law students evaluated scenarios describing criminal offences. Apart from replicating the anchoring effect in different samples, the studies explored the impact of individual differences in personality variables (need for cognition and cognitive closure) on the anchoring effect. Further, a strategy to promote data-driven processing by inducing an accuracy motivation was evaluated.
The results clearly indicate an anchoring effect in legal decision-making. The results showed a strong correlation between the perceived severity of the cases and the recommended sentence. This correlation was significantly reduced when an anchor was introduced. In contrast to previous studies, junior barristers showed a less extreme bias in their judgments compared to law students. In terms of individual differences regarding the readiness to engage in elaborate information processing the results showed a higher susceptibility for the anchoring information when need for cognition was low and need for cognitive closure was high. Introducing an accuracy motivation prompted the participants to engage in more data-driven processing, thus reducing the anchoring effect. The implications for social cognition research and legal practice are discussed.
48
Monk, Monika Patrice. « Mobile Exergaming Heuristics ». Thesis, Virginia Tech, 2014. http://hdl.handle.net/10919/50581.
Texte intégralRésumé :
An alarming number of adolescents experience obesity and related health issues, in part because of a lack of exercise. Increased mobile technology availability can have negative effects on amount of exercise, but they can have positive effects as well. Leveraging mobile technology to encourage and motivate exercise has potential to decrease unhealthy lifestyles, especially among young people. Mobile exergaming is an emerging field that has the potential to motivate users to exercise while also having fun. However, much of the early development work on mobile exergames has been ad-hoc, with little guidance available for designers. This work seeks to identify heuristics catered for mobile exergaming. This thesis presents four mobile exergaming heuristics were identified based on recent literature and on the author's mobile exergame design and development efforts: 1) Motivational game concepts that promote physical activity; 2) Game cues that engage active users; 3) Physically and temporally appropriate game structure to encourage continual, recurring play; 4) Game play movements that are safe for the user and for the device. This thesis describes the development of the mobile exergame heuristics, along with the creation and distribution of an ExergameApp Suite comprised of three mobile exergames: Fish Out of Water, Color Hunt and Space Rayders.Master of Science
49
Na, Byungsoo. « Optimization of automated float glass lines ». Diss., Georgia Institute of Technology, 2010. http://hdl.handle.net/1853/39637.
Texte intégralRésumé :
Motivated by operational issues in real-world glass manufacturing, this thesis addresses a problem of laying out and sequencing the orders so as to minimize wasted glass, called scrap. This optimization problem combines aspects of traditional cutting problems and traditional scheduling and sequencing problems. In so far as we know, the combination of cutting and scheduling has not been modeled, or solved. We propose a two-phase approach: snap construction and constructing cutting and offload schedules. Regarding the second phase problem, we introduce FGSP (float glass scheduling problem), and provide its solution structure, called coveys. We analyze simple sub-models of FGSP considering the main elements: time, unit, and width. For each model, we provide either a polynomial time algorithm or a proof of NP-completeness. Since FGSP is NP-complete, we propose a heuristic algorithm, Longest Unit First (LUF), and analyze the worst case performance of the algorithm in terms of the quality of solutions; the worst case performance bound is {1+(m-1)/m}+{1/3-1/(3m)} where m is the number of machines. It is 5/3 when m=2. For the real-world problem, we propose two different methods for snap construction, and we apply two main approaches to solve cutting and offloading schedules: an MIP approach and a heuristic approach. Our solution approach produces manufacturing yields greater than 99%; current practice is about 95%. This is a significant improvement and these high-yield solutions can save millions of dollars.
50
Tazoniero, Alexandre. « Estrategias de decisão para o planejamento de circulação de trens em tempo real ». [s.n.], 2007. http://repositorio.unicamp.br/jspui/handle/REPOSIP/259052.
Texte intégralRésumé :
Orientador: Fernando Antonio Campos GomideDissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação
Made available in DSpace on 2018-08-10T00:48:57Z (GMT). No. of bitstreams: 1 Tazoniero_Alexandre_M.pdf: 2202986 bytes, checksum: eac2bab1d27c5baaf56ef296663e1cef (MD5) Previous issue date: 2007
Resumo: O transporte ferroviário tem grande participação no transporte de cargas e passageiros em todo o mundo. No Brasil a malha ferroviária sofreu um processo de abandono e deterioração no período de 1960 a 1990. A partir de 1990 a privatização da rede ferroviária nacional iniciou uma retomada de investimentos e nos últimos anos à demanda por transporte ferroviário vem crescendo significativamente. É necessário, então, que os recursos da ferrovia sejam utilizados de maneira eficiente para atender a crescente demanda, o que exige planejamento estratégico, táctico e operacional. No nível operacional uma das principais etapas e também umas das mais carentes de ferramentas computacionais é o Planejamento de Circulação de trens. O processo operacional de uma ferrovia é dinâmico, sujeito a inúmeras interferências imprevisíveis e uma ferramenta computacional para o apoio ao planejamento de circulação de trens deve fornecer soluções com tempo de processamento compatível com essa realidade. Este trabalho propõe algoritmos para o planejamento de circulação de trens em tempo real, utilizando metodologias de inteligência computacional e conjuntos nebulosos. Um algoritmo objetiva decidir localmente a preferência entre trens concorrendo pelo uso de um segmento de linha singela de modo a seguir uma referência de percurso fornecida por algum algoritmo de otimização ou por um especialista. Outro algoritmo decide, além da preferência entre trens, a velocidade de percurso dos trens para mantê-los o mais próximo possível de suas referências. O terceiro algoritmo usa elementos de busca em árvore para obter uma solução para o planejamento de circulação de trens. É feito um estudo comparativo dos algoritmos aqui propostos e de algoritmos existentes na literatura. O estudo comparativo é feito a pm1ir de instâncias pequenas de problema de planejamento de circulação e uma instância que considera dados reais de uma ferrovia brasileira. Os resultados mostram que os algoritmos propostos obtêm soluções próximas às ótimas para as instâncias pequenas e soluções satisfatórias para o caso real
Abstract: Railways plays a major role in freight and passenger transportation in the whole world. The Brazilian railway system has suffered a process of abandon and deterioration from 1960 to 1990. Since 1990 the privatization of the national railways brought new investments and in the last years the demand for railway transportation has increased significantly. Railway resources must be efficiently managed to match the increasingly transportation demand. This requires efficient strategic, tactical and operational planning. One of the main tasks at the operational planning level concerns train circulation and associated tools. Railway operation is a very dynamic process because trains are subject to many unexpected interferences. Computational tools to help trains circulation planning must provide solutions in a time range consistent with real-time needs. This work suggests algorithms for real-time train movement planning, using computational intelligence and fuzzy set theory methodology. One of the algorithms decides the preference between trains competing for a single line track at the same moment. The aim is to drive train circulation as dose as possible to reference trajectories supplied by human experts, global optimization algorithms or both. Other algorithm decides preference between trains and chose the velocity with which trains must travel to remain as dose as possible to its references. The third algorithm uses depth search algorithm to obtain a solution for train circulation problems. A comparative study considering the algorithms proposed herein and algorithms suggested in the literature. The comparative study is done using small railway system instances. Data of a major Brazilian railway is adopted to illustrate how the algorithms behave to solve larger instances. Results show that the algorithms here proposed obtain near optimal solutions for small instances and satisfactory solutions for the real case
Mestrado
Automação
Mestre em Engenharia Elétrica