工業(yè)工程外文翻譯--裝配線平衡問題的求解方法淺析-預(yù)覽頁
【正文】 assembly line equilibrium problem is the longlost type of a type of typical model the bination is excellent to turn a problem, particularly is for random, many the assembly line equilibrium problem of target, solve to the satisfaction seldom more on a certain degree. Mainly is divided into the following 3 aspects to the research of assembly line equilibrium problem currently: Give the rhythm of the assembly line certainly beg minimum work station number, usually in the assembly line of design and install the stage carry on。 Usually a pimping problem model that need to be constructed very big, the calculator consumes hour also more. Below I will make analysis use linear programming method and dynamic state program method. The linear programming (Linear Programming, brief name LP) problem is a target function peace treaty39。 it is very difficult and skillful. The dynamic plan realization is not certainly plex, is suitable for many questions, when solution general question is one of we first choice algorithms. But, the dynamic 4 plan mathematical model establishment is not an easy matter, most difficult also most importantly condition expression. The dynamic plan condition expressed the description subquestion must satisfy the most superior child constitutive property, otherwise unable to establish the correct dynamic plan model. Solves the problem when the application dynamic plan method, should first estimate the question the time, the space, if the question has the dimension barrier, then the dynamic plan condition expressed very difficult to satisfy the paratively largescale question the spatial request. We must seek the alternative means in addition. The dynamic plan law utilizes to when solving the ALB problem, its condition expression with various workstations work element process period related, often when determination dynamic upper boundary must affect a smaller condition to the system to carry on the deletion, thus achieved reduces the operand the goal. The heuristic method by its simple, easy to understand, was fast and has satisfied won the multitudinous administrative personnel39。 Probability shift criterion. In recent years, because 5 the heredity algorithm solved the plex optimized question the huge potential and it’s in the industrial engineering domain success application, this algorithm obtained the widespread attention. The heredity algorithm often appears in the actual application precociously restrains and restrains the performance inferior shorting, the nowadays some improvement methods mostly is aims at the gene operation, population39。制造業(yè)的生產(chǎn)多半是在進(jìn)行細(xì)分化之后的多工序、流水化、連續(xù)作業(yè)生產(chǎn)線，此時(shí)由于分工作業(yè)，各工序的作業(yè)時(shí) 間在理論上、實(shí)際操作上都不能完全相同，這就勢(shì)必存在工序間作業(yè)負(fù)荷不均的現(xiàn)象。整個(gè)裝配 作業(yè)繁雜，屬勞動(dòng)密集型工程。由于裝配 線的平衡總是離散型組合優(yōu)化問題，尋求最優(yōu)解比較困難，故采取合適的方法解決裝配線平衡問題引起了各企業(yè)界和學(xué)術(shù)界的廣泛關(guān)注。盡管數(shù)學(xué)模型法能找到最優(yōu)解，但實(shí)際應(yīng)用時(shí)十分繁瑣；往往一個(gè)很小的問題需要構(gòu)造的模型非常大，計(jì)算機(jī)耗時(shí)也較多。之后一些學(xué)者將此算法加以改進(jìn)，但運(yùn)算量也比較大。但是，動(dòng)態(tài)規(guī)劃的數(shù)學(xué)模型的建立不是件容易的事，其中最困難也最重要的是狀態(tài)表示。動(dòng)態(tài)規(guī)劃法運(yùn)用于解決 ALB 問題時(shí)，其狀態(tài)的表示與各工作站作業(yè)元素的加工時(shí)間有關(guān)，往往在確定動(dòng)態(tài)上界時(shí)需對(duì)系統(tǒng)影響較小的狀態(tài)進(jìn)行刪除，從而達(dá)到降低運(yùn)算量的目的。 遺傳算法 (geic algorithms，簡(jiǎn)稱 GA)是 J. Holland 于 1975 年受生物進(jìn)化論的啟發(fā)而提出的。遺傳算法在實(shí)際的應(yīng)用中往往出現(xiàn)早熟收斂和收斂性能差等缺點(diǎn)，現(xiàn)今的一些改進(jìn)方法大都是針對(duì)基因操作、種群的宏觀操作、基于知識(shí)的操作和并行化 GA進(jìn)行。改善是企業(yè)永恒的主題，而工業(yè)工程所追求的目標(biāo)就是永無止境的改善，運(yùn)用相關(guān)技術(shù)對(duì)生產(chǎn)線平衡，為企業(yè)降低消耗，提高生產(chǎn)率。本文針對(duì)線性規(guī)劃法、動(dòng)態(tài)規(guī)劃算法、遺傳算法和工業(yè)工程方法這四種求解裝配線平衡問題的典型方法分別作了簡(jiǎn)要分析，指出了各種算法的優(yōu)缺點(diǎn)及應(yīng)用情況。
畢業(yè)設(shè)計(jì)相關(guān)推薦
鄂ICP備17016276號(hào)-1