Font Size: a A A

Research On Dynamic Assembly Sequence Optimization Of Mechanical Products Considering Station Change

Posted on:2020-04-24Degree:MasterType:Thesis
Country:ChinaCandidate:L Y ZhangFull Text:PDF
GTID:2381330599977258Subject:Industrial engineering
Abstract/Summary:PDF Full Text Request
In the assembly process of mechanical products,due to uncertainties such as personnel changes and equipment failures,the available stations are dynamically changed.The traditional methods are dynamically adjusted manually,and the adjustment is unreasonable.Based on this,this paper proposes an assembly sequence optimization method based on the dynamic change of available station numbers.The optimization method dynamically adjusts the assembly sequence by real-time detection of the change of available station numbers,thereby maximizing assembly line efficiency.In this paper,the dynamic assembly sequence optimization of single and multi-variety mechanical products is studied separately.The research contents are as follows:Firstly,the dynamic assembly sequence optimization of single-variety mechanical products was studied.Based on the analysis of uncertainty factors and assembly sequence optimization methods,this chapter studies how to dynamically optimize the assembly sequence based on station changes.In this study,it is assumed that the station status obeys the Bernoulli distribution,the station is unavailable and the recovery time both are subject to an exponential distribution.Based on the hypothesis,a dynamic optimization model for single-variety with maximum assembly line efficiency is established,and a dynamic optimization strategy based on the change of available stations is proposed.Secondly,the dynamic optimization strategy combines the improved ant colony algorithm with the allocation criteria.In order to solve the dynamic assembly sequence optimization problem of station change more efficiently,the improvement of the ant colony algorithm is mainly reflected in the solution process,through the dynamic optional set reduces the scope of the ant search node,constrains the ant to find the optimal path range and seeks a new optimal solution,which can speed up the search speed of the algorithm.Thirdly,on the basis of the above research,a multi-variety dynamic optimization research considering the change of the station is proposed.In order to meet the rapid market demand of mechanical products,a mathematical model for multi-variety assembly sequence optimization was established,and a dynamic assembly sequence optimization strategy for multiple varieties was proposed.In addition,based on multi-product assembly priority relationship transformation method and improved ant colony algorithm,a specific solution method for multi-variety dynamic optimization problem is obtained.Finally,taking a mechanical product assembly line as the research object,the case analysis of single-variety assembly and multi-variety dynamic assembly sequence optimization is carried out.By comparing and analyzing the optimization method of this paper and the solution result of the maximum candidate principle,the rationality of the model and the effectiveness of the algorithm are verified,and the application field of ant colony algorithm is extended,and it lays the foundation for the study of dynamic assembly sequence optimization considering station changes.This article contains a total of 20 figures,table18,reference 78.
Keywords/Search Tags:Uncertainty, Available Stations, Dynamic Assembly Sequence Optimization, Ant Colony Algorithm
PDF Full Text Request
Related items