Abstract
Manufacturing complex structures as planes requires the assembly of several pieces. The first step in the process is to align the pieces. This article is concerned with some mathematical and computational aspects of new algorithms devoted to the alignment of the pieces. We describe the properties of suitable algorithms to handle a non standard constrained optimization problem that occurs in the assembly process of a manufactured product. Then we present two kinds of algorithms: the first based on a fractional step algorithm and the second on a local search algorithm. We assess them on real cases and compare their results with an evolutionary algorithm for difficult non-linear or non-convex optimization problems in continuous domain.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
