【摘要】：本文結(jié)合國(guó)家863課題和浙江省重大科技攻關(guān)項(xiàng)目,系統(tǒng)分析和總結(jié)了灌裝輸送線產(chǎn)品設(shè)計(jì)方法特點(diǎn),為該類產(chǎn)品尋求一種快速設(shè)計(jì)和優(yōu)化方法。對(duì)面向灌裝輸送線的快速設(shè)計(jì)模型、輸送線的設(shè)備快速選擇方法、緩沖區(qū)容量分配方法、快速布局設(shè)計(jì)與優(yōu)化方法等方面進(jìn)行了研究,為灌裝輸送線制造企業(yè)實(shí)現(xiàn)灌裝輸送線快速設(shè)計(jì)與制造,縮短輸送線交付期,降低輸送線設(shè)計(jì)與制造成本等提供堅(jiān)實(shí)的理論基礎(chǔ)和方法指導(dǎo)。在分析了灌裝輸送線設(shè)計(jì)問(wèn)題的基礎(chǔ)上,闡明了灌裝輸送線快速設(shè)計(jì)研究的目標(biāo)和具有的重要意義。論述了灌裝輸送線快速設(shè)計(jì)理論、布局設(shè)計(jì)理論、緩沖區(qū)分配優(yōu)化理論、集成化產(chǎn)品建模等關(guān)鍵技術(shù)的國(guó)內(nèi)外研究現(xiàn)狀,給出了本文的主要研究?jī)?nèi)容和組織結(jié)構(gòu)。針對(duì)灌裝輸送線快速設(shè)計(jì)問(wèn)題,分析了傳統(tǒng)灌裝輸送線設(shè)計(jì)的不足,并給出灌裝輸送線設(shè)計(jì)流程和灌裝輸送線快速設(shè)計(jì)需要解決的關(guān)鍵問(wèn)題。然后對(duì)面向灌裝輸送線的集成模型技術(shù)進(jìn)行了探討。在以上基礎(chǔ)上提出面向灌裝輸送線的快速設(shè)計(jì)方法體系,為后續(xù)的深入研究奠定了基礎(chǔ)。根據(jù)灌裝輸送線的特點(diǎn),首先對(duì)輸送線設(shè)備選擇問(wèn)題進(jìn)行分析,對(duì)生產(chǎn)線節(jié)拍以及平衡率進(jìn)行求解,然后建立了灌裝輸送線設(shè)備成本模型。提出了一個(gè)基于粒子群優(yōu)化算法的灌裝輸送線設(shè)備選擇方法,并對(duì)案例進(jìn)行了分析。針對(duì)灌裝輸送線緩沖區(qū)容量分配問(wèn)題,基于混合馬爾可夫過(guò)程建模和一種多設(shè)備聚集方法,提出了建立系統(tǒng)生產(chǎn)率與各設(shè)備加工能力、可靠性和設(shè)備間緩沖區(qū)容量關(guān)系模型的方法。提出了在緩沖區(qū)容量總量有限的約束條件下,以系統(tǒng)生產(chǎn)率最高為優(yōu)化目標(biāo),提出了一種基于粒子群優(yōu)化算法的緩沖區(qū)容量分配方法;以緩沖區(qū)總量最小為優(yōu)化目標(biāo),以滿足生產(chǎn)率需求為約束,提出了基于外部為二分搜索算法,內(nèi)部為粒子群算法的混合啟發(fā)式算法的緩沖區(qū)容量分配優(yōu)化方法。針對(duì)灌裝輸送線布局設(shè)計(jì),研究了面向灌裝輸送線快速布局設(shè)計(jì)方法,建立了初始布局的生成方法。然后建立設(shè)備以及車間和輸送段的布局模型。以輸送線設(shè)計(jì)制造成本最低和規(guī)則程度最高為優(yōu)化目標(biāo),設(shè)備間隔和輸送線間隔等為約束關(guān)系,提出了基于差異演化算法的灌裝輸送線布局設(shè)計(jì)優(yōu)化方法。最后研究了灌裝輸送線快速設(shè)計(jì)平臺(tái)技術(shù),通過(guò)結(jié)構(gòu)設(shè)計(jì)和裝配設(shè)計(jì)產(chǎn)生三維布局圖和裝配圖,研究了裝配體的自動(dòng)生成方法。其次開(kāi)發(fā)了一套面向灌裝輸送線的快速設(shè)計(jì)原型系統(tǒng)。介紹了軟件平臺(tái)的總體結(jié)構(gòu)及功能組成,給出了運(yùn)行實(shí)例,驗(yàn)證了所作研究的有效性。
[Abstract]:Based on the national 863 project and the key science and technology project in Zhejiang province, this paper systematically analyzes and summarizes the characteristics of the product design method for filling conveyor line, and seeks a rapid design and optimization method for this kind of product. The rapid design model, equipment selection method, buffer capacity allocation method, fast layout design and optimization method for filling conveyor line are studied. It provides a solid theoretical basis and method guidance for filling conveyor line manufacturing enterprises to realize rapid design and manufacture of filling conveying line, shorten delivery period of conveying line and reduce the cost of design and manufacture of conveying line. Based on the analysis of the design problem of filling conveyor line, this paper expounds the objective and significance of the research on the rapid design of filling conveyor line. The research status of the key technologies such as rapid design theory, layout design theory, buffer allocation optimization theory, integrated product modeling and other key technologies are discussed. The main research contents and organization structure of this paper are given. Aiming at the problem of fast design of filling conveyor line, this paper analyzes the deficiency of traditional filling conveying line design, and gives the design flow of filling conveying line and the key problems to be solved in the rapid design of filling conveying line. Then the integrated model technology for filling conveyor line is discussed. On the basis of the above, a rapid design method system for filling conveyor line is put forward, which lays a foundation for further research. According to the characteristics of filling conveyor line, the selection of conveying line equipment is analyzed firstly, the rhythm and balance rate of the production line are solved, and then the cost model of filling conveying line equipment is established. A method based on particle swarm optimization (PSO) for equipment selection of filling conveyor line is proposed, and the case is analyzed. Based on hybrid Markov process modeling and a multi-equipment aggregation method, the system productivity and the processing capacity of each equipment are established to solve the problem of buffer capacity allocation in filling and conveying line, which is based on the hybrid Markov process modeling and multi-equipment aggregation method. A method to model the relationship between reliability and buffer capacity between devices. In this paper, a buffer capacity allocation method based on particle swarm optimization algorithm is proposed, which is based on particle swarm optimization (PSO) under the constraint of limited buffer capacity and taking the maximum productivity of the system as the optimization objective. A buffer capacity allocation optimization method for hybrid heuristic algorithm based on external binary search algorithm and internal particle swarm optimization (PSO) algorithm is proposed based on the minimum total buffer size and the constraint of satisfying productivity requirements. Aiming at the layout design of filling conveyor line, the rapid layout design method for filling conveyor line is studied, and the generating method of initial layout is established. Then the layout model of the equipment and workshop and conveying section is established. Taking the lowest cost and the highest rule degree of the design and manufacture of the conveying line as the optimization objective and the constraint relation of the equipment interval and the conveying line interval, the optimization method of the filling conveyor line layout design based on the differential evolution algorithm is proposed. Finally, the rapid design platform technology of filling conveyor line is studied. Through the structure design and assembly design, three-dimensional layout drawing and assembly drawing are generated, and the automatic generation method of assembly is studied. Secondly, a rapid design prototype system for filling conveyor line is developed. The overall structure and function composition of the software platform are introduced, and an example is given to verify the effectiveness of the study.
【學(xué)位授予單位】：浙江大學(xué)
【學(xué)位級(jí)別】：博士
【學(xué)位授予年份】：2017
【分類號(hào)】：TS203

【參考文獻(xiàn)】

相關(guān)期刊論文 前10條

1 郭銳;黃R，

本文編號(hào)：2431122