UniSa - IRIS Institutional Research Information System
IRIS è la soluzione IT che facilita la raccolta e la gestione dei dati relativi alle attività e ai prodotti della ricerca. Fornisce a ricercatori, amministratori e valutatori gli strumenti per monitorare i risultati della ricerca, aumentarne la visibilità e allocare in modo efficace le risorse disponibili.
EnglishThermoset polymeric matrix composites (PMC) are often subjected to thermal cure cycles to improve the mechanical properties of the final product. The cycle design, i.e., the definition of the temperature-time curve, is a crucial issue for a competitive production. This paper deals with the simulation-based meta-heuristic optimisation of the thermal cure cycle of thick composite laminates. Optimisation routines have been coupled with a finite element thermochemical model of the process. Two optimisation procedures have been implemented and tested. The former is a combination of the Downhill simplex method with the simulated annealing algorithm; the latter is a genetic algorithm. In both cases, some variations to the original algorithms have been introduced to improve the efficiency of the optimisation procedure in relation to the problem examined.
| Titolo: | Composite laminates cure cycle optimisation by meta-heuristic algorithms | |
| Autori: | ||
| Data di pubblicazione: | 2013 | |
| Rivista: | ||
| Abstract: | Thermoset polymeric matrix composites (PMC) are often subjected to thermal cure cycles to improve the mechanical properties of the final product. The cycle design, i.e., the definition of the temperature-time curve, is a crucial issue for a competitive production. This paper deals with the simulation-based meta-heuristic optimisation of the thermal cure cycle of thick composite laminates. Optimisation routines have been coupled with a finite element thermochemical model of the process. Two optimisation procedures have been implemented and tested. The former is a combination of the Downhill simplex method with the simulated annealing algorithm; the latter is a genetic algorithm. In both cases, some variations to the original algorithms have been introduced to improve the efficiency of the optimisation procedure in relation to the problem examined. | |
| Handle: | http://hdl.handle.net/11386/4027257 | |
| Appare nelle tipologie: | 1.1.2 Articolo su rivista con ISSN |
File in questo prodotto:
http://hdl.handle.net/11386/4027257
Copyright © 2021