This paper describes a genetic algorithm that deals with the assembly plaizning problem. While iiiost usseriibly plaiiniiig systeiiis use a cut-set iiiethod to generate usseiiibly plans, we propose a new approach to this problem: we use a genetic algorithm that generates and evaluates asseinbly plans. This algorithm starts from a set of valid assenibly plans proposed by an expert of the product. This set is the iiiitinl popirlutiori of poteiitiril solutions. Each asseinbly plan is eiicoded into a chronimonie, to be iiianipulatecl by genetic operators. A reproduction process uses these operntors to prodiice new asseinbly plciiis fi-om "parents" assembly plans. An evalirntioii jiiiiction nricl a selection procedure retniii the best plans that expmid the popirlatioii and sene for new generations. This algorithrii can be used either to quickly generate a set of good assembly plans, or to search all the valid assembly yluiis of a procliict.

No abstract

No abstract

No abstract

No abstract

A method allowing a systematic generation of assembly plans for mechanical products is presented. It involves a product modelling that includes non-assembly relevant features like labelling, checking, etc. Assembly plans are represented by assembly trees and are produced through interactive software written in PROLOG. An analysis of assembly constraints is also presented with a distinction between operative constraints dealing with the feasibility of the operations involved in the different assembly plans and the strategic constraints dealing with the global structure of the plans. An automatic transformation of the resulting assembly plans into one or several precedence graphs is given as well as a generalization of the classic precedence graphs in precedence hypergraphs able to represent disjunctive precedence conditions.

No abstract

No abstract