Search results for "Annealing"

Design of the Tube Roll Forming Process Through an Heuristic Algorithm

2002

In the paper the design of an industrial tube roll forming process is developed utilizing an heuristic algorithm, namely the simulated annealing (SA). In particular both the number and the shape of the deforming rolls are determined in order to define the forming sequence. The effectiveness of the results supplied by the SA algorithm is verified both by means of some experiments tests carried out on an industrial tube roll forming equipment and through a set of numerical simulations of the process.

Fast solution of radial distribution networks with automated compensation and reconfiguration

2000

Abstract Optimal operation of radial distribution networks with automated compensation and reconfiguration requires the solution of a combinatorial optimisation problem, since the variables are the on/off status of capacitor banks and the open/close status of tie-switches. The solution approaches recently proposed use iterative algorithms such as genetic algorithms, simulated annealing and tabu search, for which the network needs to be solved in different configurations and at different compensation levels. The aim of this evaluation is that of attributing a quality index to each solution so that all the solutions can be suitably ordered. In an automated network, any configuration can be ob…

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…

Mechanism of formation of char coating in LDPE/organoclay nanocomposites

2009

Characterization of annealed LDPE/clay nanocomposites

2009

The effect of Annealing Conditions on the Impedance and on the Photoelectrochemical behavior of TiO2 Nanotubes

2015

Titanium oxide nanotubes (NTs) have attracted much attention during last decade due to their special characteristics such as one-dimensional highly ordered geometry with large surface area and good chemical and optical stability.

Multiscale Approach in Studying the Influence of Annealing Conditions on Conductivity of TiO2 Nanotubes

2015

Titanium oxide nanotubes (NTs) have attracted much attention during last decade due to their special characteristics such as one-dimensional highly ordered geometry with large surface area and good chemical and optical stability.

Simulated Annealing Technique for Fast Learning of SOM Networks

2011

The Self-Organizing Map (SOM) is a popular unsupervised neural network able to provide effective clustering and data visualization for multidimensional input datasets. In this paper, we present an application of the simulated annealing procedure to the SOM learning algorithm with the aim to obtain a fast learning and better performances in terms of quantization error. The proposed learning algorithm is called Fast Learning Self-Organized Map, and it does not affect the easiness of the basic learning algorithm of the standard SOM. The proposed learning algorithm also improves the quality of resulting maps by providing better clustering quality and topology preservation of input multi-dimensi…

Fast Training of Self Organizing Maps for the Visual Exploration of Molecular Compounds

2007

Visual exploration of scientific data in life science\ud area is a growing research field due to the large amount of\ud available data. The Kohonen’s Self Organizing Map (SOM) is\ud a widely used tool for visualization of multidimensional data.\ud In this paper we present a fast learning algorithm for SOMs\ud that uses a simulated annealing method to adapt the learning\ud parameters. The algorithm has been adopted in a data analysis\ud framework for the generation of similarity maps. Such maps\ud provide an effective tool for the visual exploration of large and\ud multi-dimensional input spaces. The approach has been applied\ud to data generated during the High Throughput Screening\ud of mo…

The egoistic approach to parallel process migration into heterogeneous workstation network

1996

Abstract A new approach to the allocation of processes in a distributed system is discussed. The proposed solution deals with process migration into heterogeneous systems by means of a strategy that delegates the individual parallel applications to manage the migration of their processes by themselves, on the basis of their own performance objectives. This approach is discussed in opposition to the global scheduling based one, and the load balancing objective is pursued as an effect of the optimization of individual applications. A new performance evaluation criterion is introduced that consists in monitoring the delays that occur when two parallel processes run towards a common synchroniza…