Rozprawy doktorskie: „Simulated annealing”

1

Araujo, Haroldo Alexandre de. "Algoritmo Simulated Annealing". Florianópolis, SC, 2001. http://repositorio.ufsc.br/xmlui/handle/123456789/80386.

Pełny tekst źródła

Streszczenie:

Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico. Programa de Pós-Graduação em Ciência da Computação.
Made available in DSpace on 2012-10-18T13:35:55Z (GMT). No. of bitstreams: 1 225675.pdf: 796704 bytes, checksum: 892abc8468e4e7c6715b6c3f2de50e51 (MD5)
A busca por soluções de problemas por meio do computador é o tema central da ciência da computação, relevante para grande parte da ciência e de suas aplicações tecnológicas. Essa busca, certamente, vai na direção de algoritmos eficientes e exatos mas que nem sempre boas soluções podem ser encontradas para muitos problemas de ordem prática, principalmente, no que diz respeito a tempo de execução. Existem problemas, dentre estes, os de otimização combinatorial que apresentam uma peculiaridade com relação aos outros, que é a grande dificuldade de se obter soluções exatas num tempo computacional aceitável. Atualmente, as novas técnicas, especialmente as metaheurísticas, tais como: Tabu Search, Simulated Annealing, Algoritmos Genéticos e Redes Neurais, vêm conseguindo sucesso na solução de problemas de otimização combinatorial, que mesmo não apresentando soluções exatas têm mostrado bastante eficiência com suas soluções aproximadas. Este trabalho propõe um novo método baseado no algoritmo Simulated Annealing (SA) através de mudanças bruscas nos valores da temperatura que são retiradas de múltiplas faixas, ao contrário do SA básico, onde esses valores são obtidos de uma faixa única, ou seja, num SA básico, os valores assumidos pela temperatura saem de um intervalo, partindo de um valor inicial, e vão diminuindo até um valor final. Tais mudanças bruscas acontecem exatamente no momento da mudança de faixa, pois o valor da temperatura que no final de uma faixa é pequeno, assume um valor correspondente a temperatura inicial da faixa seguinte, normalmente, bem maior. Posto a prova, com instâncias euclidianas do Problema Caixeiro Viajante, que é um problema de otimização combinatorial de difícil solução, o método apresenta resultados bastante satisfatórios quando comparado com o SA básico.

Style APA, Harvard, Vancouver, ISO itp.

2

Sakhavat, Tamim, Haithem Grissa i Ziyad Abdalrahman. "Simulated Annealing : Simulated Annealing for Large Scale Optimization in Wireless Communications". Thesis, Linnéuniversitetet, Institutionen för datavetenskap, fysik och matematik, DFM, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-24606.

Pełny tekst źródła

Streszczenie:

In this thesis a simulated annealing algorithm is employed as an optimization tool for a large scale optimization problem in wireless communication. In this application, we have 100 places for transition antennas and 100 places for receivers, and also a channel between each position in both areas. Our aim is to nd, say the best 3 positions there, in a way that the channel capacity is maximized. The number of possible combinations is huge. Hence, nding the best channel will take a very long time using an exhaustive search. To solve this problem, we use a simulated annealing algorithm and estimate the best answer. The simulated annealing algorithm chooses a random element, and then from the local search algorithm, compares the selected element with its neighbourhood. If the selected element is the maximum among its neighbours, it is a local maximum. The strength of the simulated annealing algorithm is its ability to escape from local maximum by using a random mechanism that mimics the Boltzmann statistic.

Style APA, Harvard, Vancouver, ISO itp.

3

Thompson, J. M. "Examination scheduling using simulated annealing". Thesis, Swansea University, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.639229.

Pełny tekst źródła

Streszczenie:

Recent increases, both in student numbers and choice of subjects, have made the problem of producing university examination timetables increasingly difficult. Additionally, there is pressure to give students free periods between exams to aid their revision. Many other constraints may also be imposed on the timetable. The aim of this research is to investigate the usefulness of simulated annealing, as a basis of an efficient solution method, for this problem. The examination timetabling problem is shown to be equivalent to the graph colouring problem, with side constraints. This model allows several of the constraints to be included directly, thereby simplifying the problem. The colouring problem is solved in two phases, with the first obtaining a feasible colouring and the second optimising further objectives while maintaining feasibility. Simulated annealing is used to solve each phase and computational experience demonstrates that this results in high quality solutions. In phase two, only feasible solutions, that is those which satisfy the binding constraints, are considered. This may result in the solution space being disconnected or sparsely connected, possibly reducing solution quality. To overcome this problem, three means of reconnecting the solution space have been developed. The first widens the neighbourhood to include more diverse solutions. The second attempts to search disjoint components of the solution space individually, using a diversification function to guide the search. The final method reintroduces solutions that break the binding constraints to the solution space while penalising them in the cost function. Extending the neighbourhood using a graph theoretic entity called a Kempe chain significantly increases solution quality. Several explanations have been investigated. This research shows that a combination of a phased approach and Kempe chains forms the basis of an effective and flexible simulated annealing based examination timetabling system, which has been implemented successfully at a U.K. university.

Style APA, Harvard, Vancouver, ISO itp.

4

Neil, John Paul. "Simulated annealing based datapath synthesis". Thesis, University of Edinburgh, 1994. http://hdl.handle.net/1842/12715.

Pełny tekst źródła

Streszczenie:

The behavioural synthesis procedure aims to produce optimised register-transfer level datapath descriptions from an algorithmic problem definition, normally expressed in a high-level programming language. The procedure can be partitioned into a number of subtasks linked by a serial synthesis flow. Graph theoretic algorithms can be used to provide solutions to these subtasks. Many of these techniques, however, belong to a class of algorithm for which there is no exact solution computable in polynomial time. To overcome this problem, heuristics are used to constrain the solution space. The introduction of heuristics can cause the algorithm to terminate in a local cost minimum. This thesis supports a global formulation of the behavioural synthesis problem. An algorithm which can avoid local minima, simulated annealing forms the basis of the synthesis system reported. A modular software system is presented in support of this approach. A novel data structure enables multiple degrees of optimisation freedom within the datapath solution space. Synthesis primitives, tightly coupled to a solution costing mechanism directed towards the prevalent datapath implementation technologies, form the core of the system. The software is exercised over small and large-scale synthesis benchmarks. The synthesis paradigm is extended by the provision of optimisation routines capable of supporting the generation of functional pipelines.

Style APA, Harvard, Vancouver, ISO itp.

5

Cevikbas, Safak Burak. "Visibility Based Prefetching With Simulated Annealing". Master's thesis, METU, 2008. http://etd.lib.metu.edu.tr/upload/12609324/index.pdf.

Pełny tekst źródła

Streszczenie:

Complex urban scene rendering is not feasible without culling invisible geometry before the rendering actually takes place. Visibility culling can be performed on predefined regions of scene where for each region a potential visible set of scene geometry is computed. Rendering cost is reduced since instead of a bigger set only a single PVS which is associated with the region of the viewer is rendered. However, when the viewer leaves a region and enters one of its neighbors, disposing currently loaded PVS and loading the new PVS causes stalls. Prefetching policies are utilized to overcome stalls by loading PVS of a region before the viewer enters it. This study presents a prefetching method for interactive urban walkthroughs. Regions and transitions among them are represented as a graph where the regions are the nodes and transitions are the edges. Groups of nodes are formed according to statistical data of transitions and used as the prefetching policy. Some heuristics for constructing groups of nodes are developed and Simulated Annealing is utilized for constructing optimized groups based on developed heuristics. The proposed method and underlying application of Simulated Annealing are customized for minimizing average transition cost.

Style APA, Harvard, Vancouver, ISO itp.

6

Färm, Petra. "Integrated Logic Synthesis Using Simulated Annealing". Doctoral thesis, KTH, Mikroelektronik och Informationsteknik, IMIT, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-4257.

Pełny tekst źródła

Streszczenie:

A conventional logic synthesis flow is composed of three separate phases: technologyindependent optimization, technology mapping, and technology dependentoptimization. A fundamental problem with such a three-phased approach is thatthe global logic structure is decided during the first phase without any knowledge ofthe actual technology parameters considered during later phases. Although technologydependent optimization algorithms perform some limited logic restructuring,they cannot recover from fundamental mistakes made during the first phase, whichoften results in non-satisfiable solutions.We present a global optimization approach combining technology independentoptimization steps with technology dependent objectives in an annealing-basedframework. We prove that, for the presented move set and selection distribution, detailedbalance is satisfied and thus the annealing process asymptotically convergesto an optimal solution. Furthermore, we show that the presented approach cansmoothly trade-off complex, multiple-dimensional objective functions and achievecompetitive results. The combination of technology independent and technologydependent objectives is handled through dynamic weighting. Dynamic weightingreflects the sensitivity of the local graph structures with respect to the actual technologyparameters such as gate sizes, delays, and power levels. The results showthat, on average, the presented advanced annealing approach can improve the areaand delay of circuits optimized using the Boolean optimization technique providedby SIS with 11.2% and 32.5% respectively.Furthermore, we demonstrate how the developed logic synthesis framework canbe applied to two emerging technologies, chemically assembled nanotechnology andmolecule cascades. New technologies are emerging because a number of physicaland economic factors threaten the continued scaling of CMOS devices. Alternativesto silicon VLSI have been proposed, including techniques based on molecularelectronics, quantum mechanics, and biological processes. We are hoping that ourresearch in how to apply our developed logic synthesis framework to two of theemerging technologies might provide useful information for other designers movingin this direction.
QC 20100709

Style APA, Harvard, Vancouver, ISO itp.

7

Allred, Kory J. "Horizontal alignment optimization using simulated annealing /". Available to subscribers only, 2006. http://proquest.umi.com/pqdweb?did=1240703751&sid=3&Fmt=2&clientId=1509&RQT=309&VName=PQD.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

8

Faassen, Johannes [Verfasser]. "Voll datenparalleles Simulated Annealing / Johannes Faassen". Aachen : Shaker, 2003. http://d-nb.info/1179034473/34.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

9

Wade, A. S. C. "Developments of the simulated annealing algorithm". Thesis, University of East Anglia, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.300076.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

Zhou, Guobiao. "Finite time performance of simulated annealing". Thesis, Glasgow Caledonian University, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.358284.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

11

MENDONCA, JORGE MAGALHAES DE. "1D SEISMIC INVERSION USING SIMULATED ANNEALING". PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 1997. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=7536@1.

Pełny tekst źródła

Streszczenie:

O problema de Inversão Sísmica envolve a determinação das propriedades físicas da superfície a partir de dados amostrados na superfície. A construção de um modelo matemático da resposta da subsuperfície à excitação de uma fonte sísmica, tendo como parâmetros as propriedades físicas da subsuperfície, fornece um modelo sintético desta resposta para determinados valores dos parâmetros. Isto permite comparar dados amostrados e modelos sintético. A perturbação do modelo pela variação dos seus parâmetros pode aproximar dados amostrados e sintéticos e colocar o problema da Inversão como um problema de minimização de uma função de erro que os ajuste de forma adequada. Usualmente, os métodos que tentam minimizar a medida a medida de erro supõem um comportamento linear entre a perturbação do modelo e esta medida. Na maioria dos problemas geofísicos, esta medida apresenta um alto grau de não linearidade e uma grande quantidade de mínimos locais. Isto torna estes métodos baseados em aproximações lineares muito sensíveis à escolha de uma boa solução inicial, o que nem sempre está disponível. Como resolver este problema sem uma boa solução inicial? A teoria da Inferência Bayesiana oferece uma solução pelo uso de informação a priori sob o espaço dos parâmetros. O problema de Inversão volta então a ser um problema de otimização onde se precisa maximizar a probabilidade a posteriori dos parâmetros assumirem um certo valor dado que se obteve o resultado da amostragem dos dados. Este problema é resolvido pelo método do Simulated Annealing (SA), método de otimização global que faz uma busca aleatória direcionada no espaço de solução. Este método foi proposto por uma analogia entre o recozimento física de sólidos e problemas de otimização. O SA, na sua variante Very Fast Simulated Annealing (VFSA), é aplicado na solução de problemas de Inversão Sísmica 1 D para modelos acústico e elásticos gerados sinteticamente. A avaliação do desempenho do SA usando medidas de erro com diferentes normas é realizada para um modelo elástico adicionado de ruído aleatório.
The seismic inverse problem involves determining the subsurface physical properties from data sampled at Earth`s surface. A mathematical model of the response of the subsurface excited by a seismic source, having physical properties as parameters, provides a synthetic model for this response. This makes possible to compare sampled and synthetic data. The perturbation in the model due to the variation of its parameters can approximate these data and states the inversion problem as the minimization of an error function that fits them adequately. Usually, the methods which attempt to minimize this error assume that a perturbation in the model is linearly relates with a perturbation in the measured response. Most geophysical inverse problems are highly nonlinear and are rife with local minima. Therefore these methods are very sensitive to the choice of the initial model and good starting solutions may not be available. What should be done, if there is no basis for an initial guess? The theory of Bayesian inference provides an answer to this question taking into account the prior information about the parameter space. The inverse problem can then be stated as an optimization problem whose goal is to maximize the posterior probability that the set of parameters has a certain value once given the result of the sample. This problem is solved by the Simulated Annealing method, a global optimization method that executes a oriented random search in the solution space. This method comes from an analogy between the physical annealing of solids and optimization problems. The Very Fast Simulated Annealing (VFSA), a variant of SA, is applied to the solution of 1 D seismic inverse problems generated synthetically by acoustic and alastic done by a elastic model with additive noise.

Style APA, Harvard, Vancouver, ISO itp.

12

Gelfand, Saul B. (Saul Brian). "Analysis of simulated annealing type algorithms". Thesis, Massachusetts Institute of Technology, 1987. http://hdl.handle.net/1721.1/14935.

Pełny tekst źródła

Streszczenie:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1987.
MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING
Bibliography: leaves 101-103.
by Saul B. Gelfand.
Ph.D.

Style APA, Harvard, Vancouver, ISO itp.

13

Nunes, Luís. "Monitoring networks optimization with simulated annealing". Doctoral thesis, Instituto Superior Técnico - Universidade Técnica de Lisboa, 2003. http://hdl.handle.net/10400.1/1160.

Pełny tekst źródła

Streszczenie:

Tese dout., Ciências de Engenharia, Instituto Superior Técnico, Universidade Técnica de Lisboa, 2003
In this work some methods to optimize environmental monitoring networks are proposed. These methods share simulated annealing as the approximation algorithm. Only monitoring networks reduction is treated here. Monitoring network optimization is a very actual problem given the large number of existing networks in many countries operating large numbers of stations, some of which may be redundant, with very high exploitation costs. Difficulties appear when exploitation costs pushes the dimension of a network towards a minimum, and the statistical reliability pushes in the opposite direction. Finding the optimal dimension may be a very difficult optimization problem due to the large number of combinations, even for small network dimensions. Further complications appear when the available data is too incomplete or come from different homogeneous areas. Some practical answers to these problems were sought in this work. Results showed that optimizing a monitoring network dimension and location of stations, without compromising the quality of the collected data, could attain large reductions in exploitation costs. Simulated annealing showed to be a very flexible and efficient algorithm.

Style APA, Harvard, Vancouver, ISO itp.

14

CHEN, TAO. "Multi-FPGA Partitioning Using Simulated Annealing". University of Cincinnati / OhioLINK, 2004. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1077766831.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

15

Shakoor, Arif. "Crop rotation planning using simulated annealing". Master's thesis, This resource online, 1995. http://scholar.lib.vt.edu/theses/available/etd-02232010-020018/.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

16

Chen, Tung-Sheng. "Simulated annealing in sonar track detection". Thesis, Monterey, California : Naval Postgraduate School, 1990. http://handle.dtic.mil/100.2/ADA241785.

Pełny tekst źródła

Streszczenie:

Thesis (M.S. in Electrical Engineering)--Naval Postgraduate School, December 1990.
Thesis Advisor(s): Lee, Chin-Hwa. Second Reader: Therrien, Charles W. "December 1990." Description based on title screen as viewed on April 02, 2010. DTIC Descriptor(s): Simulation, optimization, detection, sonar, edges, theses, sensitivity, noise, annealing, detectors DTIC Identifier(s): Sonar tracking, edge detectors, signal to noise ratio, combinatorial optimization, simulation. Author(s) subject terms: Simulated annealing, sonar track detection, combinatorial optimization Includes bibliographical references (p. 59). Also available in print.

Style APA, Harvard, Vancouver, ISO itp.

17

Seacat, Russell Holland III. "Parallelization of the simulated annealing algorithm". Diss., The University of Arizona, 1993. http://hdl.handle.net/10150/186551.

Pełny tekst źródła

Streszczenie:

Nuclear medicine imaging involves the introduction of a radiopharmaceutical into the body and the subsequent detection of the radiation emanating from the organ at which the procedure was directed. The data set resulting from such a procedure is generally very underdetermined, due to the dimensions of the imaging apparatus, and underconstrained due to the noise in the imaging process. A means by which more information can be obtained is through a form of imaging utilizing code-apertures. Although increasing the amount of information collected, coded-aperture imaging results in a multiplexing of the data. Demultiplexing the data requires a reconstruction process not required in conventional nuclear medicine imaging. The reconstruction process requires the optimization of an estimate to the object to be reconstructed. This optimization is done through the minimization of an energy functional. The minimization of such energy functionals requires the optimization of several parameters. Solution of this type problem is difficult because there are far too many degrees of freedom to permit an exhaustive search for an optimum, and in many cases no algorithms are known which will determine the exact optimum with significantly less work than exhaustive search. Instead, heuristic algorithms, such as the simulated annealing algorithm, have been employed and have proven effective in minimizing such energy functionals. Unfortunately, the simulated annealing algorithm, as characteristic of Monte Carlo algorithms, is very computer intensive; in fact, it is so intensive that insufficient computational power is often the chief hindrance to investigation of the algorithm. The simulated annealing algorithm, however, is amenable to parallel processing. The goal of the research in this dissertation is to investigate the parameters involved in implementing the simulated annealing algorithm in parallel; however, the form of the simulated annealing algorithm implemented here requires no annealing because the energy functionals investigated are quadratic in form. The parameters related to the parallelization of the simulated annealing algorithm include the decomposition of the reconstruction space among the processors, the formulation of the problem at the estimate level with the smallest task being a single perturbation trial evaluated on a local basis, and the communications required to keep all the processors as current as possible with changes made simultaneously to the estimate. Three objects, varying in size, shape and detail, are reconstructed utilizing the TRIMM parallel processor.

Style APA, Harvard, Vancouver, ISO itp.

18

Norgren, Eric, i Johan Jonasson. "Investigating a Genetic Algorithm-Simulated Annealing Hybrid Applied to University Course Timetabling Problem : A Comparative Study Between Simulated Annealing Initialized with Genetic Algorithm, Genetic Algorithm and Simulated Annealing". Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-186364.

Pełny tekst źródła

Streszczenie:

Every semester universities around the world have to create new schedules. This task can be very complex considering that a number of constraints has to be taken into account, e.g. there should not exist any timetable clashes for students and a room cannot be double-booked. This can be very hard and time-consuming for a human to do by hand, which is why methods to automate this problem, the University Course Timetabling Problem, has been researched for many years. This report investigates the performance of a hybrid consisting of Genetic Algorithm and Simulated Annealing when solving the University Course Timetabling Problem. An implementation by Yamazaki & Pertoft (2014) was used for the Genetic Algorithm. Simulated Annealing used the Genetic Algorithm as base for its implementation. The hybrid runs the Genetic Algorithm until some breakpoint, takes the best timetable and uses it as an initial solution for the Simulated Annealing. Our results show that our implementation of Simulated Annealing performs better than the hybrid and magnitudes better than the Genetic Algorithm. We believe one reason for this is that the dataset used was too simple, the Genetic Algorithm might scale better as the complexity of the dataset increases.

Style APA, Harvard, Vancouver, ISO itp.

19

Jonsson, Per-Axel. "Simulated Annealing : implementering mot integrerade analoga kretsar". Thesis, Linköping University, Department of Electrical Engineering, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-2531.

Pełny tekst źródła

Streszczenie:

Today electronics becomes more and more complex and to keep low costs and power consumption, both digital and analog parts are implemented on the same chip. The degree of automization for the digital parts have increased fast and is high, but for the analog parts this has not come through. This have created a big gap between the degrees of automization for the two parts and makes the analog parts the bottleneck in electronics develop.

Research is ongoing at Electronics systems group at Linköping University target the increase of design automization for analog circuits. An optimizationbased approach for device sizing is developed and for this a good optimization method is needed which can find good solutions and meet the specification parameters.

This report contains an evaluation of the optimization method Simulated Annealing. Many test runs have been made to find out good control parameters, both for Adaptiv Simulated Annealing (ASA) and a standard Simulated Annealing method. The result is discussed and all the data is in the enclosures. A popular science and mathematical description is given for Simulated Annealing as well.

Style APA, Harvard, Vancouver, ISO itp.

20

Bollinger, S. Wayne. "Processor and link assignment using simulated annealing". Thesis, Virginia Tech, 1988. http://hdl.handle.net/10919/43836.

Pełny tekst źródła

Streszczenie:

Advances in VLSI technology have made possible a new generation of multicomputer systems that contain hundreds or thousands of processors and offer a combined processing power far beyond that possible in a single processor machine. Multicomputers can be used to solve a variety of computationally intensive applications, but they introduce the problem of handling communication between concurrent processes. In the design of multicomputer systems, the scheduling and mapping of a parallel algorithm onto a host architecture has a critical impact on overall system performance. The problem of how to best assign the resources of a host multicomputer system to the cooperating tasks of a parallel application program is known as the mapping problem. In this research we develop a graph-based solution to both aspects of the mapping problem using the simulated annealing optimization heuristic. A two phase mapping strategy is formulated: I) process annealing assigns parallel processes to processing nodes, and 2) connection annealing schedules traffic connections on network data links so that interprocess communication conflicts are minimized. To evaluate the quality of generated mappings, cost functions suitable for simulated annealing are derived that accurately quantify communication overhead. Communication efficiency is formulated to measure the quality of assignments when the optimal mapping is unknown. Application examples are presented using the hypercube as a host architecture, with host graphs containing up to 512 nodes. The influence of various parameters on the annealing algorithms is investigated, and results for several image graphs are presented.
Master of Science

Style APA, Harvard, Vancouver, ISO itp.

21

Maziero, Edélcio Augusto. "Algoritmos Simulated Annealing em paralelo + Genético Grossover". Florianópolis, SC, 2003. http://repositorio.ufsc.br/xmlui/handle/123456789/85178.

Pełny tekst źródła

Streszczenie:

Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico. Programa de Pós-Graduação em Ciência da Computação.
Made available in DSpace on 2012-10-20T16:05:26Z (GMT). No. of bitstreams: 1 195928.pdf: 2356678 bytes, checksum: 164754abb834f5498d839239ae33e9d7 (MD5)
Problemas combinatorias são utilizados em muitas áreas de pesquisa, devido a sua simplicidade de compreensão e a sua aplicabilidade prática em vários domínios. Porém são intratáveis devido ao elevado tempo de processamento e de armazenamento de dados, sendo assim conhecidos e classificados como problemas NP-completos. Visando resolver estes problemas, diversos algoritmos têm sido propostos ao longo de vários anos de estudo, entre eles os Algoritmos Genéticos (AG) e o Algoritmo Simulated Annealing (SA). Estes algoritmos dão um tratamento polinomial aos problemas de otimização, buscando uma boa solução próxima a ótima em um tempo de processamento aceitável. Este trabalho concentra-se no estudo do AG e do SA aplicados ao clássico "Problema do Caixeiro Viajante". Propõe-se uma abordagem híbrida baseada no desenvolvimento do algoritmo SA em ambiente distribuído acrescido do operador "crossover" dos AG. A utilização em conjunto destas abordagens busca aumentar a potencialidade de obtenção de melhores resultados quando aplicados a problemas de otimização, sendo avaliado através de testes computacionais com instâncias públicas disponíveis via internet e instâncias construídas, também com suas soluções, conhecidas a priori.

Style APA, Harvard, Vancouver, ISO itp.

22

Moins, Stephane. "Implementation of a Simulated Annealing algorithm for Matlab". Thesis, Linköping University, Department of Electrical Engineering, 2002. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-1344.

Pełny tekst źródła

Streszczenie:

In this report we describe an adaptive simulated annealing method for sizing the devices in analog circuits. The motivation for use an adaptive simulated annealing method for analog circuit design are to increase the efficiency of the design circuit. To demonstrate the functionality and the performance of the approach, an operational transconductance amplifier is simulated. The circuit is modeled with symbolic equations that are derived automatically by a simulator.

Style APA, Harvard, Vancouver, ISO itp.

23

Parks, Kevin Preston. "Geosystem modeling with Markov chains and simulated annealing". Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape17/PQDD_0004/NQ31063.pdf.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

24

Velis, Danilo Rubén. "Application of simulated annealing to some seismic problems". Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape17/PQDD_0024/NQ34639.pdf.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

25

李銳華 i Yui-wah Lee. "Multi-stage simulated annealing for standard cell placement". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1992. http://hub.hku.hk/bib/B31210879.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

26

Xu, Kevin. "Maximum likelihood time-domain beamforming using simulated annealing". Thesis, Massachusetts Institute of Technology, 1999. http://hdl.handle.net/1721.1/80046.

Pełny tekst źródła

Streszczenie:

Thesis (S.M.)--Joint Program in Oceanographic Engineering (Massachusetts Institute of Technology, Dept. of Ocean Engineering; and the Woods Hole Oceanographic Institution), 1999.
Bibliography: p. 111-112.
by Kevin Xu.
S.M.

Style APA, Harvard, Vancouver, ISO itp.

27

Cheh, Kah Mun 1965, i Kah Mun 1965 Cheh. "The effect of neighborhood structure on simulated annealing". Thesis, The University of Arizona, 1989. http://hdl.handle.net/10150/277156.

Pełny tekst źródła

Streszczenie:

This thesis investigates the effect of neighborhood structure on simulated annealing, a random search algorithm that has the ability to search through a sequence of local optimal solutions and return the globally optimal solution. Neighborhood sizes of one, two, three, four and N (equal to the size of the problem) decision variable alterations have been experimentally tested on the following problem types: Quadratic Assignment problem; Quadratic Selection problem; Stochastic Optimization problem; and Traveling Salesman problem. Empirical results indicate that a smaller neighborhood size is better. However, for some instances, a neighborhood size of one larger than the smallest defined neighborhood size performed best.

Style APA, Harvard, Vancouver, ISO itp.

28

Barker, Daniel. "Simulated annealing in the search for phylogenetic trees". Thesis, University of Edinburgh, 2000. http://hdl.handle.net/1842/10326.

Pełny tekst źródła

Streszczenie:

I investigate use of the simulated annealing heuristic to seek phylogenetic trees judged optimal according to the principle of parsimony. I begin by looking into the central data structure in phylogenetic research, the tree. I discuss why it is usually necessary to employ a heuristic, rather than an exact method, when seeking parsimonious trees. I summarise different heuristic approaches. I explain how to use the program LVB, written to use simulated annealing in the search for parsimonious trees. I use LVB, with different combinations of values for parameters controlling the annealing search, to re-analyse two DNA sequence data matrices, one of 50 objects and one of 365 objects. Equations to estimate suitable control parameters, on the basis of desired run time and quality of result, are fitted to data obtained by these analyses. Future directions of research are discussed.

Style APA, Harvard, Vancouver, ISO itp.

29

Gu, Xiaoqing. "The behavior of simulated annealing in stochastic optimization". [Ames, Iowa : Iowa State University], 2008.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

30

Lee, Yui-wah. "Multi-stage simulated annealing for standard cell placement /". [Hong Kong] : University of Hong Kong, 1992. http://sunzi.lib.hku.hk/hkuto/record.jsp?B13447506.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

31

Schoner, Peter. "Operative Produktionsplanung in der verfahrenstechnischen Industrie". Kassel Kassel Univ. Press, 2008. http://d-nb.info/993587380/34.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

32

Nwana, Vincent Lebga. "Parallel algorithms for solving mixed integer linear programs". Thesis, Brunel University, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.368540.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

33

Martin, Shane L. "Merger analysis using a simulated annealing airline network model". Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file, 128 p, 2009. http://proquest.umi.com/pqdweb?did=1833625921&sid=2&Fmt=2&clientId=8331&RQT=309&VName=PQD.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

34

Qing, Shuping. "Optimal control for a CTMP process with simulated annealing". Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape4/PQDD_0030/MQ64246.pdf.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

35

Cosma, Ioana Ada. "Principle of detailed balance and simulated annealing convergence assessment". Thesis, McGill University, 2005. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=82210.

Pełny tekst źródła

Streszczenie:

Markov Chain Monte Carlo (MCMC) methods are employed to sample from a given distribution of interest, pi, where either pi does not exist in closed form, or, if it does, there exist no efficient methods to simulate an independent sample from it. MCMC methods create an ergodic Markov chain {Xn, n = 1, 2...} with stationary distribution pi such that as n tends to infinity, the distribution of Xn approaches pi. A wealth of diagnostic tools for convergence assessment of MCMC methods have been proposed, yet none has proved to be completely dependable and easy to implement. This thesis will review the literature on MCMC algorithms and diagnostic tools, and it will present a new convergence assessment method based on the principle of detailed balance. Moreover, the proposed diagnostic tool will be implemented as a stopping criterion for the optimization algorithm known as simulated annealing, which finds the global maximum or minimum of a function through an iterative improvement approach.

Style APA, Harvard, Vancouver, ISO itp.

36

Qing, Shuping 1969. "Optimal control for a CTMP process with simulated annealing". Thesis, McGill University, 1999. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=30270.

Pełny tekst źródła

Streszczenie:

In this thesis, a problem of optimal control for a CTMP(chemi-thermo-mechanical pulping) process is formulated and solved by applying simulated annealing algorithm.
Based on priori knowledge accumulated from years of practical operations, a set of imprecise and empirical equations are derived to give a description of a CTMP process. The system dynamics which is a key actor in this process control is also presented and analyzed. Due to the imprecise and highly nonlinear characteristic of this system, the need for a proper global optimization algorithm is highlighted.
The application of the simulated annealing algorithm is explored in cases of both the mainline and the whole process control. Comparisons of this method with some other optimization methods are characterized in general in terms of feasibility and accuracy. It is shown from experiments that although it is a time consuming algorithm, simulated annealing is suitable for decision making of process manipulations aiming at maximizing profit.
Finally, a PI feedback loop is implemented to fulfill this control scheme of the process. Then, with critical system disturbances and high degree process variance under control, an optimal control law is synthesized for the set-point tracking control policies. The controller performance is investigated at the simulation level.

Style APA, Harvard, Vancouver, ISO itp.

37

Chang, Yu-Lan, i 張幼蘭. "Dynamic Parallel Simulated Annealing". Thesis, 2002. http://ndltd.ncl.edu.tw/handle/82911533329644669579.

Pełny tekst źródła

Streszczenie:

碩士
國立清華大學
工業工程與工程管理學系
90
Tabu search, simulated annealing and genetic algorithms are commonly used heuristic search methods. People attempt to improve these methods to reduce computation time. Therefore, multiple processors computation platform using parallel searching algorithms have been used and studied in recent decades. One of the parallel simulated annealing algorithms is the clustering algorithm. The main idea of this method is to make each processor generate its own adjacent solution from the same current solution and compute the acceptance probability for each adjacent solution. Then, it decides which adjacent solution should replace the current solution according to pre-specified rules. The purpose of using clustering parallel simulated annealing is to find an acceptable adjacent solution quickly. However, we may find too many acceptable adjacent solutions, especially when temperature is high. It is wasteful to compute discarded acceptable adjacent solutions except the solution that is chosen to replace the current solution. Furthermore, simulated annealing somewhat lacks of diversified searching. We attempt to tackle this problem by using multiple processors to perform several simultaneously independent searching sequences at the same time, and later make them to turn to clustering mode at the time when computation process meet a certain criteria. Because the method we discuss allocates computing resource dynamically, we call it Dynamic Parallel Simulated Annealing Algorithms (DPSA).

Style APA, Harvard, Vancouver, ISO itp.

38

LIN, KE-RONG, i 林克容. "Track optimization using simulated evolution and simulated annealing". Thesis, 1989. http://ndltd.ncl.edu.tw/handle/80624787734628918655.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

39

Lin, Yi-Kuang, i 林益廣. "Orthogonal Simulated Annealing for Floorplanning". Thesis, 2002. http://ndltd.ncl.edu.tw/handle/ngwedr.

Pełny tekst źródła

Streszczenie:

碩士
逢甲大學
資訊工程所
90
Abstract Floorplanning is an essential step in physical design of VLSI. The floorplanning is how to place a set of circuit modules on a chip such that the resulting area is minimized. The best solutions are obtained using simulated annealing based on sequence pair representing the planning of modules. The used simulated annealing conducts a random perturbation operation on the current to generate a candidate solution for each iteration. This paper proposes an orthogonal simulated annealing algorithm which systematically generate a set of candidates containing a number of perturbation operations and consequently reason a good solution bases on orthogonal experimental design. Between experimental factors have lower interaction in an orthogonal experimental design, that have higher perform to consequently reason. So we analyze perturbation operations and design the appropriate perturbation operation for using an orthogonal simulated annealing algorithm. Results of experiments in the MCNC and GSRC benchmark show that our method can effective improve efficacy of current methods, especially in the lager floorplaning.

Style APA, Harvard, Vancouver, ISO itp.

40

SU, Hong Zoon, i 蘇鴻潤. "Parameters Setting in Simulated Annealing". Thesis, 1997. http://ndltd.ncl.edu.tw/handle/60434042122099829173.

Pełny tekst źródła

Streszczenie:

碩士
國立台灣工業技術學院
機械工程技術研究所
85
This thesis aims to study the effect of varied parameter setting in simulated annealing. These simulated annealing con- trol parameters comprise starting temperature, ending tempera- ture, temperature dropping pattern, maximum design changes and the decteasing pattern of maximum design change. The probability formula for the design change wuth an increased energy level is also studied. Formal statistical theory is used to derive the maximum traveling range under a given set of control paremeters. Based on anumber of control parameter settings, two types of for- mulas wstimating the average maximum traveling range, that is a function of two parameters, maximum design change and maximum iteration number, is developed. these estimation formulas ars examined in a number of illustrative problems.

Style APA, Harvard, Vancouver, ISO itp.

41

XU, DE-YING, i 徐德英. "PLA folding by simulated annealing". Thesis, 1989. http://ndltd.ncl.edu.tw/handle/99261238520267113846.

Pełny tekst źródła

Streszczenie:

碩士
中原大學
電子工程研究所
77
PLA （可程式化邏輯陣列）是超大型積體電路設計中的一種重要的佈圖結構方式，它可以降低開發成本，縮短設計的時間。但是，用PLA 設計的積體電路非常浪費晶片的面積，因此PLA摺疊（Folding）的方法被提出來，用以提高晶片面積的使用率。所謂 PLA 摺疊，是重新安排行及列的相對次序，使得兩條或多條之輸入或輸出線，摺疊成一行以減小晶片面積。然而，如何求得PLA 摺疊後最小的面積已經被證明了是一個NP -Complete 的問題。本篇的目的在利用模擬退火法來處理最一般化的PLA 摺疊的問題。本論文中完成了一個可程式化邏輯陣列摺疊的程式。在解這個PLA 摺疊的問題過程中採用了以Hachtel 等人所提出的圖論模式為基礎並加以改進，使它除了能處理簡單式的〞行〞後〞列〞的一維方向的PLA 摺疊外，也能處理多重PLA 摺疊的問題，同時並允許〞行〞後〞列〞的摺疊以任意交錯的順序進行，也就是二維式的多重行列混合式摺疊。程式求解的過程是以模擬退火法為基礎，為了做更有效的摺疊，在摺疊過程中，我們提供了拆解芋些不理想摺疊結果的方法。這種摺疊與拆解交互使用的方法在我們的圖論模式下都很容易的達成。程式的發展是在PC／AT相容性的機器上進行，所採用的語言為C 語言‧由實驗所做的許多例子，我們都能得到很好的結果。對於Hachtel 所提（２３．＋１９．）＊５２的例子不論在簡單或多重摺疊所得的結果都優於其它方法所得到面積。

Style APA, Harvard, Vancouver, ISO itp.

42

Lai, Yuan-Jung, i 賴苑榕. "Motion Estimation using Simulated Annealing". Thesis, 2008. http://ndltd.ncl.edu.tw/handle/39658888934347592104.

Pełny tekst źródła

Streszczenie:

碩士
義守大學
資訊工程學系碩士班
96
Motion estimation (ME) is an important part in the video compression system. Block-matching algorithm (BMA) is a popular method used in the motion estimation. However, the huge amount of computations of block-matching make ME the bottleneck in video encoding system. Many fast BMA have been proposed. Based on the assumption that the error surface is uni-modal, error function decreases monotonically when the search approaches the global minimum. The optimal solution could be found along the direction in which error function decreases. And the center-biased characteristic of motion vector (MV) distribution, search patterns can make efficient search. But, in real video applications that contained complicated motion, the assumption that error surface is uni-modal and the center-biased MV distribution is not suitable. Search pattern can be easily trapped into local minima in the error surface. This makes the degradation of video quality. Simulated annealing (SA) is a method that solves the global optimization problem. Based on the probabilistic concept of SA, search could avoid trapping into local minima. The combination of the search pattern which makes efficient search and SA is used in this study to achieve better video quality.

Style APA, Harvard, Vancouver, ISO itp.

43

嚴宗雄. "Self-Organization by Simulated Annealing". Thesis, 1997. http://ndltd.ncl.edu.tw/handle/31466087949372837069.

Pełny tekst źródła

Streszczenie:

碩士
國立東華大學
應用數學研究所
85
In this paper, a new self-organizing algorithm is developed by using the technique of simulated annealing. By following the Conwey's argument for the principle of self-organization, criteria for self-organizing task are defined and theoretically quantified to obtain an objective energyderived from the same energy function by using a hybrid relaxation method of gradient descent and mean field annealing. In pursuit of efficent computational models, we develop topology invariant operations on solution configurations of a self- organization task by analogy with the three elemetary operations in Knot theory. Relaxation of the energy function for a self-organization task can thus turn to operate in the way of simulated annealing. The resulting dimensing-reducing mappings posses a highly reliable topology preservation such that the nearby elements in the parameter space are ordered as similarly as possible on the cortex-like map. By the convenient implementation of the topology invariant operations in string manipulations on a sequential digital computer, the new self-organizing algorithm can efficiently generate a high reliable coherent map, of which the number of cortical points is more than 10000, in large scale. All numerical simulations use personal computers.

Style APA, Harvard, Vancouver, ISO itp.

44

Varanelli, James M. "On the acceleration of simulated annealing /". 1996. http://www.lib.virginia.edu/etd/diss/SEAS/ComputerScience/1996/1996_06.pdf.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

45

"Analysis of simulated annealing for optimization". Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, 1985. http://hdl.handle.net/1721.1/2900.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

46

"Convergence of the simulated annealing algorithm". Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, 1988. http://hdl.handle.net/1721.1/3084.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

47

Choong, Alexander. "Parallelizing Simulated Annealing Placement for GPGPU". Thesis, 2010. http://hdl.handle.net/1807/25456.

Pełny tekst źródła

Streszczenie:

Field Programmable Gate Array (FPGA) devices are increasing in capacity at an exponential rate, and thus there is an increasingly strong demand to accelerate simulated annealing placement. Graphics Processing Units (GPUs) offer a unique opportunity to accelerate this simulated annealing placement on a manycore architecture using only commodity hardware. GPUs are optimized for applications which can tolerate single-thread latency and so GPUs can provide high throughput across many threads. However simulated annealing is not embarrassingly parallel and so single thread latency should be minimized to improve run time. Thus it is questionable whether GPUs can achieve any speedup over a sequential implementation. In this thesis, a novel subset-based simulated annealing placement framework is proposed, which specifically targets the GPU architecture. A highly optimized framework is implemented which, on average, achieves an order of magnitude speedup with less than 1% degradation for wirelength and no loss in quality for timing on realistic architectures.

Style APA, Harvard, Vancouver, ISO itp.

48

LIN, JIAN-HONG, i 林建宏. "Module compaction based on simulated annealing". Thesis, 1990. http://ndltd.ncl.edu.tw/handle/01547226547375632281.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

49

Hsu, Chun-Hao, i 徐君豪. "Gloval Engineering Optimization by Simulated Annealing". Thesis, 1998. http://ndltd.ncl.edu.tw/handle/50922825235556042819.

Pełny tekst źródła

Streszczenie:

碩士
淡江大學
機械工程學系
86
In the actual engineering optimal design problems, it often requires getting global optimal solution and designing for discrete variables. In this paper, we have analyzed the theory of original Simulated Annealing method to deduce the ameliorative designing idea, and using the ameliorative Simulated Annealing method to strengthen the efficiency of the program, showing its quality of that we need. 　　At first, this paper aim at the original theory for more perfect programming process, strengthen transacting the constraint problems, and have more detail norm for terminal conditions, becoming ameliorative Simulated Annealing algorithm. Then according to Metropolis criteria, making a more exact judgement to the accept probability of optimal point, doesn''t waste time for needless computing, making the setting of initial and final temperature more reasonable, and for speeding the search efficiency. The other points strengthening of the algorithm include observing the search course forecast the presumable position of next point, and reducing the range of search powerfully, in the way of temperature decreasing. We want to simulate the actual drop in temperature more precisely, we adopt the fact speed of temperature decreasing at high temperature and slow at low temperature. The strategy is using exponent to be the function of temperature decreasing in our paper. So in general, this paper has many ways of research for increasing the efficiency of program. 　　In the multiple optimal problems, ameliorative Simulated Annealing program increasing the efficiency of program powerfully, it use more reasonable initial temperature and more exact search range, reducing the frequency of computing objective function, shortening the time of program execution. When it meets the problems which include mixed integer adn discete variables, our method can also provide the same algorithm, just change the formula of searching variables, then we can get the optimal result. Therefore ameliorative program have the general and simple principle. It is a method which have quite practicability.

Style APA, Harvard, Vancouver, ISO itp.

50

Chiang, Chien-Hua, i 江建樺. "Optimal Chiller Loading Using Simulated Annealing". Thesis, 2005. http://ndltd.ncl.edu.tw/handle/qu4myf.

Pełny tekst źródła

Streszczenie:

碩士
國立臺北科技大學
冷凍空調工程系所
93
The purpose of the Optimal Chiller Loading (OCL) is to meet the system load and to decide the chillers’ optimal part load ratios (PLR) to reduce the system power consumption. The optimal chiller loading methods include Average Loading (AVL) method, Largrangian Multiplier (LGM) method and Genetic Algorithm (GA) at present. These methods have some shortcomings. Such as AVL method being not optimal. LGM method will diverge if the initial condition isn’t suitable. GA procedure is complicated. In this paper, Simulated Annealing (SA) can overcome the above-mentioned shortcomings. It is a simple structure with the random algorithm consuming small memory space. Whether the objective function is continuous and differentiable or not, the SA algorithm is still applicable. This thesis use a cubic equation to simulate the chiller’s curve and to find a set of chiller output which doesn’t violate the operating limits while minimizing the objective function. The Simulated Annealing (SA) is adopted to find the near optimal solution of the function.

Style APA, Harvard, Vancouver, ISO itp.

Rozprawy doktorskie na temat „Simulated annealing”

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych