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.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.