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 38 for “"simulated annealing algorithm"”.

  1. Simulated annealing algorithm for customer-centric location routing problem

    … this problem: mathematical model and heuristic algorithm. The mathematical model obtains the optimal solution, but it has a limitation on the size of the problem due to the NP-hardness of the LRP. Therefore, we introduce three different variations of Simulated Annealing (SA) algorithm to solve …

    mit Repository record for Simulated annealing algorithm for customer-centric location routing problem (opens in a new tab)

  2. Improving Reliability in DNA based Computations with Applications to Cryptography

    … has been studied and approached using the simulated annealing algorithm. Several combinatorial constraints have been considered to optimize the DNA sequences so that they are resistant to false hybridizations during the computations. A cost function which captures the DNA design …

    ohiolink Repository record for Improving Reliability in DNA based Computations with Applications to Cryptography (opens in a new tab)

  3. 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 …

    cork Repository record for Metaheuristics and machine learning for joint stratification and sample allocation in survey design (opens in a new tab)

  4. Simulated annealing heuristics for the dynamic facility layout problem

    … facility 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 …

    wvu Repository record for Simulated annealing heuristics for the dynamic facility layout problem (opens in a new tab)

  5. An eigenvalue-based approach to the finite time behavior of simulated annealing

    … under which the finite time behavior of the simulated annealing for combinatorial optimization can be studied. We will use linear algebraic methods for this purpose. The simulated annealing algorithm will be modeled as a finite space, discrete time Markov chain which can then be represented …

    uiuc Repository record for An eigenvalue-based approach to the finite time behavior of simulated annealing (opens in a new tab)

  6. Managerial factors affecting aircraft maintenance : an agent based model and optimization with simulated annealing

    … efficacy. The model is then optimized using a simulated annealing algorithm. Input parameters were varied to ensure reliability and repeatability of results. The model's sensitivity, in terms of optimal input vector and results, were also tested across a variety of input parameters. Results …

    mit Repository record for Managerial factors affecting aircraft maintenance : an agent based model and optimization with simulated annealing (opens in a new tab)

  7. Static-task scheduling incorporating precedence constraints and deadlines in a heterogeneous-computing environment / Michael D Niedert

    … Nonetheless, the choice of a heuristic algorithm greatly affects the speed of solution. This work evaluates a greedy algorithm, an A* algorithm, and a simulated annealing algorithm applied to the heterogeneous scheduling problem with deadline and dependency constraints. Tradeoffs of …

    nps Repository record for Static-task scheduling incorporating precedence constraints and deadlines in a heterogeneous-computing environment / Michael D Niedert (opens in a new tab)

  8. Mdl-Based Band Selection and Adaptive Penalties for Hyperspectral Image Segmentation

    … parameters that must be chosen. An adaptive algorithm that chooses the penalty parameters to maximize the pseudo-likelihood (PL) of the current image was developed by Lakshmanan and Derin, but it uses a costly simulated-annealing algorithm. We use a decoupling argument to find simple, …

    uiuc Repository record for Mdl-Based Band Selection and Adaptive Penalties for Hyperspectral Image Segmentation (opens in a new tab)

  9. Calibration of a conceptual rainfall-runoff model using simulated annealing

    Simulated annealing (Kirkpatrick et al, 1983) is used to estimate the parameters of a mathematical model that predicts the water yield from a catchment. The calibration problem involves finding the global minimum of a multivariate function that has many extraneous local minima, a situation in which …

    edithcowan Repository record for Calibration of a conceptual rainfall-runoff model using simulated annealing (opens in a new tab)

  10. Patterns in the sequence context of protein disulfide bonds

    … of finding a conserved recognition site, a simulated annealing algorithm was implemented to divide a set of disulfide-bonded cysteines into two sets of cysteines with an average sequence environment that is as far from randomly-distributed as possible. No significant conserved patterns were …

    mit Repository record for Patterns in the sequence context of protein disulfide bonds (opens in a new tab)

  11. Diagnostic process monitoring with temporally uncertain models

    … against the process data is determined through a simulated annealing algorithm. The rankings of competing hypotheses in the monitor set is based on the distance of these template points from their expected temporal values, along with the area between the process data measurements and the value …

    mit Repository record for Diagnostic process monitoring with temporally uncertain models (opens in a new tab)

  12. Dual Constraint Problem Optimization Using A Natural Approach: Genetic Algorithm and Simulated Annealing

    … Broker (GRB). The GRB must use an optimization algorithm that returns an accurate result in a timely mam1er. The Genetic Algorithm and the Simulated Annealing algorithm can both be used to achieve this goal, although Simulated Annealing outperforms the Genetic Algorithm for use by the GRB. …

    unf Repository record for Dual Constraint Problem Optimization Using A Natural Approach: Genetic Algorithm and Simulated Annealing (opens in a new tab)

  13. Description and reconstruction of microscopic random heterogenous media in order to estimate macroscopic hydraulic functions

    … measured pore geometry. Different reconstruction algorithms were therefore applied. Similar structures were generated by using a Boolean model and a simulated annealing algorithm using both the Minkowski functionals and the interception length density distribution. The similarity refers to …

    heid-diss Repository record for Description and reconstruction of microscopic random heterogenous media in order to estimate macroscopic hydraulic functions (opens in a new tab)

  14. Multi-objective optimisation with financial applications

    … have been several multi-objective evolutionary algorithms that have been used to solve the portfolio optimisation problem in recent years. This thesis recounts the development of a new multi-objective evolutionary algorithm, Adaptive Cell Resolution Evolutionary Algorithm (ACREA), which has been …

    greenwich Repository record for Multi-objective optimisation with financial applications (opens in a new tab)

  15. A robotic hand that utilizes ergonomic evaluation as feedback to improve human robot collaboration in soldering applications

    … to optimize the RULA score using an adaptive simulated annealing algorithm to balance the exploration and exploitation phases of the optimization process. Initial testing indicates that the robot can consistently find positions which improve the RULA ranking by 24.6% of the measured range. …

    mit Repository record for A robotic hand that utilizes ergonomic evaluation as feedback to improve human robot collaboration in soldering applications (opens in a new tab)

  16. Conditional Quantile Estimation With Ordinal Data

    … estimation of probabilities, are addressed. The simulated annealing algorithm is used for the optimization. The proposed ordinal quantile regression method is demonstrated in a series of simulation studies and is applied to the data from the low birth weight study. Confidence intervals of the …

    south-carolina Repository record for Conditional Quantile Estimation With Ordinal Data (opens in a new tab)

  17. Solid-State Magic-Angle Spinning NMR Methods for Tensor Measurements and Protein Structure Refinement Using Chemical Shift Tensors

    … and used as a restraint class in the XPLOR-NIH simulated annealing algorithm. The addition of this restraint class substantially improved the precision (∼0.3 A backbone RMSD) and accuracy (∼1.1 A related to the crystal structure) of structure determination for GB1. These results …

    uiuc Repository record for Solid-State Magic-Angle Spinning NMR Methods for Tensor Measurements and Protein Structure Refinement Using Chemical Shift Tensors (opens in a new tab)

  18. Human-centered approaches to system level design with applications to desalination

    … The behavior of designers during a series of simulated design processes involving seawater reverse osmosis (SWRO) plants was observed. The experiments revealed that desalination knowledge seemed to lead to better performance, but the results also showed that subjects with limited desalination …

    mit Repository record for Human-centered approaches to system level design with applications to desalination (opens in a new tab)

Page 1 of 2