Search results for "simulated annealing"
showing 10 items of 63 documents
An Encoding in Metaheuristics for the Minimum Communication Spanning Tree Problem
2009
Problem-specific encodings can improve the performance of metaheuristics, such as genetic algorithms or simulated annealing. This paper studies the link-biased (LB) encoding, which is a tree representation, and applies metaheuristics using this encoding to the minimum communication spanning tree (MCST) problem. Given the communication requirements of the nodes, the MCST problem seeks a communication spanning tree with minimum total cost. Optimal solutions for MCST problems are similar to minimum spanning trees (MSTs), and the LB encoding exploits this property by encoding trees similar to MSTs with higher probability. The paper investigates how to systematically design problem-specific enc…
Packing a trunk - Now with a twist!
2005
In an industry project with a German car manufacturer we are faced with the challenge of placing a maximum number of uniform rigid rectangular boxes in the interior of a car trunk. The problem is of practical importance due to a European industry norm which requires car manufacturers to state the trunk volume according to this measure. No really satisfactory automated solution for this problem has been known in the past. In spite of its NP hardness, combinatorial optimization techniques, which consider only grid-aligned placements, produce solutions which are very close to the one achievable by a human expert in several hours of tedious work. The remaining gap is mostly due to the constrain…
GRASP and path relinking for the max–min diversity problem
2010
The max-min diversity problem (MMDP) consists in selecting a subset of elements from a given set in such a way that the diversity among the selected elements is maximized. The problem is NP-hard and can be formulated as an integer linear program. Since the 1980s, several solution methods for this problem have been developed and applied to a variety of fields, particularly in the social and biological sciences. We propose a heuristic method-based on the GRASP and path relinking methodologies-for finding approximate solutions to this optimization problem. We explore different ways to hybridize GRASP and path relinking, including the recently proposed variant known as GRASP with evolutionary p…
Simulated annealing with restrained molecular dynamics using CONGEN: Energy refinement of the NMR solution structures of epidermal and type-αtransfor…
1996
The new functionality of the program CONGEN (Bruccoleri RE, Karplus M, 1987, Biopolymers 26:137-168; Bassolino-Klimas D et al., 1996, Protein Sci 5:593-603) has been applied for energy refinement of two previously determined solution NMR structures, murine epidermal growth factor (mEGF) and human type-alpha transforming growth factor (hTGF alpha). A summary of considerations used in converting experimental NMR data into distance constraints for CONGEN is presented. A general protocol for simulated annealing with restrained molecular dynamics is applied to generate NMR solution structures using CONGEN together with real experimental NMR data. A total of 730 NMR-derived constraints for mEGF a…
Domain-Knowledge Optimized Simulated Annealing for Network-on-Chip Application Mapping
2013
Network-on-Chip architectures are scalable on-chip interconnection networks. They replace the inefficient shared buses and are suitable for multicore and manycore systems. This paper presents an Optimized Simulated Annealing (OSA) algorithm for the Network-on-Chip application mapping problem. With OSA, the cores are implicitly and dynamically clustered using knowledge about communication demands. We show that OSA is a more feasible Simulated Annealing approach to NoC application mapping by comparing it with a general Simulated Annealing algorithm and a Branch and Bound algorithm, too. Using real applications we show that OSA is significantly faster than a general Simulated Annealing, withou…
Statistical Reconstruction of Microstructures Using Entropic Descriptors
2018
We report a multiscale approach of broad applicability to stochastic reconstruction of multiphase materials, including porous ones. The approach devised uses an optimization method, such as the simulated annealing (SA) and the so-called entropic descriptors (EDs). For a binary pattern, they quantify spatial inhomogeneity or statistical complexity at discrete length-scales. The EDs extract dissimilar structural information to that given by two-point correlation functions (CFs). Within the SA, we use an appropriate cost function consisting of EDs or comprised of EDs and CFs. It was found that the stochastic reconstruction is computationally efficient when we begin with a preliminary synthetic…
Simulated Annealing in Bayesian Decision Theory
1992
Since the seminal paper by Kirkpatrick, Gelatt and Vechhi (1983), a number of papers in the scientific literature refer to simulated annealing as a powerful random optimization method which promises to deliver, within reasonable computing times, optimal or nearly optimal solutions to complex decision problems hitherto forbidding. The algorithm, which uses the physical process of annealing as a metaphor, is special in that, at each iteration, one may move with positive probability to solutions with higher values of the function to minimize, rather than directly jumping to the point with the smallest value within the neighborhood, thus drastically reducing the chances of getting trapped in lo…
Homology modeling of an RNP domain from a human RNA-binding protein: Homology-constrained energy optimization provides a criterion for distinguishing…
1998
We have recently described an automated approach for homology modeling using restrained molecular dynamics and simulated annealing procedures (Li et al, Protein Sci., 6:956-970,1997). We have employed this approach for constructing a homology model of the putative RNA-binding domain of the human RNA-binding protein with multiple splice sites (RBP-MS). The regions of RBP-MS which are homologous to the template protein snRNP U1A were constrained by "homology distance constraints," while the conformation of the non-homologous regions were defined only by a potential energy function. A full energy function without explicit solvent was employed to ensure that the calculated structures have good …
SAMSLAM: Simulated Annealing Monocular SLAM
2013
This paper proposes a novel monocular SLAM approach. For a triplet of successive keyframes, the approach inteleaves the registration of the three 3D maps associated to each image pair in the triplet and the refinement of the corresponding poses, by progressively limiting the allowable reprojection error according to a simulated annealing scheme. This approach computes only local overlapping maps of almost constant size, thus avoiding problems of 3D map growth. It does not require global optimization, loop closure and back-correction of the poses.
Parallel Simulated Annealing: Getting Super Linear Speedups
2005
The study described in this paper tries to improve and combine different approaches that are able to speed up applications of the Simulated Annealing model. It investigates separately two main aspects concerning the degree of parallelism an implementation can egectively exploit at the initial andfinal periods of an execution. As for case studies, it deals with two implementations: the Job shop Scheduling problem and the poryblio selection problem. The paper reports the results of a large number of experiments, carried out by means of a transputer network and a hypercube system. They give useful suggestions about selecting the most suitable values of the intervention parameters to achieve su…