Complexity Estimation for Genetic Assembly Sequence Planning

勤益科大機構典藏 > 管理學院 > 工業工程與管理系(所) > 【工業工程與管理系所】期刊論文 > Item 987654321/6289

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncut.edu.tw/handle/987654321/6289

题名:	Complexity Estimation for Genetic Assembly Sequence Planning
作者:	王文派
贡献者:	工業工程與(工程)管理系
日期:	2009-01
上传时间:	2017-10-02 14:09:02 (UTC+8)
摘要:	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)
關聯:	The Journal of the Chinese Institute of Industrial Engineers
显示于类别:	[工業工程與管理系(所)] 【工業工程與管理系所】期刊論文

文件中的档案:

没有与此文件相关的档案.

检视Licence

在NCUTIR中所有的数据项都受到原著作权保护.

数据加载中.....