Complexity Estimation for Genetic Assembly Sequence Planning

NCUTIR > College of Management > Development of Industrial Engineering and Management > 【工業工程與管理系所】期刊論文 > Item 987654321/6319

Please use this identifier to cite or link to this item: http://ir.lib.ncut.edu.tw/handle/987654321/6319

Title:	Complexity Estimation for Genetic Assembly Sequence Planning
Authors:	曾懷恩
Contributors:	工業工程與(工程)管理系
Date:	2009-01
Issue Date:	2017-10-03 09:25:00 (UTC+8)
Abstract:	Assembly planning involves in determining a particular assembly priority from which associated restraint factors such as geometric features, assembly time, tools, and machines are taken into account of arranging a feasible assembly sequence based upon the planner's individual heuristics. Suchlike planning lately may implement genetic algorithms (GAs) to go towards the assembly sequence features of speed and flexibility. However, finding feasible solutions or even optimal solutions is arduous to identify the global optimal solution in a short period. The purpose of this paper essentially aims at establishing a complexity index for practitioners to decide what type of algorithm employed, namely traditional GAs, or ameliorative GAs like Guided-GAs. The threshold of the proposed complexity judgment is hinged on the square of preceding constraints and the quantity of nodes in the event. As the complexity increases the frequency of feasible solutions found did not exactly come up by traditional GAs. According to the proposed index assembly sequence problems are asserted more constraints comparatively while the complexity approaches to 70 or above. (22 refs)
Relation:	The Journal of the Chinese Institute of Industrial Engineers
Appears in Collections:	[Development of Industrial Engineering and Management] 【工業工程與管理系所】期刊論文

Files in This Item:

There are no files associated with this item.

View Licence

Loading...