Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 140 for “"Annealing algorithm"”.
-
Parallelization of the simulated annealing algorithm.
… 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 …
-
A SIMULATED ANNEALING ALGORITHM FOR DETECTING MOVING TARGETS
… adopts a random search method called simulated annealing and customizes it to the unique setting of target tracking to obtain a sensor configuration that approximately maximizes the target detection probability, accounting for uncertainty in intelligence information. To evaluate the performance …
-
An efficient annealing algorithm for global optimization in Boltzmann machines
<p>This thesis proposes a new annealing algorithm for Boltzmann Machines. This algorithm uses an Exponential Formula for temperature scheduling that produces remarkably better solutions for global optimization. The superiority of the new algorithm is shown by computer simulations of several …
-
Modeling of a hardware VLSI placement system: Accelerating the Simulated Annealing algorithm
… or sheer compute effort required. Heuristic algorithms allow for efficient but sub-optimal designs to be produced with a reduction in processing time. A widely used algorithm is Simulated Annealing (SA). The goal of this work was to develop a model that would enable an analysis into the …
-
Protein Folding Implementation of the Simulated Annealing Algorithm on Simple Three-Dimensional Models
… fold. This thesis studies the use of simulated annealing optimization techniques to find low energy states in simple lattice and off-lattice models. A certain emphasis is placed upon looking for patterns in the results emerging. One simple off-lattice model and two lattice models are considered, …
-
Deterministic annealing algorithm: tutorial, application to pickup and delivery problem and computational aspects
The deterministic annealing (DA) method, used for the solution of several nonconvex problems, offers the ability to avoid shallow local minima of a given cost surface and the ability to minimize the cost function even when there are many local minima. The method is established in a probabilistic …
-
A Mathematical Model and a Simulated Annealing Algorithm for an Integrated Facility Layout and Cell Formation
… for large size problems, an efficient simulated annealing algorithm is developed. A number of numerical examples of different sizes are presented to demonstrate the nature of the proposed model. In addition, some empirical studies to demonstrate the computational behaviours of the proposed …
-
Characterizing the protein landscape in thylakoid membranes of Chlamydomonas reinhardtii using a Monte Carlo-simulated annealing algorithm
… employs coarse-grained modeling and advanced algorithms to simulate the distribution of major protein complexes, including PSII supercomplexes, cytb₆f, and LHCII. By systematically varying membrane size and protein composition, we analyzed protein organization using statistical methods such as …
-
Inverse Problem in Porous Medium Using Homogenization
… different pieces that work together. A simulated annealing algorithm is presented and coupled with an homogenization technique; together these solve the problem which was posed. Further, numerical simulation results are presented illustrating the use of the simulated annealing algorithm as well as …
-
Maksimalių klikų paieška naudojant vėsinimo imitaciją /
… the heuristic methods is known as the simulated annealing method. It is used to approximate the global optimum of the given function. Bachelor thesis main objective is to apply simulated annealing method for the clique enumeration problem. Tasks include: algorithm review, explanation of an …
-
An Inverse Approach to a Probability Model for Fractured Networks
… type of problem. This method uses the Simulated Annealing Algorithm in conjunction with a probability model which generates possible solutions based on a uniform random number list. The Annealing Algorithm generates a conditional probability distribution on all possible solutions generated by the …
-
Metaheuristics and machine learning for joint stratification and sample allocation in survey design
… the sampling frame is large, and the evaluation algorithm is computationally burdensome. To advance the research in this area, we explore and evaluate different algorithmic methods of modelling and solving this problem. Firstly, we propose a new genetic algorithm approach using "grouping" genetic …
-
Simulated annealing heuristics for the dynamic facility layout problem
… layout problem. In this thesis, three simulated annealing heuristics are presented for the dynamic facility layout problem. The first is the direct implementation of the simulated annealing algorithm. The second heuristic uses a reheating strategy within simulated annealing. The third heuristic …
-
Optical design by genetic algorithm
… and birefringent filters by using the genetic algorithm is studied in this thesis. A holographic diffuser is an optical device that distributes light from a light source with a desired spatial distribution pattern. For diffuse infrared wireless home networking, a holographic diffuser is used to …
-
Synthesis of Analogue Circuits
… and library cells to be adopted easily. An algorithm to synthesise analogue circuits from over-designed circuits is described in this thesis. The technique to select circuit topologies from over-designed circuits and to fine-tune the selected circuit is based on the Simulated Annealing …
-
Assessment and Redesign of the Synoptic Water Quality Monitoring Network in the Great Smoky Mountains National Park
… The spatial analysis employed a simulated annealing algorithm using the variable costs of the network and the results of multivariate data techniques to identify an optimized subset of the existing sampling sites based on a maximization of benefits. A second simulated annealing algorithm …
-
Agent based modelling of an emergency department and path planning optimization of a mobile real time location system
… using metaheuristic genetic and simulated annealing algorithms. A prototypical agent model for an emergency facility was created using AnyLogic simulation software. The emergency department model is outfitted with mRTLS using mobile, ceiling-mounted RFID readers. Path planning and resource …
Page 1 of 7