Faster generation of feasible design points

Bernard Yannou, Faysal Moreno, Henri J. Thevenot, Timothy William Simpson

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Citations (Scopus)

Abstract

Design space exploration during conceptual design is an active research field. Most approaches generate a number of feasible design points (complying with the constraints) and apply graphical post-processing to visualize correlations between variables, the Pareto frontier or a preference structure among the design solutions. The generation of feasible design points is often a statistical (Monte Carlo) generation of potential candidates sampled within initial variable domains, followed by a verification of constraint satisfaction, which may become inefficient if the design problem is highly constrained since a majority of candidates that are generated do not belong to the (small) feasible solution space. In this paper, we propose to perform a preliminary analysis with Constraint Programming techniques that are based on interval arithmetic to dramatically prune the solution space before using statistical (Monte Carlo) methods to generate candidates in the design space. This method requires that the constraints are expressed in an analytical form. A case study involving truss design under uncertainty is presented to demonstrate that the computation time for generating a given number of feasible design points is greatly improved using the proposed method. The integration of both techniques provides a flexible mechanism to take successive design refinements into account within a dynamic process of design under uncertainty.

Original languageEnglish (US)
Title of host publicationProceedings of the ASME International Design Engineering Technical Conferences and Computers and Information in Engineering Conferences - DETC2005
Subtitle of host publication31st Design Automation Conference
Pages355-363
Number of pages9
StatePublished - Dec 1 2005
EventDETC2005: ASME International Design Engineering Technical Conferences and Computers and Information in Engineering Conference - Long Beach, CA, United States
Duration: Sep 24 2005Sep 28 2005

Publication series

NameProceedings of the ASME International Design Engineering Technical Conferences and Computers and Information in Engineering Conference - DETC2005
Volume2 A

Other

OtherDETC2005: ASME International Design Engineering Technical Conferences and Computers and Information in Engineering Conference
CountryUnited States
CityLong Beach, CA
Period9/24/059/28/05

Fingerprint

Conceptual design
Monte Carlo methods
Processing
Uncertainty

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this

Yannou, B., Moreno, F., Thevenot, H. J., & Simpson, T. W. (2005). Faster generation of feasible design points. In Proceedings of the ASME International Design Engineering Technical Conferences and Computers and Information in Engineering Conferences - DETC2005: 31st Design Automation Conference (pp. 355-363). (Proceedings of the ASME International Design Engineering Technical Conferences and Computers and Information in Engineering Conference - DETC2005; Vol. 2 A).
Yannou, Bernard ; Moreno, Faysal ; Thevenot, Henri J. ; Simpson, Timothy William. / Faster generation of feasible design points. Proceedings of the ASME International Design Engineering Technical Conferences and Computers and Information in Engineering Conferences - DETC2005: 31st Design Automation Conference. 2005. pp. 355-363 (Proceedings of the ASME International Design Engineering Technical Conferences and Computers and Information in Engineering Conference - DETC2005).
@inproceedings{4e3590edb24b4b2aae6c6de5f7c7e1bc,
title = "Faster generation of feasible design points",
abstract = "Design space exploration during conceptual design is an active research field. Most approaches generate a number of feasible design points (complying with the constraints) and apply graphical post-processing to visualize correlations between variables, the Pareto frontier or a preference structure among the design solutions. The generation of feasible design points is often a statistical (Monte Carlo) generation of potential candidates sampled within initial variable domains, followed by a verification of constraint satisfaction, which may become inefficient if the design problem is highly constrained since a majority of candidates that are generated do not belong to the (small) feasible solution space. In this paper, we propose to perform a preliminary analysis with Constraint Programming techniques that are based on interval arithmetic to dramatically prune the solution space before using statistical (Monte Carlo) methods to generate candidates in the design space. This method requires that the constraints are expressed in an analytical form. A case study involving truss design under uncertainty is presented to demonstrate that the computation time for generating a given number of feasible design points is greatly improved using the proposed method. The integration of both techniques provides a flexible mechanism to take successive design refinements into account within a dynamic process of design under uncertainty.",
author = "Bernard Yannou and Faysal Moreno and Thevenot, {Henri J.} and Simpson, {Timothy William}",
year = "2005",
month = "12",
day = "1",
language = "English (US)",
isbn = "079184739X",
series = "Proceedings of the ASME International Design Engineering Technical Conferences and Computers and Information in Engineering Conference - DETC2005",
pages = "355--363",
booktitle = "Proceedings of the ASME International Design Engineering Technical Conferences and Computers and Information in Engineering Conferences - DETC2005",

}

Yannou, B, Moreno, F, Thevenot, HJ & Simpson, TW 2005, Faster generation of feasible design points. in Proceedings of the ASME International Design Engineering Technical Conferences and Computers and Information in Engineering Conferences - DETC2005: 31st Design Automation Conference. Proceedings of the ASME International Design Engineering Technical Conferences and Computers and Information in Engineering Conference - DETC2005, vol. 2 A, pp. 355-363, DETC2005: ASME International Design Engineering Technical Conferences and Computers and Information in Engineering Conference, Long Beach, CA, United States, 9/24/05.

Faster generation of feasible design points. / Yannou, Bernard; Moreno, Faysal; Thevenot, Henri J.; Simpson, Timothy William.

Proceedings of the ASME International Design Engineering Technical Conferences and Computers and Information in Engineering Conferences - DETC2005: 31st Design Automation Conference. 2005. p. 355-363 (Proceedings of the ASME International Design Engineering Technical Conferences and Computers and Information in Engineering Conference - DETC2005; Vol. 2 A).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Faster generation of feasible design points

AU - Yannou, Bernard

AU - Moreno, Faysal

AU - Thevenot, Henri J.

AU - Simpson, Timothy William

PY - 2005/12/1

Y1 - 2005/12/1

N2 - Design space exploration during conceptual design is an active research field. Most approaches generate a number of feasible design points (complying with the constraints) and apply graphical post-processing to visualize correlations between variables, the Pareto frontier or a preference structure among the design solutions. The generation of feasible design points is often a statistical (Monte Carlo) generation of potential candidates sampled within initial variable domains, followed by a verification of constraint satisfaction, which may become inefficient if the design problem is highly constrained since a majority of candidates that are generated do not belong to the (small) feasible solution space. In this paper, we propose to perform a preliminary analysis with Constraint Programming techniques that are based on interval arithmetic to dramatically prune the solution space before using statistical (Monte Carlo) methods to generate candidates in the design space. This method requires that the constraints are expressed in an analytical form. A case study involving truss design under uncertainty is presented to demonstrate that the computation time for generating a given number of feasible design points is greatly improved using the proposed method. The integration of both techniques provides a flexible mechanism to take successive design refinements into account within a dynamic process of design under uncertainty.

AB - Design space exploration during conceptual design is an active research field. Most approaches generate a number of feasible design points (complying with the constraints) and apply graphical post-processing to visualize correlations between variables, the Pareto frontier or a preference structure among the design solutions. The generation of feasible design points is often a statistical (Monte Carlo) generation of potential candidates sampled within initial variable domains, followed by a verification of constraint satisfaction, which may become inefficient if the design problem is highly constrained since a majority of candidates that are generated do not belong to the (small) feasible solution space. In this paper, we propose to perform a preliminary analysis with Constraint Programming techniques that are based on interval arithmetic to dramatically prune the solution space before using statistical (Monte Carlo) methods to generate candidates in the design space. This method requires that the constraints are expressed in an analytical form. A case study involving truss design under uncertainty is presented to demonstrate that the computation time for generating a given number of feasible design points is greatly improved using the proposed method. The integration of both techniques provides a flexible mechanism to take successive design refinements into account within a dynamic process of design under uncertainty.

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

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

M3 - Conference contribution

SN - 079184739X

T3 - Proceedings of the ASME International Design Engineering Technical Conferences and Computers and Information in Engineering Conference - DETC2005

SP - 355

EP - 363

BT - Proceedings of the ASME International Design Engineering Technical Conferences and Computers and Information in Engineering Conferences - DETC2005

ER -

Yannou B, Moreno F, Thevenot HJ, Simpson TW. Faster generation of feasible design points. In Proceedings of the ASME International Design Engineering Technical Conferences and Computers and Information in Engineering Conferences - DETC2005: 31st Design Automation Conference. 2005. p. 355-363. (Proceedings of the ASME International Design Engineering Technical Conferences and Computers and Information in Engineering Conference - DETC2005).