Dissertations / Theses on the topic 'Simulated annealing'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Simulated annealing.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Araujo, Haroldo Alexandre de. "Algoritmo Simulated Annealing." Florianópolis, SC, 2001. http://repositorio.ufsc.br/xmlui/handle/123456789/80386.
Full textMade 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.
Sakhavat, Tamim, Haithem Grissa, and 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.
Full textThompson, J. M. "Examination scheduling using simulated annealing." Thesis, Swansea University, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.639229.
Full textNeil, John Paul. "Simulated annealing based datapath synthesis." Thesis, University of Edinburgh, 1994. http://hdl.handle.net/1842/12715.
Full textCevikbas, Safak Burak. "Visibility Based Prefetching With Simulated Annealing." Master's thesis, METU, 2008. http://etd.lib.metu.edu.tr/upload/12609324/index.pdf.
Full textFä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.
Full textQC 20100709
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.
Full textFaassen, Johannes [Verfasser]. "Voll datenparalleles Simulated Annealing / Johannes Faassen." Aachen : Shaker, 2003. http://d-nb.info/1179034473/34.
Full textWade, 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.
Full textZhou, Guobiao. "Finite time performance of simulated annealing." Thesis, Glasgow Caledonian University, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.358284.
Full textMENDONCA, 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.
Full textThe 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.
Gelfand, Saul B. (Saul Brian). "Analysis of simulated annealing type algorithms." Thesis, Massachusetts Institute of Technology, 1987. http://hdl.handle.net/1721.1/14935.
Full textMICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING
Bibliography: leaves 101-103.
by Saul B. Gelfand.
Ph.D.
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.
Full textIn 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.
CHEN, TAO. "Multi-FPGA Partitioning Using Simulated Annealing." University of Cincinnati / OhioLINK, 2004. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1077766831.
Full textShakoor, Arif. "Crop rotation planning using simulated annealing." Master's thesis, This resource online, 1995. http://scholar.lib.vt.edu/theses/available/etd-02232010-020018/.
Full textChen, Tung-Sheng. "Simulated annealing in sonar track detection." Thesis, Monterey, California : Naval Postgraduate School, 1990. http://handle.dtic.mil/100.2/ADA241785.
Full textThesis 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.
Seacat, Russell Holland III. "Parallelization of the simulated annealing algorithm." Diss., The University of Arizona, 1993. http://hdl.handle.net/10150/186551.
Full textNorgren, Eric, and 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.
Full textJonsson, 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.
Full textToday 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.
Bollinger, S. Wayne. "Processor and link assignment using simulated annealing." Thesis, Virginia Tech, 1988. http://hdl.handle.net/10919/43836.
Full textMaster of Science
Maziero, Edélcio Augusto. "Algoritmos Simulated Annealing em paralelo + Genético Grossover." Florianópolis, SC, 2003. http://repositorio.ufsc.br/xmlui/handle/123456789/85178.
Full textMade 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.
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.
Full textIn 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.
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.
Full textVelis, 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.
Full text李銳華 and 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.
Full textXu, Kevin. "Maximum likelihood time-domain beamforming using simulated annealing." Thesis, Massachusetts Institute of Technology, 1999. http://hdl.handle.net/1721.1/80046.
Full textBibliography: p. 111-112.
by Kevin Xu.
S.M.
Cheh, Kah Mun 1965, and Kah Mun 1965 Cheh. "The effect of neighborhood structure on simulated annealing." Thesis, The University of Arizona, 1989. http://hdl.handle.net/10150/277156.
Full textBarker, Daniel. "Simulated annealing in the search for phylogenetic trees." Thesis, University of Edinburgh, 2000. http://hdl.handle.net/1842/10326.
Full textGu, Xiaoqing. "The behavior of simulated annealing in stochastic optimization." [Ames, Iowa : Iowa State University], 2008.
Find full textLee, 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.
Full textSchoner, Peter. "Operative Produktionsplanung in der verfahrenstechnischen Industrie." Kassel Kassel Univ. Press, 2008. http://d-nb.info/993587380/34.
Full textNwana, 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.
Full textMartin, 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.
Full textQing, 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.
Full textCosma, 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.
Full textQing, 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.
Full textBased 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.
Chang, Yu-Lan, and 張幼蘭. "Dynamic Parallel Simulated Annealing." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/82911533329644669579.
Full text國立清華大學
工業工程與工程管理學系
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).
LIN, KE-RONG, and 林克容. "Track optimization using simulated evolution and simulated annealing." Thesis, 1989. http://ndltd.ncl.edu.tw/handle/80624787734628918655.
Full textLin, Yi-Kuang, and 林益廣. "Orthogonal Simulated Annealing for Floorplanning." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/ngwedr.
Full text逢甲大學
資訊工程所
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.
SU, Hong Zoon, and 蘇鴻潤. "Parameters Setting in Simulated Annealing." Thesis, 1997. http://ndltd.ncl.edu.tw/handle/60434042122099829173.
Full text國立台灣工業技術學院
機械工程技術研究所
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.
XU, DE-YING, and 徐德英. "PLA folding by simulated annealing." Thesis, 1989. http://ndltd.ncl.edu.tw/handle/99261238520267113846.
Full text中原大學
電子工程研究所
77
PLA (可程式化邏輯陣列)是超大型積體電路設計中的一種重要的佈圖結構方式,它 可以降低開發成本,縮短設計的時間。但是,用PLA 設計的積體電路非常浪費晶片的 面積,因此PLA摺疊(Folding)的方法被提出來,用以提高晶片面積的使用率。所謂 PLA 摺疊,是重新安排行及列的相對次序,使得兩條或多條之輸入或輸出線,摺疊成 一行以減小晶片面積。然而,如何求得PLA 摺疊後最小的面積已經被證明了是一個NP -Complete 的問題。本篇的目的在利用模擬退火法來處理最一般化的PLA 摺疊的問題 。 本論文中完成了一個可程式化邏輯陣列摺疊的程式。在解這個PLA 摺疊的問題過程中 採用了以Hachtel 等人所提出的圖論模式為基礎並加以改進,使它除了能處理簡單式的〞行〞後〞列〞 的一維方向的PLA 摺疊外,也能處理多重PLA 摺疊的問題,同時並允許〞行〞後〞列 〞的摺疊以任意交錯的順序進行,也就是二維式的多重行列混合式摺疊。 程式求解的過程是以模擬退火法為基礎,為了做更有效的摺疊,在摺疊過程中,我們 提供了拆解芋些不理想摺疊結果的方法。這種摺疊與拆解交互使用的方法在我們的圖 論模式下都很容易的達成。程式的發展是在PC/AT相容性的機器上進行,所採用的語 言為C 語言‧由實驗所做的許多例子,我們都能得到很好的結果。對於Hachtel 所提 (23.+19.)*52的例子不論在簡單或多重摺疊所得的結果都優於其它方法 所得到面積。
Lai, Yuan-Jung, and 賴苑榕. "Motion Estimation using Simulated Annealing." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/39658888934347592104.
Full text義守大學
資訊工程學系碩士班
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.
嚴宗雄. "Self-Organization by Simulated Annealing." Thesis, 1997. http://ndltd.ncl.edu.tw/handle/31466087949372837069.
Full text國立東華大學
應用數學研究所
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.
Varanelli, James M. "On the acceleration of simulated annealing /." 1996. http://www.lib.virginia.edu/etd/diss/SEAS/ComputerScience/1996/1996_06.pdf.
Full text"Analysis of simulated annealing for optimization." Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, 1985. http://hdl.handle.net/1721.1/2900.
Full text"Convergence of the simulated annealing algorithm." Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, 1988. http://hdl.handle.net/1721.1/3084.
Full textChoong, Alexander. "Parallelizing Simulated Annealing Placement for GPGPU." Thesis, 2010. http://hdl.handle.net/1807/25456.
Full textLIN, JIAN-HONG, and 林建宏. "Module compaction based on simulated annealing." Thesis, 1990. http://ndltd.ncl.edu.tw/handle/01547226547375632281.
Full textHsu, Chun-Hao, and 徐君豪. "Gloval Engineering Optimization by Simulated Annealing." Thesis, 1998. http://ndltd.ncl.edu.tw/handle/50922825235556042819.
Full text淡江大學
機械工程學系
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.
Chiang, Chien-Hua, and 江建樺. "Optimal Chiller Loading Using Simulated Annealing." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/qu4myf.
Full text國立臺北科技大學
冷凍空調工程系所
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.