Collaborative Manufacturing Unit Selection Using a Sorting Adaptive Genetic Algorithm in Networked Environment
In order to solve the collaborative manufacturing unit (CMU) selection problem in the networked cooperative manufacturing environment, a sorting adaptive genetic algorithm is proposed. To obtain the optimal executive manufacturing process, the objective function is constructed considering manufacturing cost and product load rate of candidate CMUs under time-sequence constraint. The embedded subtask scheduling procedure in sorting adaptive genetic algorithm is used to ascertain the penalty cost for the tardiness of the task. Finally, a case study is implemented to verify the feasibility of the proposed approach. The results show that the proposed model and algorithm can obtain satisfactory solutions.
Adaptive Genetic Algorithm Collaborative Manufacturing Unit Time-Sequence Constraint
CHENG Fangqi YE Feifan
Department of Mechatronics Zhejiang Business Technology Institute, Ningbo,315012, China Faculty of Engineering Ningbo University, Ningbo, 315211,China
国际会议
第九届加工技术进展国际会议(9th International Conference on Progress of Machining Technology)
昆明
英文
230-233
2009-04-25（万方平台首次上网日期，不代表论文的发表时间）