某轎車裝配生產(chǎn)線物料準(zhǔn)時化供應(yīng)研究
發(fā)布時間：2018-10-11 08:16
【摘要】：轎車混流總裝配線物料供應(yīng)系統(tǒng)在汽車生產(chǎn)全過程中占有至關(guān)重要的地位，是一個復(fù)雜的又精確的供應(yīng)鏈物流體系，而轎車裝配車間內(nèi)面向流水線的物料供應(yīng)系統(tǒng)又是整個供應(yīng)鏈物流體系的核心。因此，本文選取轎車總裝車間的物料供線方式和物料配送路徑這兩個方面進行深入研究。 一方面針對轎車混流裝配線的物料供線方式中重要零部件的排序耦合度低、排序效率低的特點。首先分析了不同緩沖區(qū)的優(yōu)劣，重點放在提高緩沖區(qū)排序性能的新型緩沖區(qū)設(shè)計上。其次，對某轎車實際生產(chǎn)中的座椅排序問題做簡化和提煉，創(chuàng)新的設(shè)計了Y型緩沖排序區(qū)；以排序結(jié)果對生產(chǎn)的可用度和排序效率兩者的加權(quán)和為目標(biāo)函數(shù)，建立評價排序區(qū)排序能力的數(shù)學(xué)模型。最后，使用C++語言編譯的計算機程序來求解該模型，通過引入實例證明了該緩沖區(qū)排序的有效性；同時將求解結(jié)果與兩種常用緩沖區(qū)的排序能力做比對，證明Y型緩沖排序區(qū)的排序性能最好。 另一方面為解決在JIT生產(chǎn)模式下汽車總裝生產(chǎn)線旁補貨不及時的問題。提出在一定線旁庫存量約束條件下以“裝配單元—物料超市”節(jié)點方式的物料配送。使用庫存量窗口取代傳統(tǒng)的時間窗口作為約束準(zhǔn)時化配送的條件，以配送循環(huán)總時間最小為目標(biāo)函數(shù)，建立基于庫存窗口的車輛調(diào)度數(shù)學(xué)模型。通過引入實際生產(chǎn)數(shù)據(jù)并采用基于模擬退火的改進粒子群算法求解該模型，實現(xiàn)基于線旁動態(tài)庫存量約束條件下的物料供線路徑的設(shè)定，同時證明了解決此類問題時該算法的高效性。 本文首先對轎車零部件的供線緩存區(qū)進行重新設(shè)計，而后對供線零部件的配送路徑進行優(yōu)化設(shè)計，，使兩者相輔相成有效地提高了生產(chǎn)物流的自動化程度和生產(chǎn)效率。
[Abstract]:The material supply system of car mixed flow assembly line plays an important role in the whole process of automobile production. It is a complex and accurate supply chain logistics system. The material supply system of car assembly workshop is the core of the whole supply chain logistics system. Therefore, this article selects the car assembly workshop material supply line way and the material distribution path these two aspects carries on the thorough research. On the one hand, it aims at the characteristics of low sorting coupling degree and low sorting efficiency of important parts in the material supply line of mixed assembly line of car. Firstly, the advantages and disadvantages of different buffers are analyzed, and the emphasis is put on the design of new buffers to improve the performance of buffer sorting. Secondly, the paper simplifies and refines the seat scheduling problem in the actual production of a certain car, and innovates the design of Y-type buffer sorting area, taking the weighted sum of both the availability and the sorting efficiency of the sorting results as the objective function. A mathematical model is established to evaluate the ranking ability of the sorting area. Finally, a computer program compiled in C language is used to solve the model. An example is introduced to prove the validity of the buffer sorting, and the results are compared with the sorting ability of two common buffers. It is proved that Y type buffer sorting region has the best sorting performance. On the other hand, in order to solve the JIT production model car assembly line side replenishment problem. This paper presents a method of material distribution based on the node of "assembly unit-material supermarket" under the condition of limited line side inventory. The inventory window is used to replace the traditional time window as the constraint condition for just-in-time distribution. The vehicle scheduling mathematical model based on inventory window is established with the minimum of the total distribution cycle time as the objective function. By introducing the actual production data and using the improved particle swarm optimization algorithm based on simulated annealing to solve the model, the path of the material supply line can be set under the condition of dynamic inventory constraints. At the same time, the efficiency of the algorithm is proved when solving this kind of problem. This paper first redesigns the supply line buffer area of car parts, and then optimizes the distribution path of supply line parts, which makes the two parts complement each other and effectively improve the automation degree and production efficiency of production logistics.
【學(xué)位授予單位】：沈陽工業(yè)大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2013
【分類號】：F274;F426.471
本文編號：2263482
[Abstract]:The material supply system of car mixed flow assembly line plays an important role in the whole process of automobile production. It is a complex and accurate supply chain logistics system. The material supply system of car assembly workshop is the core of the whole supply chain logistics system. Therefore, this article selects the car assembly workshop material supply line way and the material distribution path these two aspects carries on the thorough research. On the one hand, it aims at the characteristics of low sorting coupling degree and low sorting efficiency of important parts in the material supply line of mixed assembly line of car. Firstly, the advantages and disadvantages of different buffers are analyzed, and the emphasis is put on the design of new buffers to improve the performance of buffer sorting. Secondly, the paper simplifies and refines the seat scheduling problem in the actual production of a certain car, and innovates the design of Y-type buffer sorting area, taking the weighted sum of both the availability and the sorting efficiency of the sorting results as the objective function. A mathematical model is established to evaluate the ranking ability of the sorting area. Finally, a computer program compiled in C language is used to solve the model. An example is introduced to prove the validity of the buffer sorting, and the results are compared with the sorting ability of two common buffers. It is proved that Y type buffer sorting region has the best sorting performance. On the other hand, in order to solve the JIT production model car assembly line side replenishment problem. This paper presents a method of material distribution based on the node of "assembly unit-material supermarket" under the condition of limited line side inventory. The inventory window is used to replace the traditional time window as the constraint condition for just-in-time distribution. The vehicle scheduling mathematical model based on inventory window is established with the minimum of the total distribution cycle time as the objective function. By introducing the actual production data and using the improved particle swarm optimization algorithm based on simulated annealing to solve the model, the path of the material supply line can be set under the condition of dynamic inventory constraints. At the same time, the efficiency of the algorithm is proved when solving this kind of problem. This paper first redesigns the supply line buffer area of car parts, and then optimizes the distribution path of supply line parts, which makes the two parts complement each other and effectively improve the automation degree and production efficiency of production logistics.
【學(xué)位授予單位】：沈陽工業(yè)大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2013
【分類號】：F274;F426.471
【參考文獻】
相關(guān)期刊論文 前9條
1 趙曉波,周兆英;混合車型組裝線的投入順序問題[J];中國機械工程;1998年03期
2 楊瑞臣,周永付,云慶夏;尋找車輛最優(yōu)路徑的混合算法[J];交通運輸工程學(xué)報;2005年01期
3 蔣珉,王廷平,嚴(yán)洪森;含有限緩沖區(qū)的多生產(chǎn)線協(xié)調(diào)生產(chǎn)計劃的研究[J];東南大學(xué)學(xué)報(自然科學(xué)版);2004年05期
4 謝秉磊,李軍,郭耀煌;有時間窗的非滿載車輛調(diào)度問題的遺傳算法[J];系統(tǒng)工程學(xué)報;2000年03期
5 曹振新;朱云龍;;混流轎車總裝配線上物料配送的研究與實踐[J];計算機集成制造系統(tǒng)-CIMS;2006年02期
6 曹振新,朱云龍,趙明揚,尹朝萬,李富明;混流裝配線負荷平衡與投產(chǎn)排序的優(yōu)化研究[J];信息與控制;2004年06期
7 劉云忠,宣慧玉;車輛路徑問題的模型及算法研究綜述[J];管理工程學(xué)報;2005年01期
8 李寧,鄒彤,孫德寶;車輛路徑問題的粒子群算法研究[J];系統(tǒng)工程學(xué)報;2004年06期
9 李寧,鄒彤,孫德寶;帶時間窗車輛路徑問題的粒子群算法[J];系統(tǒng)工程理論與實踐;2004年04期
本文編號：2263482
本文鏈接：http://sikaile.net/guanlilunwen/shengchanguanlilunwen/2263482.html
最近更新
教材專著
