【摘要】：產(chǎn)品族設(shè)計(jì)是一個復(fù)雜的過程，它不僅是顧客域、功能域、物理域和工藝域依次相互作用，還受到供應(yīng)鏈設(shè)計(jì)、產(chǎn)品銷售和售后服務(wù)等的影響。從系統(tǒng)論的角度來看，產(chǎn)品族設(shè)計(jì)的各階段之間以及產(chǎn)品族設(shè)計(jì)與其相關(guān)系統(tǒng)之間存在著許多主從關(guān)系。雙層規(guī)劃模型是體現(xiàn)經(jīng)濟(jì)和管理問題中的主從關(guān)系的一類數(shù)學(xué)模型，它屬于NP-難問題，雖然對其算法的研究很多，但這些研究往往只是針對有特殊性狀的雙層規(guī)劃。遺傳算法是一種比較流行的智能算法，它具有簡單通用性、魯棒性、全局收斂性、適用并行處理等特點(diǎn)，在數(shù)學(xué)優(yōu)化領(lǐng)域方面的應(yīng)用尤其廣泛。本文通過介紹產(chǎn)品族設(shè)計(jì)的一般過程和影響因素，提出了產(chǎn)品族設(shè)計(jì)中存在的一些主從關(guān)聯(lián)優(yōu)化問題，在已有面向產(chǎn)品族設(shè)計(jì)的雙層規(guī)劃的研究中提煉出一類具有典型特征的雙層規(guī)劃模型，并設(shè)計(jì)了一種遺傳算法求解方法。最后，本文給詳細(xì)介紹了產(chǎn)品族設(shè)計(jì)中的一類主從關(guān)聯(lián)優(yōu)化問題，并將模型和求解算法應(yīng)用到具體的實(shí)例中。 本文的主要工作和創(chuàng)新點(diǎn)如下： 1.基于產(chǎn)品族設(shè)計(jì)的一般過程，本文提出了產(chǎn)品族設(shè)計(jì)中的幾類主從優(yōu)化問題，并提煉出一類面向產(chǎn)品族設(shè)計(jì)的值型雙層規(guī)劃模型。 2.基于遺傳算法，本文設(shè)計(jì)了求解所給模型的方法，并給出了算法的依據(jù)、收斂性和數(shù)值算例驗(yàn)證。該方法依據(jù)雙層規(guī)劃解的概念，采用嵌套的遺傳算法，外層遺傳算法求解上層問題，，內(nèi)層遺傳算法求解在上層變量給定下的下層問題，并將最優(yōu)值反應(yīng)到外層遺傳算法以便其進(jìn)行迭代運(yùn)算。這種算法既能保證所求的解在雙層規(guī)劃的約束域內(nèi)，也能保證其為近似最優(yōu)解。 3.基于已有產(chǎn)品族模塊配置和供應(yīng)鏈設(shè)計(jì)的關(guān)聯(lián)研究，本文將設(shè)計(jì)的模型和算法應(yīng)用到二者的主從關(guān)聯(lián)優(yōu)化中。
[Abstract]:Product family design is a complex process. It is not only the interaction of customer domain, functional domain, physical domain and process domain, but also the influence of supply chain design, product sales and after-sales service. From the point of view of system theory, there are many principal and subordinate relationships among the stages of product family design and between product family design and its related systems. The bilevel programming model is a kind of mathematical model which embodies the relationship between principal and subordinate in economic and management problems. It belongs to the NP- problem. Although there are a lot of researches on its algorithm, these researches are usually only aimed at bilevel programming with special characters. Genetic algorithm (GA) is a popular intelligent algorithm, which has the characteristics of simple generality, robustness, global convergence and parallelism, especially in the field of mathematical optimization. By introducing the general process and influencing factors of product family design, this paper puts forward some principal and subordinate association optimization problems in product family design. A class of bilevel programming models with typical characteristics has been abstracted from the previous studies of bilevel programming for product family design, and a genetic algorithm (GA) method has been designed. Finally, this paper gives a detailed introduction of a class of master-slave association optimization problems in product family design, and applies the model and solution algorithm to a concrete example. The main work and innovation of this paper are as follows: 1. Based on the general process of product family design, this paper presents several kinds of master-slave optimization problems in product family design, and extracts a class of value bilevel programming models for product family design. 2. Based on genetic algorithm, this paper designs a method to solve the given model, and gives the basis of the algorithm, convergence and numerical examples. According to the concept of bilevel programming solution, the method uses nested genetic algorithm, outer genetic algorithm to solve the upper layer problem, and inner layer genetic algorithm to solve the lower layer problem given in the upper variable. The optimal value is reflected to the outer genetic algorithm for iterative operation. This algorithm can not only guarantee the solution in the constrained domain of the bilevel programming, but also guarantee that the solution is approximately optimal. 3. Based on the existing product family module configuration and supply chain design, this paper applies the designed model and algorithm to the master-slave association optimization.
【學(xué)位授予單位】：天津大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2014
【分類號】：TB472;TP18

【參考文獻(xiàn)】

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

1 黃冀卓;王湛;馬人樂;;一種新的求解約束多目標(biāo)優(yōu)化問題的遺傳算法[J];計(jì)算機(jī)工程與應(yīng)用;2006年23期

2 常永明;王宇平;;求解一類特殊的雙層規(guī)劃問題的遺傳算法[J];計(jì)算機(jī)工程與應(yīng)用;2009年03期

3 李和成;王宇平;;一個基于插值的解非線性雙層規(guī)劃的遺傳算法[J];計(jì)算機(jī)學(xué)報(bào);2008年06期

4 夏一;杜綱;傅星;;隧道傳感系統(tǒng)微位移機(jī)構(gòu)的主從關(guān)聯(lián)優(yōu)化設(shè)計(jì)[J];機(jī)械工程學(xué)報(bào);2012年09期

5 王廣民;萬仲平;王先甲;;二(雙)層規(guī)劃綜述[J];數(shù)學(xué)進(jìn)展;2007年05期

6 郭畢佳,郭曉丹,楊文堤;三大現(xiàn)代設(shè)計(jì)理論異同比較[J];武漢科技學(xué)院學(xué)報(bào);2002年03期

7 裴崢,黃天民;二層線性規(guī)劃的模糊數(shù)學(xué)解法(Ⅱ)[J];西南交通大學(xué)學(xué)報(bào);2000年01期

8 李宏,王宇平,焦永昌;解非線性兩層規(guī)劃問題的新的遺傳算法及全局收斂性[J];系統(tǒng)工程理論與實(shí)踐;2005年03期

9 趙志剛;顧新一;李陶深;;求解雙層規(guī)劃模型的粒子群優(yōu)化算法[J];系統(tǒng)工程理論與實(shí)踐;2007年08期

10 楊若黎,顧基發(fā);一類非線性兩級規(guī)劃問題的模擬退火求解[J];系統(tǒng)工程理論與實(shí)踐;1997年07期

本文編號：2283507