Rozprawy doktorskie na temat „Heuristic programming”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Sprawdź 50 najlepszych rozpraw doktorskich naukowych na temat „Heuristic programming”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.
Ambrogi, Timothy. "Heuristic counterpoint". Diss., Connect to the thesis, 2004. http://hdl.handle.net/10066/1484.
Pełny tekst źródłaPerry, Kristine. "Heuristic weighted voting /". Diss., CLICK HERE for online access, 2007. http://contentdm.lib.byu.edu/ETD/image/etd2120.pdf.
Pełny tekst źródłaSilva, 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.
Pełny tekst źródłaCoordenaçã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)
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.
Pełny tekst źródłaBanca: 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
Burfoot, Daniel. "Limitations of and extensions to heuristic search planning". Thesis, McGill University, 2006. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=100779.
Pełny tekst źródłaIn the context of STRIPS, the primary focus is on the widely used relaxed plan heuristic (h+). A variety of cases are shown in which h+ provides systematically bad estimates of goal distance. To address this breakdown, a planning system called RRT-Plan is presented. This system is inspired by the concept of Rapidly-exploring Random Trees, which was originally developed for use in mobile robot path planning. Experimental results show that RRT-Plan is comparable to leading planners in terms of number of problems solved and plan quality. We conclude that the effectiveness of RRT-Plan is based on its ability to search the space of artificial goal orderings.
The second half of the work considers heuristic search planning in numeric domains. Two particularly significant obstacles are identified. The Curse of Affluence is due to the vast blowup in the search space caused by the addition of numeric variables. The Curse of Poverty relates to the difficulty of finding relevant lower bounds on resource consumption.
Exploration of the Curse of Affluence leads to the new concepts of reduced search and enhanced states. In reduced search, certain simple operators are not used to expand states. Instead, enhanced states are constructed which represent all possible states which could be achieved by suitably inserting simple operators in the plan. Enhanced states are represented by a set of constant discrete variables, and a convex hull of numeric values. This representation can be queried and updated in a natural way. Experimental results show that there are domains for which reduced search gives order of magnitude performance improvements over Metric-FF, a leading heuristic search planner for numeric domains.
Richards, Simon Kim. "Symbolic bidirectional breadth-first heuristic search". Master's thesis, Mississippi State : Mississippi State University, 2004. http://library.msstate.edu/etd/show.asp?etd=etd-08302004-085304.
Pełny tekst źródłaHyde, Matthew. "A genetic programming hyper-heuristic approach to automated packing". Thesis, University of Nottingham, 2010. http://eprints.nottingham.ac.uk/11625/.
Pełny tekst źródłaHong, 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/.
Pełny tekst źródłaTian, Zhong Huan. "Gender based meta-heuristic optimization algorithms". Thesis, University of Macau, 2017. http://umaclib3.umac.mo/record=b3691331.
Pełny tekst źródłaSariklis, Dimitrios. "Open Vehicle Routing Problem : description, formulations and heuristic methods". Thesis, London School of Economics and Political Science (University of London), 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.265252.
Pełny tekst źródłaBertsimas, Dimitris J., i Jose Nino-Mora. "Restless Bandits, Linear Programming Relaxations and a Primal-Dual Heuristic". Massachusetts Institute of Technology, Operations Research Center, 1994. http://hdl.handle.net/1721.1/5378.
Pełny tekst źródłaGarrett, C. "Functional diagnostic strategies for analogue systems using heuristic programming techniques". Thesis, University of Brighton, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.234718.
Pełny tekst źródłaSadones, Sylvie. "A new two-phase heuristic for two-dimensional rectangular bin-packing and strip-packing /". Thesis, McGill University, 1985. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=66036.
Pełny tekst źródłaHuegler, Peter A. "A comparison of Heuristic solution techniques for the total weighted tardiness problem". Instructions for remote access. Click here to access this electronic resource. Access available to Kutztown University faculty, staff, and students only, 1995. http://www.kutztown.edu/library/services/remote_access.asp.
Pełny tekst źródłaSource: Masters Abstracts International, Volume: 45-06, page: 3188. Abstract precedes thesis as [1] preliminary leaf. Typescript. Includes bibliographical references (leaves 30-33).
Bader-El-Den, Mohamed Bahr. "Investigation of genetic programming as a hyper-heuristic for combinatorial optimization". Thesis, University of Essex, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.510512.
Pełny tekst źródłaLaesanklang, Wasakorn. "Heuristic decomposition and mathematical programming for workforce scheduling and routing problems". Thesis, University of Nottingham, 2017. http://eprints.nottingham.ac.uk/39883/.
Pełny tekst źródłaNowak, Maciek A. "The Pickup and Delivery Problem with Split Loads". Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/7223.
Pełny tekst źródłaLaDuca, Robert James. "Optimizing steering heuristics for clustered microarchitectures". Diss., Online access via UMI:, 2006.
Znajdź pełny tekst źródłaLiu, Wen-Hsing. "Tabu search heuristics for the dynamic facility layout problem". Morgantown, W. Va. : [West Virginia University Libraries], 2005. https://eidr.wvu.edu/etd/documentdata.eTD?documentid=3973.
Pełny tekst źródłaTitle from document title page. Document formatted into pages; contains vii, 88 p. : ill. Includes abstract. Includes bibliographical references (p. 83-88).
Twardus, Jesse. "The use of heuristics in identifying self-propagating malicious mobile code". Morgantown, W. Va. : [West Virginia University Libraries], 2005. https://eidr.wvu.edu/etd/documentdata.eTD?documentid=4195.
Pełny tekst źródłaTitle from document title page. Document formatted into pages; contains viii, 104 p. : ill. (some col.). Includes abstract. Includes bibliographical references (p. 89-92).
Rungta, Neha S. "Improving error discovery using guided model checking /". Diss., CLICK HERE for online access, 2006. http://contentdm.lib.byu.edu/ETD/image/etd1555.pdf.
Pełny tekst źródłaHakobyan, Artak. "Heuristics for the dynamic facility layout problem with unequal area departments". Morgantown, W. Va. : [West Virginia University Libraries], 2008. https://eidr.wvu.edu/etd/documentdata.eTD?documentid=5699.
Pełny tekst źródłaTitle from document title page. Document formatted into pages; contains xiii, 109 p. : ill. (some col.). Includes abstract. Includes bibliographical references (p. 97-103).
Nagorka, Peter Randal. "Scheduling problems with no intermediate storage : heuristics and probabilistic analysis". Diss., Georgia Institute of Technology, 1987. http://hdl.handle.net/1853/24370.
Pełny tekst źródłaColletti, Bruce William. "Group theory and metaheuristics /". Digital version accessible at:, 1999. http://wwwlib.umi.com/cr/utexas/main.
Pełny tekst źródłaShang, Jin. "Ant colony heuristics for the dynamic facility layout problem". Morgantown, W. Va. : [West Virginia University Libraries], 2002. http://etd.wvu.edu/templates/showETD.cfm?recnum=2579.
Pełny tekst źródłaTitle from document title page. Document formatted into pages; contains vii, 76 p. : ill. Includes abstract. Includes bibliographical references (p. 72-76).
Rodohan, Darren Patrick. "The associative evaluation of logic programs and heuristic search techniques". Thesis, Brunel University, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.334391.
Pełny tekst źródłaAliano, Filho Angelo [UNESP]. "Metaheurísticas em um problema de rotação de culturas". Universidade Estadual Paulista (UNESP), 2012. http://hdl.handle.net/11449/95055.
Pełny tekst źródłaCoordenaçã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)
Aliano, Filho Angelo. "Metaheurísticas em um problema de rotação de culturas /". Botucatu, 2012. http://hdl.handle.net/11449/95055.
Pełny tekst źródłaCoorientador: 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
Qian, Kairong Computer Science & Engineering Faculty of Engineering UNSW. "Formal symbolic verification using heuristic search and abstraction techniques". Awarded by:University of New South Wales. School of Computer Science and Engineering, 2006. http://handle.unsw.edu.au/1959.4/25703.
Pełny tekst źródłaHenderson, Dale L. "Heuristic and exact techniques for solving a temperature estimation model /". Find on the web, 2005. http://etd.library.arizona.edu/etd/GetFileServlet?file=file:///data1/pdf/etd/azu%5Fetd%5F1396%5F1%5Fm.pdf&type=application/pdf.
Pełny tekst źródłaLü, Haili, i 吕海利. "A comparative study of assembly job shop scheduling using simulation, heuristics and meta-heuristics". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2011. http://hub.hku.hk/bib/B47029018.
Pełny tekst źródłaSu, Jingdong. "A heuristic slow voltage control scheme for large power systems". Online access for everyone, 2006. http://www.dissertations.wsu.edu/Dissertations/Spring2006/j%5Fsu%5F030206.pdf.
Pełny tekst źródłaKhadndekar, Shashank. "Heuristic scheduling of low acuity patients at the emergency department". Online access via UMI:, 2007.
Znajdź pełny tekst źródła[UNESP], Silva Marcelo Andrade da. "Critérios compostos para delineamentos ótimos robustos". Universidade Estadual Paulista (UNESP), 2014. http://hdl.handle.net/11449/110368.
Pełny tekst źródłaNeste 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)
Silva, Marcelo Andrade da. "Critérios compostos para delineamentos ótimos robustos /". Botucatu, 2014. http://hdl.handle.net/11449/110368.
Pełny tekst źródłaBanca: 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
Lavinus, Joseph W. "Heuristics for laying out information graphs". Thesis, This resource online, 1992. http://scholar.lib.vt.edu/theses/available/etd-12302008-063333/.
Pełny tekst źródłaKoo, Wai-yip. "Container loading problem by a multi-stage heuristics approach /". Hong Kong : University of Hong Kong, 1997. http://sunzi.lib.hku.hk/hkuto/record.jsp?B19471245.
Pełny tekst źródłaFeurstein, Markus, i Martin Natter. "Neural networks, stochastic dynamic programming and a heuristic for valuing flexible manufacturing systems". SFB Adaptive Information Systems and Modelling in Economics and Management Science, WU Vienna University of Economics and Business, 1998. http://epub.wu.ac.at/1106/1/document.pdf.
Pełny tekst źródłaSeries: Working Papers SFB "Adaptive Information Systems and Modelling in Economics and Management Science"
Karcher, Cody Jacob. "A heuristic for including black box analysis tools into a geometric programming formulation". Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/112465.
Pełny tekst źródłaCataloged from PDF version of thesis.
Includes bibliographical references (pages 79-82).
Recently, geometric programming has been proposed as a powerful tool for enhancing aircraft conceptual design. While geometric programming has shown promise in early studies, current formulations preclude the designer from using black box analysis codes which are prolific in the aircraft design community. Previous work has shown the ability to fit data from these black box codes prior to the optimization run, however, this is often a time consuming and computationally expensive process that does not scale well to higher dimensional black boxes. Based upon existing iterative optimization methods, we propose a heuristic for including black box analysis codes in a geometric programming framework by utilizing sequential geometric programming (SGP). We demonstrate a heuristic SGP method and apply it to a solar powered aircraft using a black boxed GP compatible profile drag function. Using this heuristic algorithm, we achieve less than a 1% difference in the objective function between a direct implementation of the constraint and a black box implementation of the constraint.
by Cody Jacob Karcher.
S.M.
Ekstrom, John E. "The relationship of heuristic instruction to computer based problem-solving performance". Thesis, Boston University, 1987. https://hdl.handle.net/2144/38026.
Pełny tekst źródłaPLEASE NOTE: Boston University Libraries did not receive an Authorization To Manage form for this thesis or dissertation. It is therefore not openly accessible, though it may be available by request. If you are the author or principal advisor of this work and would like to request open access for it, please contact us at open-help@bu.edu. Thank you.
This study investigated the relationship between an instructional pedagogy formulated around Polya's heuristic four-step method and computer based problem solving performance in an introduction to computer programming course. A four step heuristic managerial guide, employing structured walkthroughs and group activities, was developed to direct students into a period of constructive reflection, planning, and refinement supporting structured programming. The subjects consisted of fifty-four secondary school seniors, completing a first course in BASIC programming, evenly divided into an experimental group and a control group. The experimental group received instruction related to the heuristic managerial guide. The control group received instruction similar to what was normally provided them without the guide. Four problems were introduced and analyzed, within a lecture format, followed by a question-answer session. Each subject attempted to complete a problem-set consisting of a problem and three related extensions. After a week, results were evaluated and scores from zero to four were assigned based on the number of correct solutions attained. No qualitative evaluation was performed. The null hypothesis stated that the two sets of scores came from populations having identical distributions. Since a normal distribution was questionable, the statistic used was the Mann-Whitney U test, a nonparametric version of the t-test for independent samples. The ranked scores for the two groups appeared to support the research hypothesis, since the sum of ranked scores for the experimental group exceeded those of the control group 840 to 645. However, the results of the Mann-Whitney test did not support a rejection of the null hypothesis at the 5% level of significance. The value, z = 1.791, was sufficient to support the rejection of the null hypothesis at the 7% level. Therefore, the heuristic managerial guide showed a tendency to positively contribute to student performance on the problem set used in the study. The conclusion drawn was that the heuristic managerial guide yielded encouraging, but not significant, results when applied to a computer based problem set. Further research into this approach should consider the effects of the method if implemented at the inception of the students' first course.
2031-01-01
Dai, Peng. "FASTER DYNAMIC PROGRAMMING FOR MARKOV DECISION PROCESSES". UKnowledge, 2007. http://uknowledge.uky.edu/gradschool_theses/428.
Pełny tekst źródłaAssis, Laura Silva de 1983. "Problema de reagrupamento capacitado". [s.n.], 2009. http://repositorio.unicamp.br/jspui/handle/REPOSIP/259714.
Pełny tekst źródłaDissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação
Made available in DSpace on 2018-08-14T08:51:37Z (GMT). No. of bitstreams: 1 Assis_LauraSilvade_M.pdf: 1632808 bytes, checksum: dfd28dc2bbd2bb5fe453a2fb1c2b7b6e (MD5) Previous issue date: 2009
Resumo: O objetivo desta dissertação é desenvolver uma metodologia eficiente para solucionar o problema de agrupamento capacitado multicritério (PACM), no qual objetos com pesos associados são dados, os quais devem ser particionados em agrupamentos com capacidade limitada. Neste trabalho, o PACM está ambientado em um problema de reagrupamento de lotes urbanos, nos quais devem ser realizadas as leituras dos medidores de energia elétrica por concessionárias de distribuição de energia. A operação de leitura dos medidores é realizada sobre lotes geograficamente definidos e é desempenhada sobre rotas percorridas uma vez por mês pelos leituristas. A motivação deste trabalho é atribuída ao fato de que, com o passar do tempo, o tamanho e o formato dos lotes vão ficando obsoletos, devido a modificações introduzidas na conformação atual, desarranjando o equilíbrio entre os lotes e desatualizando as rotas. Por esse motivo é importante realizar um reagrupamento dos lotes buscando a diminuição dos custos operacionais de leitura, assim como a minimização dos custos e transtornos causados pelas modificações. O método proposto para resolver o problema abordado nesta dissertação é um algoritmo baseado na metaheurística GRASP (Greedy randomized adaptive search procedure). A eficiência do método proposto é testada sobre uma série de instâncias geradas e sobre uma rede real. Os experimentos computacionais demonstram a eficiência do método.
Abstract: The aim of this dissertation is to develop an eficient methodology to solve the multicriteria redistricting capacitated problem (PACM), in which objects with associated weights are given, which must be partitioned into groups with limited capacity. In this work, the PACM is inserted in to a reassignment problem of urban clusters of clients, in which the readings of the eletric energy measurement must be performed by the company of energy distribution. The reading operation is performed over lots geographically defined is performed once a month by the readers. The motivation of this work is due to the fact that the size and shape of the lots become obsolete after some time, due to modifications introduced in the current conformation, desarranging the balance between the lots and outdating the routes. For this reason it is important to achieve a reassignment of the lots trying to decrease the operational costs of reading, as well as minimizing the costs and inconvenience caused by the changes. The proposed method to solve the problem addressed in this dissertation is a algorithm based on GRASP (Greedy randomized adaptive search procedure) metaheuristic. The efectiveness of the proposed method is tested on a large number of generated instances and on a real network. Computational experiments demonstrate the efectiveness of the proposed approach.
Mestrado
Automação
Mestre em Engenharia Elétrica
RONCO, ROBERTO. "Exact and Heuristic Algorithms for Energy-Efficient Scheduling". Doctoral thesis, Università degli studi di Genova, 2022. http://hdl.handle.net/11567/1068456.
Pełny tekst źródłaRajgopal, P. "A flexible construction and improvement heuristic for the quadratic assignment problem". Thesis, Virginia Polytechnic Institute and State University, 1985. http://hdl.handle.net/10919/101253.
Pełny tekst źródłaM.S.
Rushall, David Aaron 1964. "Efficient heuristics for collision avoidance in three dimensions". Thesis, The University of Arizona, 1989. http://hdl.handle.net/10150/277041.
Pełny tekst źródłaZacherl, Brian. "Weapon-target pairing revising an air tasking order in real-time". Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2006. http://library.nps.navy.mil/uhtbin/hyperion/06Sep%5FZacherl.pdf.
Pełny tekst źródłaThesis Advisor(s): W. Matthew Carlyle. "September 2006." Includes bibliographical references (p. 35). Also available in print.
Cheng, Lin. "A genetic algorithm for the vehicle routing problem with time windows /". Electronic version (PDF), 2005. http://dl.uncw.edu/etd/2005/chengl/lincheng.pdf.
Pełny tekst źródłaScherer, Scott D. "Game-Theoretic Anti-Submarine Warfare Mission Planner (heuristic-based, fully Excel capable)". Thesis, Monterey, California : Naval Postgraduate School, 2009. http://edocs.nps.edu/npspubs/scholarly/theses/2009/Sep/09Sep%5FScherer.pdf.
Pełny tekst źródłaThesis Advisor(s): Brown, Gerald G. "September 2009." Description based on title screen as viewed on November 5, 2009. Author(s) subject terms: Optimization, Mathematical Programming, Heuristic Algorithms, Network Flows, Anti-Submarine Warfare, Search and Detection, Game Theory. Includes bibliographical references (p. 53). Also available in print.
GARRAFFA, MICHELE. "Exact and Heuristic Hybrid Approaches for Scheduling and Clustering Problems". Doctoral thesis, Politecnico di Torino, 2016. http://hdl.handle.net/11583/2639115.
Pełny tekst źródłaPapaioannou, Grammatoula. "Integer programming and heuristic methods for the cell formation problem with part machine sequencing". Thesis, Loughborough University, 2007. https://dspace.lboro.ac.uk/2134/16411.
Pełny tekst źródła