Towards a conceptual design explorer using metamodeling approaches and constraint programming

Research output: Contribution to conferencePaper

15 Citations (Scopus)

Abstract

Constraint Programming (CP) is a promising technique for managing uncertainty in conceptual design. It provides efficient algorithms for reducing, as quickly as possible, the domains of the design and performance variables while complying to the engineering and performance constraints linking them. In addition, CP techniques are suitable to graphically represent 3D projections of the complete design space. This is a useful capability for a better understanding of the product concept's degrees of freedom and a valuable alternative to optimization based upon the construction of an arbitrary preference aggregation function. Unfortunately, one of the main impediments for using Constraint Programming on industrial problems of practical interest is that constraints must be represented by analytical equations, which is not the case of hard mechanical performances - such as meshing and finite element computations - that are usually obtained after lengthy simulations. We propose to use metamodeling techniques (MM) to generate approximated mathematical models of these analyses which can be employed directly within a CP environment, expanding the scope of CP to applications that previously could not be solved by CP due to the unavailability of analytical equations. We show that there is a tradeoff between the metamodel fidelity and the resulting CP constraint tractability. A strategy to find this compromise is presented. The case study of a combustion chamber design shows amazingly that the compromise is to favor the simplest and the coarsest first-order response surface model.

Original languageEnglish (US)
Pages605-614
Number of pages10
StatePublished - Dec 1 2003
Event2003 ASME Design Engineering Technical Conferences and Computers and Information in Engineering Conference - Chicago, IL, United States
Duration: Sep 2 2003Sep 6 2003

Other

Other2003 ASME Design Engineering Technical Conferences and Computers and Information in Engineering Conference
CountryUnited States
CityChicago, IL
Period9/2/039/6/03

Fingerprint

Metamodeling
Constraint Programming
Conceptual Design
Conceptual design
Combustion chambers
Agglomeration
Mathematical models
Aggregation Function
Programming Environments
Tractability
Response Surface
Meshing
Metamodel
Combustion
Fidelity
Linking
Efficient Algorithms
Trade-offs
Degree of freedom
Projection

All Science Journal Classification (ASJC) codes

  • Modeling and Simulation
  • Mechanical Engineering
  • Computer Science Applications
  • Computer Graphics and Computer-Aided Design

Cite this

Yannou, B., Simpson, T. W., & Barton, R. R. (2003). Towards a conceptual design explorer using metamodeling approaches and constraint programming. 605-614. Paper presented at 2003 ASME Design Engineering Technical Conferences and Computers and Information in Engineering Conference, Chicago, IL, United States.
Yannou, Bernard ; Simpson, Timothy William ; Barton, Russell Richard. / Towards a conceptual design explorer using metamodeling approaches and constraint programming. Paper presented at 2003 ASME Design Engineering Technical Conferences and Computers and Information in Engineering Conference, Chicago, IL, United States.10 p.
@conference{2b737d652f1a4129b55f60569ff019d7,
title = "Towards a conceptual design explorer using metamodeling approaches and constraint programming",
abstract = "Constraint Programming (CP) is a promising technique for managing uncertainty in conceptual design. It provides efficient algorithms for reducing, as quickly as possible, the domains of the design and performance variables while complying to the engineering and performance constraints linking them. In addition, CP techniques are suitable to graphically represent 3D projections of the complete design space. This is a useful capability for a better understanding of the product concept's degrees of freedom and a valuable alternative to optimization based upon the construction of an arbitrary preference aggregation function. Unfortunately, one of the main impediments for using Constraint Programming on industrial problems of practical interest is that constraints must be represented by analytical equations, which is not the case of hard mechanical performances - such as meshing and finite element computations - that are usually obtained after lengthy simulations. We propose to use metamodeling techniques (MM) to generate approximated mathematical models of these analyses which can be employed directly within a CP environment, expanding the scope of CP to applications that previously could not be solved by CP due to the unavailability of analytical equations. We show that there is a tradeoff between the metamodel fidelity and the resulting CP constraint tractability. A strategy to find this compromise is presented. The case study of a combustion chamber design shows amazingly that the compromise is to favor the simplest and the coarsest first-order response surface model.",
author = "Bernard Yannou and Simpson, {Timothy William} and Barton, {Russell Richard}",
year = "2003",
month = "12",
day = "1",
language = "English (US)",
pages = "605--614",
note = "2003 ASME Design Engineering Technical Conferences and Computers and Information in Engineering Conference ; Conference date: 02-09-2003 Through 06-09-2003",

}

Yannou, B, Simpson, TW & Barton, RR 2003, 'Towards a conceptual design explorer using metamodeling approaches and constraint programming' Paper presented at 2003 ASME Design Engineering Technical Conferences and Computers and Information in Engineering Conference, Chicago, IL, United States, 9/2/03 - 9/6/03, pp. 605-614.

Towards a conceptual design explorer using metamodeling approaches and constraint programming. / Yannou, Bernard; Simpson, Timothy William; Barton, Russell Richard.

2003. 605-614 Paper presented at 2003 ASME Design Engineering Technical Conferences and Computers and Information in Engineering Conference, Chicago, IL, United States.

Research output: Contribution to conferencePaper

TY - CONF

T1 - Towards a conceptual design explorer using metamodeling approaches and constraint programming

AU - Yannou, Bernard

AU - Simpson, Timothy William

AU - Barton, Russell Richard

PY - 2003/12/1

Y1 - 2003/12/1

N2 - Constraint Programming (CP) is a promising technique for managing uncertainty in conceptual design. It provides efficient algorithms for reducing, as quickly as possible, the domains of the design and performance variables while complying to the engineering and performance constraints linking them. In addition, CP techniques are suitable to graphically represent 3D projections of the complete design space. This is a useful capability for a better understanding of the product concept's degrees of freedom and a valuable alternative to optimization based upon the construction of an arbitrary preference aggregation function. Unfortunately, one of the main impediments for using Constraint Programming on industrial problems of practical interest is that constraints must be represented by analytical equations, which is not the case of hard mechanical performances - such as meshing and finite element computations - that are usually obtained after lengthy simulations. We propose to use metamodeling techniques (MM) to generate approximated mathematical models of these analyses which can be employed directly within a CP environment, expanding the scope of CP to applications that previously could not be solved by CP due to the unavailability of analytical equations. We show that there is a tradeoff between the metamodel fidelity and the resulting CP constraint tractability. A strategy to find this compromise is presented. The case study of a combustion chamber design shows amazingly that the compromise is to favor the simplest and the coarsest first-order response surface model.

AB - Constraint Programming (CP) is a promising technique for managing uncertainty in conceptual design. It provides efficient algorithms for reducing, as quickly as possible, the domains of the design and performance variables while complying to the engineering and performance constraints linking them. In addition, CP techniques are suitable to graphically represent 3D projections of the complete design space. This is a useful capability for a better understanding of the product concept's degrees of freedom and a valuable alternative to optimization based upon the construction of an arbitrary preference aggregation function. Unfortunately, one of the main impediments for using Constraint Programming on industrial problems of practical interest is that constraints must be represented by analytical equations, which is not the case of hard mechanical performances - such as meshing and finite element computations - that are usually obtained after lengthy simulations. We propose to use metamodeling techniques (MM) to generate approximated mathematical models of these analyses which can be employed directly within a CP environment, expanding the scope of CP to applications that previously could not be solved by CP due to the unavailability of analytical equations. We show that there is a tradeoff between the metamodel fidelity and the resulting CP constraint tractability. A strategy to find this compromise is presented. The case study of a combustion chamber design shows amazingly that the compromise is to favor the simplest and the coarsest first-order response surface model.

UR - http://www.scopus.com/inward/record.url?scp=1842760567&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=1842760567&partnerID=8YFLogxK

M3 - Paper

SP - 605

EP - 614

ER -

Yannou B, Simpson TW, Barton RR. Towards a conceptual design explorer using metamodeling approaches and constraint programming. 2003. Paper presented at 2003 ASME Design Engineering Technical Conferences and Computers and Information in Engineering Conference, Chicago, IL, United States.