Local random search algorithm with worst priority for selective assembly

The invention discloses a worst-priority local random search algorithm for selective assembly, which comprises the following steps of: firstly, reading size information of parts from a database, storing the size information in a three-dimensional matrix, storing assembly information among the parts...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	LI BINGJIE, HOU XIRU, HOU KUN, LI ZHONG, NI QIFENG
Format:	Patent
Sprache:	chi ; eng
Schlagworte:	CALCULATING COMPUTING COUNTING ELECTRIC DIGITAL DATA PROCESSING PHYSICS
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!