Rozprawy doktorskie na temat „Heuristic programming”
Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten 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.
1
Ambrogi, Timothy. "Heuristic counterpoint". Diss., Connect to the thesis, 2004. http://hdl.handle.net/10066/1484.
Pełny tekst źródła
2
Perry, 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ła
3
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.
Pełny tekst źródłaStreszczenie:
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)
4
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łaStreszczenie:
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
5
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łaStreszczenie:
This thesis explores limitations of heuristic search planning, and presents techniques to overcome those limitations. The two halves of the thesis discuss problems in standard propositional planning (STRIPS) and in planning with numeric state variables respectively.In 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.
6
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ła
7
Hyde, 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łaStreszczenie:
This thesis presents a programme of research which investigated a genetic programming hyper-heuristic methodology to automate the heuristic design process for one, two and three dimensional packing problems. Traditionally, heuristic search methodologies operate on a space of potential solutions to a problem. In contrast, a hyper-heuristic is a heuristic which searches a space of heuristics, rather than a solution space directly. The majority of hyper-heuristic research papers, so far, have involved selecting a heuristic, or sequence of heuristics, from a set pre-defined by the practitioner. Less well studied are hyper-heuristics which can create new heuristics, from a set of potential components. This thesis presents a genetic programming hyper-heuristic which makes it possible to automatically generate heuristics for a wide variety of packing problems. The genetic programming algorithm creates heuristics by intelligently combining components. The evolved heuristics are shown to be highly competitive with human created heuristics. The methodology is first applied to one dimensional bin packing, where the evolved heuristics are analysed to determine their quality, specialisation, robustness, and scalability. Importantly, it is shown that these heuristics are able to be reused on unseen problems. The methodology is then applied to the two dimensional packing problem to determine if automatic heuristic generation is possible for this domain. The three dimensional bin packing and knapsack problems are then addressed. It is shown that the genetic programming hyper-heuristic methodology can evolve human competitive heuristics, for the one, two, and three dimensional cases of both of these problems. No change of parameters or code is required between runs. This represents the first packing algorithm in the literature able to claim human competitive results in such a wide variety of packing domains.
8
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/.
Pełny tekst źródłaStreszczenie:
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.
9
Tian, Zhong Huan. "Gender based meta-heuristic optimization algorithms". Thesis, University of Macau, 2017. http://umaclib3.umac.mo/record=b3691331.
Pełny tekst źródła
10
Sariklis, 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ła
11
Bertsimas, 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łaStreszczenie:
We propose a mathematical programming approach for the classical PSPACE - hard problem of n restless bandits in stochastic optimization. We introduce a series of n increasingly stronger linear programming relaxations, the last of which is exact and corresponds to the formulation of the problem as a Markov decision process that has exponential size, while other relaxations provide bounds and are efficiently solvable. We also propose a heuristic for solving the problem that naturally arises from the first of these relaxations and uses indices that are computed through optimal dual variables from the first relaxation. In this way we propose a policy and a suboptimality guarantee. We report computational results that suggest that the value of the proposed heuristic policy is extremely close to the optimal value. Moreover, the second order relaxation provides strong bounds for the optimal solution value.
12
Garrett, 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ła
13
Sadones, 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ła
14
Huegler, 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łaStreszczenie:
Thesis (M.A.)--Kutztown University of Pennsylvania, 1995.Source: Masters Abstracts International, Volume: 45-06, page: 3188. Abstract precedes thesis as [1] preliminary leaf. Typescript. Includes bibliographical references (leaves 30-33).
15
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ła
16
Laesanklang, 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łaStreszczenie:
This thesis presents a PhD research project using a mathematical programming approach to solve a home healthcare problem (HHC) as well as general workforce scheduling and routing problems (WSRPs). In general, the workforce scheduling and routing problem consists of producing a schedule for mobile workers to make visits at different locations in order to perform some tasks. In some cases, visits may have time-wise dependencies in which a visit must be made within a time period depending on the other visit. A home healthcare problem is a variant of workforce scheduling and routing problems, which consists in producing a daily schedule for nurses or care workers to visit patients at their home. The scheduler must select qualified workers to make visits and route them throughout the time horizon. We implement a mixed integer programming model to solve the HHC. The model is an adaptation of the WSRP from the literature. However, the MIP solver cannot solve a large-scale real-world problem defined in this model form because the problem requires large amounts of memory and computational time. To tackle the problem, we propose heuristic decomposition approaches which split a main problem into sub-problems heuristically and each sub-problem is solved to optimality by the MIP solver. The first decomposition approach is a geographical decomposition with conflict avoidance (GDCA). The algorithm avoids conflicting assignments by solving sub-problems in a sequence in which worker's availabilities are updated after a sub-problem is solved. The approach can find a feasible solution for every HHC problem instance tackled in this thesis. The second approach is a decomposition with conflict repair and we propose two variants: geographical decomposition with conflict repair (GDCR) and repeated decomposition and conflict repair (RDCR). The GDCR works in the same way as GDCA but instead of solving sub-problems in a given sequence, they are solved with no specific order and conflicting assignments are allowed. Later on, the conflicting assignments are resolved by a conflicting assignments repair process. The remaining unassigned visits are allocated by a heuristic assignment algorithm. The second variant, RDCR, tackles the unassigned visits by repeating the decomposition and conflict repair until no further improvement has been found. We also conduct an experiment to use different decomposition rules for RDCR. Based on computational experiments conducted in this thesis, the RDCR is found to be the best of the heuristic decomposition approaches. Therefore, the RDCR is extended to solve a WSRP with time-dependent activities constraints. The approach requires modification to accommodate the time-dependent activities constraints which means that two visits may have time-wise requirements such as synchronisation, time overlapped, etc. In addition, we propose a reformulated MIP model to solve the HHC problem. The new model is considered to be a compact model because it has significantly fewer constraints. The aim of the reformulation is to reduce the solver requirements for memory and computational time. The MIP solver can solve all the HHC instances formulated in a compact model. Most of solutions obtained with this approach are the best known solutions so far except for those the instances for which the optimal solution can be found using the full MIP model. Typically, this approach requires computational time below one hour per instance. This problem reformulation is so far the best approach to solve the HHC instances considered in this thesis. The heuristic decomposition and model reformulation proposed in this thesis can find solutions to the real-world home healthcare problem. The main achievement is the reduction of computational memory and computational time which are required by the optimisation solver. Our studies show the best way to control the use of solver memory is the heuristic decomposition approach, particularly the RDCR method. The RDCR method can find a solution for every instance used throughout this thesis and keep the memory usage within personal computer memory ranges. Also, the computational time required to solve an instance being less than 8 minutes, for which the solution gap to the optimal solution is on average 12%. In contrast, the strong point of the model reformulation approach over the heuristic decomposition is that the model reformulation provides higher quality solutions. The relative gaps of solutions between the solution for solving the reformulated model and the solution from solving the full model is less than 1% whilst its the computational time could be up to one hour and its computational memory could require up to 100 GB. Therefore, the heuristic decomposition approach is a method for finding a solution using restricted resources while the model reformulation is an approach for when a high solution quality is required. Hence, two mathematical programming based heuristic approaches are each more suitable in different circumstances in which both find high quality solutions within an acceptable time limit.
17
Nowak, 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łaStreszczenie:
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.
18
LaDuca, Robert James. "Optimizing steering heuristics for clustered microarchitectures". Diss., Online access via UMI:, 2006.
Znajdź pełny tekst źródła
19
Liu, 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łaStreszczenie:
Thesis (M.S.)--West Virginia University, 2005.Title from document title page. Document formatted into pages; contains vii, 88 p. : ill. Includes abstract. Includes bibliographical references (p. 83-88).
20
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łaStreszczenie:
Thesis (M.S.)--West Virginia University, 2005.Title from document title page. Document formatted into pages; contains viii, 104 p. : ill. (some col.). Includes abstract. Includes bibliographical references (p. 89-92).
21
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ła
22
Hakobyan, 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łaStreszczenie:
Thesis (Ph. D.)--West Virginia University, 2008.Title from document title page. Document formatted into pages; contains xiii, 109 p. : ill. (some col.). Includes abstract. Includes bibliographical references (p. 97-103).
23
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ła
24
Colletti, Bruce William. "Group theory and metaheuristics /". Digital version accessible at:, 1999. http://wwwlib.umi.com/cr/utexas/main.
Pełny tekst źródła
25
Shang, 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łaStreszczenie:
Thesis (M.S.)--West Virginia University, 2002.Title from document title page. Document formatted into pages; contains vii, 76 p. : ill. Includes abstract. Includes bibliographical references (p. 72-76).
26
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ła
27
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.
Pełny tekst źródłaStreszczenie:
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)
28
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łaStreszczenie:
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
29
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łaStreszczenie:
Computing devices are pervading our everyday life and imposing challenges for designers that have the responsibility of producing reliable hardware and software systems. As systems grow in size and complexity, it becomes increasingly difficult to verify whether a design works as intended. Conventional verification methods, such as simulation and testing, exercise only parts of the system and from these parts, draw conclusions about the correctness of the total design. For complex designs, the parts of the system that can be verified are relatively small. Formal verification aims to overcome this problem. Instead of exercising the system, formal verification builds mathematical models of designs and proves whether properties hold in these models. In doing so, it at least aims to cover the complete design. Model checking is a formal verification method that automatically verifies a model of a design, or generates diagnostic information if the model cannot be verified. It is because of this usability and level of automation that model checking has gained a high degree of success in verifying circuit designs. The major disadvantage of model checking is its poor scalability. This is due to its algorithmic nature: namely, every state of the model needs to be enumerated. In practice, properties of interest may not need the exhaustive enumeration of the model state space. Many properties can be verified (or falsified) by examining a small number of states. In such cases, exhaustive algorithms can be replaced with search algorithms that are directed by heuristics. Methods based on heuristics generally scale well. This thesis investigates non-exhaustive model checking algorithms and focuses on error detection in system verification. The approach is based on a novel integration of symbolic model checking, heuristic search and abstraction techniques to produce a framework that we call abstractiondirected model checking. There are 3 main components in this framework. First, binary decision diagrams (BDDs) and heuristic search are combined to develop a symbolic heuristic search algorithm. This algorithm is used to detect errors. Second, abstraction techniques are applied in an iterative way. In the initial phase, the model is abstracted, and this model is verified using exhaustive algorithms. If a definitive verification result cannot be obtained, the same abstraction is re-used to generate a search heuristic. The heuristic in turn is used to direct a search algorithm that searches for error states in the concrete model. Third, a model transformation mechanism converts an arbitrary branching-time property to a reachability property. Essentially, this component allows this framework to be applied to a more general class of temporal property. By amalgamating these three components, the framework offers a new verification methodology that speeds up error detection in formal verification. The current implementation of this framework indicates that it can outperform existing standard techniques both in run-time and memory consumption, and scales much better than conventional model checking.
30
Henderson, 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ła
31
Lü, 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ła
32
Su, 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ła
33
Khadndekar, Shashank. "Heuristic scheduling of low acuity patients at the emergency department". Online access via UMI:, 2007.
Znajdź pełny tekst źródła
34
[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łaStreszczenie:
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)
35
Silva, Marcelo Andrade da. "Critérios compostos para delineamentos ótimos robustos /". Botucatu, 2014. http://hdl.handle.net/11449/110368.
Pełny tekst źródłaStreszczenie:
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
36
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ła
37
Koo, 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ła
38
Feurstein, 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łaStreszczenie:
We compare the use of stochastic dynamic programming (SDP), Neural Networks and a simple approximation rule for calculating the real option value of a flexible production system. While SDP yields the best solution to the problem, it is computationally prohibitive for larger settings. We test two approximations of the value function and show that the results are comparable to those obtained via SDP. These methods have the advantage of a high computational performance and of no restrictions on the type of process used. Our approach is not only useful for supporting large investment decisions, but it can also be applied in the case of routine decisions like the determination of the production program when stochastic profit margins occur. (author's abstract)Series: Working Papers SFB "Adaptive Information Systems and Modelling in Economics and Management Science"
39
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łaStreszczenie:
Thesis: S.M., Massachusetts Institute of Technology, Department of Aeronautics and Astronautics, 2017.Cataloged 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.
40
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łaStreszczenie:
Thesis (Ed.D.)--Boston UniversityPLEASE 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
41
Dai, Peng. "FASTER DYNAMIC PROGRAMMING FOR MARKOV DECISION PROCESSES". UKnowledge, 2007. http://uknowledge.uky.edu/gradschool_theses/428.
Pełny tekst źródłaStreszczenie:
Markov decision processes (MDPs) are a general framework used by Artificial Intelligence (AI) researchers to model decision theoretic planning problems. Solving real world MDPs has been a major and challenging research topic in the AI literature. This paper discusses two main groups of approaches in solving MDPs. The first group of approaches combines the strategies of heuristic search and dynamic programming to expedite the convergence process. The second makes use of graphical structures in MDPs to decrease the effort of classic dynamic programming algorithms. Two new algorithms proposed by the author, MBLAO* and TVI, are described here.
42
Assis, Laura Silva de 1983. "Problema de reagrupamento capacitado". [s.n.], 2009. http://repositorio.unicamp.br/jspui/handle/REPOSIP/259714.
Pełny tekst źródłaStreszczenie:
Orientador: Paulo Morelato Franç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
43
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łaStreszczenie:
The combined increase of energy demand and environmental pollution at a global scale is entailing a rethinking of the production models in sustainable terms. As a consequence, energy suppliers are starting to adopt strategies that flatten demand peaks in power plants by means of pricing policies that stimulate a change in the consumption practices of customers.
A representative example is the Time-of-Use (TOU)-based tariffs policy, which encourages electricity usage at off-peak hours by means of low prices, while penalizing peak hours with higher prices. To avoid a sharp increment of the energy supply costs, manufacturing industry must carefully reschedule the production process, by shifting it towards less expensive periods. The TOU-based tariffs policy induces an implicit partitioning of the time horizon of the production into a set of time slots, each associated with a non-negative cost that becomes a part of the optimization objective.
This thesis focuses on a representative bi-objective energy-efficient job scheduling problem on parallel identical machines under TOU-based tariffs by delving into the description of its inherent properties, mathematical formulations, and solution approaches. Specifically, the thesis starts by reviewing the flourishing literature on the subject, and providing a useful framework for theoreticians and practitioners. Subsequently, it describes the considered problem and investigates its theoretical properties. In the same chapter, it presents a first mathematical model for the problem, as well as a possible reformulation that exploits the structure of the solution space so as to achieve a considerable increase in compactness. Afterwards, the thesis introduces a sophisticated heuristic scheme to tackle the inherent hardness of the problem, and an exact algorithm that exploits the mathematical models. Then, it shows the computational efficiency of the presented solution approaches on a wide test benchmark. Finally, it presents a perspective on future research directions for the class of energy-efficient scheduling problems under TOU-based tariffs as a whole.
44
Rajgopal, 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łaStreszczenie:
This thesis is concerned with the development of heuristic algorithms for the popular Quadratic Assignment Problem (QAP) which finds a wide variety of applications in various fields. This discrete optimization problem, which seeks the placement of m facilities on m locations in order to minimize a quadratic interactive cost, is well known to be NP-hard and turns out to be computationally intractable for even moderately sized problems. Hence, problems involving more than 12-15 facilities usually need to be analysed by approximate solution procedures.
The more successful heuristic procedures which exist for problem QAP are computationally intensive, some of these resulting from a premature termination of exact solution procedures. The motivation here is to develop a polynomial time heuristic which is effective with respect to the quality of solutions obtained, while at the same time not being computationally very expensive.
The method proposed herein is flexible in that one can operate it to suitably trade solution quality against effort as desired, and is portable in that the modules used as building blocks can be employed in conjunction with other heuristics as well. Computational experience on test problems found in the literature is provided to evaluate the worth of this method.M.S.
45
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łaStreszczenie:
This thesis represents a relatively new aspect of computing with regard to robotics. The need for fast, efficient collision avoidance algorithms is growing rapidly. Because conventional methods are complex and require vast amounts of computation, heuristic algorithms are more appealing. The focus of this thesis is the problem of moving a point through three dimensional space while avoiding known polyhedral obstacles. A heuristic algorithm to find shortest (near-optimal) collision-free paths in the presence of polyhedral obstacles, given initial and final positions, is presented. Previous methods for the problem rely on an a priori discretization of the space. The points in the discretization form nodes of a graph, and the collision avoidance problem is then solved by using some shortest path algorithm on the graph. The heuristic suggested here successively adds nodes to a graph, thus keeping the size of the graph manageable. The computational results are extremely encouraging.
46
Zacherl, 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łaStreszczenie:
Thesis (M.S. in Operations Research)--Naval Postgraduate School, September 2006.Thesis Advisor(s): W. Matthew Carlyle. "September 2006." Includes bibliographical references (p. 35). Also available in print.
47
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ła
48
Scherer, 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łaStreszczenie:
Thesis (M.S. in Operations Research)--Naval Postgraduate School, September 2009.Thesis 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.
49
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łaStreszczenie:
This thesis deals with the design of exact and heuristic algorithms for scheduling and clustering combinatorial optimization problems. All the works are linked by the fact that all the presented methods arebasically hybrid algorithms, that mix techniques used in the world of combinatorial optimization. The algorithms are all efficient in practice, but the one presented in Chapter 4, that has mostly theoretical
interest. Chapter 2 presents practical solution algorithms based on an ILP model for an energy scheduling combinatorial problem that arises in a smart building context. Chapter 3 presents a new cutting stock problem
and introduce a mathematical formulation and a heuristic solution approach based on a heuristic column generation scheme. Chapter 4 provides an exact exponential algorithm, whose importance is only theoretical so far, for a classical scheduling problem: the Single Machine Total Tardiness Problem. The relevant aspect is that the designed algorithm has the best worst case complexity for the problem, that has been studied for several decades. Furthermore, such result is based on a new technique, called Branch and Merge, that avoids the solution of several equivalent sub-problems in a branching algorithm that requires polynomial space. As a consequence, such technique embeds in a branching algorithm ideas coming from other traditional computer science techniques such as dynamic programming and memorization, but keeping the space requirement polynomial.
Chapter 5 provides an exact approach based on semidefinite programming and a matheuristic approach based on a quadratic solver for a fractional clustering combinatorial optimization problem, called Max-Mean Dispersion Problem. The matheuristic approach has the peculiarity of using a non-linear MIP solver. The proposed exact approach uses a general semidefinite programming relaxation and it is likely to be extended to other combinatorial problems with a fractional formulation.
Chapter 6 proposes practical solution methods for a real world clustering problem arising in a smart city context. The solution algorithm is based on the solution of a Set Cover model via a commercial ILP solver.
As a conclusion, the main contribution of this thesis is given by several approaches of practical or theoretical interest, for two classes of important combinatorial problems: clustering and scheduling. All the practical methods presented in the thesis are validated by extensive computational experiments, that compare the proposed methods with the ones available in the state of the art.
50
Papaioannou, 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łaStreszczenie:
Cell formation has received much attention from academicians and practitioners because of its strategic importance to modern manufacturing practices. Existing research on cell formation problems using integer programming (IP) has achieved the target of solving problems that simultaneously optimise machine-cell allocation and partmachine allocation. This thesis presents extensions of an IP model where part-machine assignment and cell formation are addressed simultaneously, and integration of inter-cell movements of parts and machine set-up costs within the objective function is taking place together with the inclusion of an ordered part machine operation sequence. The latter is identified as a neglected parameter for the Cell Formation problem. Due to the nature of the mathematical IP modelling for Cell Formation two main drawbacks can be identified: (a) Cell Formation is considered to be a complex and difficult combinatorial optimisation problem or in other words NP-hard (Non-deterministic Polynomial time hard) problem and (b) because of the deterministic nature of mathematical programming the decision maker is required to specify precisely goals and constraints. The thesis describes a comprehensive study of the cell formation problem where fuzzy set theory is employed for measuring uncertainty. Membership functions are used to express linguistically the uncertainty involved and aggregation operators are employed to transform the fuzzy models into mathematical programming models. The core of the research concentrates on the investigation and development of heuristic and . metaheuristic approaches. A three stage randomly generated heuristic approach for producing an efficient initial solution for the CF together with an iterative heuristic are first developed. Numerous data sets are employed which prove their effectiveness. Moreover, an iterative tabu search algorithm is implemented where the initial solution fed in is the same as that used in the descent heuristic. The first iterative procedure and the tabu search algorithm are compared and the results produced show the superiority of the latter over the former in stability, computational times and clustering results.