Algorithms for Constrained Best-fit Alignment

Laure Devendeville, Serge Dumont, Olivier Goubet, Sylvain Lefebvre

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.


Keywords


Non convex constrained optimization problems; Steepest descent with projection algorithm and stochastic local search algorithm

Full Text:

PDF


DOI: http://dx.doi.org/10.26713%2Fjims.v5i2.180

eISSN 0975-5748; pISSN 0974-875X