第20卷第4期軍槭工程學(xué)院學(xué)報(bào)VoL 20 No.42008年8月Joumal of Ordnance Engineering CollegeAug. , 2008文章編號: 1008 -2956 (2008) 04-0020-04裝備調(diào)運(yùn)優(yōu)化研究段立江'，陽平華'，高軍2(1.軍械工程學(xué)院基礎(chǔ)部2. 裝備指揮與管理系，河北石家莊050003)摘要:應(yīng)用整數(shù)規(guī)劃、目標(biāo)規(guī)劃研究了在已知單車運(yùn)費(fèi)的假設(shè)下，如何分配不同載重量的車輛調(diào)運(yùn)裝備而使總費(fèi)用最小的問題，建立了裝備調(diào)運(yùn)優(yōu)化模型。算例表明了模型的有效性。關(guān)鍵詞:裝備調(diào)運(yùn);滿載;整數(shù)規(guī)劃;目標(biāo)規(guī)劃中圖分類號: E234; U491文獻(xiàn)標(biāo)識碼: AResearch on the Optimization of Equipment RepositionDUAN Li-jiang'，YANG Ping-hua'，GAO Jun2(1. Department of Basic Courses 2. Department of Equipment Command and Management,Ordnance Engineering College, Shijiazhuang 05003, China)Abstract:Using the application of integer programming and goal programming ,the problem of how to alloacate the quantity of different full-load vehicle for repositioning equipment with the minimal cost is investi-gated. Based on the hypothesis that the single vehicle cost is known , the equipment repositioning modelsare established. A practical example shows the models are effective.Key words :equipment repostian ;full loads ;integer programming; goal programming運(yùn)輸是裝備保障的重要內(nèi)容之一,文獻(xiàn)[1-4]0,y; =0;當(dāng)實(shí)際值未達(dá)到目標(biāo)值時(shí)，有y;* =0,y; >0;當(dāng)實(shí)際值與目標(biāo)值一樣時(shí),有y;sL 2 E(xgDa+ym)≤A;=0,yj =0?，F(xiàn)假設(shè)裝備運(yùn)輸費(fèi)用最優(yōu)為第1優(yōu)先級P ,裝備供應(yīng)的偏差量為第2優(yōu)先級P2,同一級S(xa+Mu)≤u;內(nèi)的權(quán)重均為1,這樣模型1轉(zhuǎn)化為目標(biāo)規(guī)劃問題?？?aD.+yu)=R;模型3 minF =Pyxt +P:二E,0