Search results for "simulated annealing"
showing 10 items of 63 documents
Integrating Cross-Dominance Adaptation in Multi-objective Memetic Algorithms
2008
This chapter proposes a novel adaptive memetic approach for solving multi-objective optimization problems. The proposed approach introduces the novel concept of crossdominance and employs this concept within a novel probabilistic scheme which makes use of the Wigner distribution for performing coordination of the local search. Thus, two local searchers are integrated within an evolutionary framework which resorts to an evolutionary algorithm previously proposed in literature for solving multi-objective problems. These two local searchers are a multi-objective version of simulated annealing and a novel multi-objective implementation of the Rosenbrock algorithm.
AN OBJECT ORIENTED MODEL FOR SCHEDULING IN AGILE MANUFACTURING
2002
Agility represents a key factor in industry to handle the continuous market changes. Companies must re-organize their activities to be agile and competitive in such a dynamic environment. In particular, production planning and control tools are very important to optimize the manufacturing process responsiveness to sudden changes in customer demand. In this paper, an attempt has been made to develop an object-oriented software architecture that allows the optimal line organization to be determined once a set of parts to be produced has been ordered. An optimization module represented by a simulated annealing algorithm has been interfaced with an object oriented architecture to build up a fr…
An enhanced memetic differential evolution in filter design for defect detection in paper production.
2008
This article proposes an Enhanced Memetic Differential Evolution (EMDE) for designing digital filters which aim at detecting defects of the paper produced during an industrial process. Defect detection is handled by means of two Gabor filters and their design is performed by the EMDE. The EMDE is a novel adaptive evolutionary algorithm which combines the powerful explorative features of Differential Evolution with the exploitative features of three local search algorithms employing different pivot rules and neighborhood generating functions. These local search algorithms are the Hooke Jeeves Algorithm, a Stochastic Local Search, and Simulated Annealing. The local search algorithms are adap…
A parallel simulated annealing approach to the K shortest loopless paths problem
1997
The k shortest loopless paths problem is a significant combinatorial problem which arises in many contexts. When the size of the networks is very large the exact algorithms fail to find the best solution in a reasonable time. The aim of this paper is to suggest parallel efficient algorithms to obtain a good approximation of the solution to the k shortest loopless paths problem between two arbitrary nodes, when the network size is large. The heuristic used is known in literature as Simulated Annealing. Preliminary tests have been conducted for evaluating the validity of the proposed algorithms. The quality of the obtained results represents a significant base for further experimentations.
Brief communication: Vehicle routing problem and UAV application in the post-earthquake scenario
2017
Abstract. In this paper we simulate a Unmanned Aerial Vehicle's (UAV) recognition after a possible case of diffuse damage after a seismic event in the town of Acireale (Sicily, Italy). Given a set of sites (84 relevant buildings) and the range of the UAV, we are able to find the number of vehicles to employ and the shortest survey path. The problem of finding the shortest survey path is an operational research problem called Vehicle Routing Problem (VRP) whose solution is known to be computationally time-consuming. We used the Simulated Annealing (SA) heuristic that is able to provide stable solutions in relatively short computing time. We also examined the distribution of the cost of the s…
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 …
Flexible Spare Core Placement in Torus Topology based NoCs and its validation on an FPGA
2021
In the nano-scale era, Network-on-Chip (NoC) interconnection paradigm has gained importance to abide by the communication challenges in Chip Multi-Processors (CMPs). With increased integration density on CMPs, NoC components namely cores, routers, and links are susceptible to failures. Therefore, to improve system reliability, there is a need for efficient fault-tolerant techniques that mitigate permanent faults in NoC based CMPs. There exists several fault-tolerant techniques that address the permanent faults in application cores while placing the spare cores onto NoC topologies. However, these techniques are limited to Mesh topology based NoCs. There are few approaches that have realized …
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…