首页 | 本学科首页   官方微博 | 高级检索  
     


A genetic algorithm for the optimisation of assembly sequences
Authors:Romeo M Marian  Lee HS Luong  Kazem Abhary
Affiliation:

aSchool of Advanced Manufacturing and Mechanical Engineering, University of South Australia, Mawson Lakes, SA 5095, Australia

Abstract:This paper describes a Genetic Algorithm (GA) designed to optimise the Assembly Sequence Planning Problem (ASPP), an extremely diverse, large scale and highly constrained combinatorial problem. The modelling of the ASPP problem, which has to be able to encode any industrial-size product with realistic constraints, and the GA have been designed to accommodate any type of assembly plan and component. A number of specific modelling issues necessary for understanding the manner in which the algorithm works and how it relates to real-life problems, are succinctly presented, as they have to be taken into account/adapted/solved prior to Solving and Optimising (S/O) the problem. The GA has a classical structure but modified genetic operators, to avoid the combinatorial explosion. It works only with feasible assembly sequences and has the ability to search the entire solution space of full-scale, unabridged problems of industrial size. A case study illustrates the application of the proposed GA for a 25-components product.
Keywords:Assembly sequence planning  Representation  Precedence relations  Genetic algorithms  Genetic operators  Combinatorial optimisation
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号