Resumen
An algorithm is proposed to generate stacking sequences which comply with the requirements of the composite manufacturers. These rules are the blending and the design rules. The novelty of the proposed algorithm is that it can handle a general blending scheme, where a stacking sequence can be blended with other stacking sequences and it can also be the base of others. This algorithm can have two purposes: generating a manufacturable structure given the results of a preliminary design or defining a design space of a composite structure in a design process.
| Idioma original | English |
|---|---|
| Páginas (desde-hasta) | 56-63 |
| Número de páginas | 8 |
| Publicación | Computers and Structures |
| Volumen | 136 |
| DOI | |
| Estado | Published - may. 2014 |
| Publicado de forma externa | Sí |
ASJC Scopus Subject Areas
- Civil and Structural Engineering
- Modelling and Simulation
- General Materials Science
- Mechanical Engineering
- Computer Science Applications
Huella
Profundice en los temas de investigación de 'A constraint satisfaction programming approach for computing manufacturable stacking sequences'. En conjunto forman una huella única.Citar esto
Zein, S., Basso, P., & Grihon, S. (2014). A constraint satisfaction programming approach for computing manufacturable stacking sequences. Computers and Structures, 136, 56-63. https://doi.org/10.1016/j.compstruc.2014.01.016