A constraint satisfaction programming approach for computing manufacturable stacking sequences

Sharif Hussein Sharif Zein

doi:10.1016/j.compstruc.2014.01.016

A constraint satisfaction programming approach for computing manufacturable stacking sequences

2014-05-01

24

PRE

AI

S

Sharif Hussein Sharif Zein *

DOI：10.1016/j.compstruc.2014.01.016

Original

Original request for help

Save

Abstract

En 中文

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. (C) 2014 Elsevier Ltd. All rights reserved.

Keywords:

Constraint satisfaction programming

Backtracking

Manufacturable composite structures

A constraint satisfaction programming approach for computing manufacturable stacking sequences

Abstract

Journal

Organization