Abstract

The solution of combinatorial optimization problems usually involves the consideration of many possible design configurations. This often makes such approaches computationally expensive, especially when dealing with complex finite element models. Here a surrogate model is proposed that can be used to reduce substantially the computational expense of sequential combinatorial finite element problems. The model is illustrated by application to a weld path planning problem.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.