裝備調運優(yōu)化研究

第20卷第4期軍槭工程學(xué)院學(xué)報VoL 20 No.42008年8月Joumal of Ordnance Engineering CollegeAug. , 2008文章編號: 1008 -2956 (2008) 04-0020-04裝備調運優(yōu)化研究段立江'，陽(yáng)平華'，高軍2(1.軍械工程學(xué)院基礎部2. 裝備指揮與管理系，河北石家莊050003)摘要:應用整數規劃、目標規劃研究了在已知單車(chē)運費的假設下，如何分配不同載重量的車(chē)輛調運裝備而使總費用最小的問(wèn)題，建立了裝備調運優(yōu)化模型。算例表明了模型的有效性。關(guān)鍵詞:裝備調運;滿(mǎn)載;整數規劃;目標規劃中圖分類(lèi)號: E234; U491文獻標識碼: 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運輸是裝備保障的重要內容之一,文獻[1-4]0,y; =0;當實(shí)際值未達到目標值時(shí)，有y;* =0,y; >0;當實(shí)際值與目標值一樣時(shí),有y;sL 2 E(xgDa+ym)≤A;=0,yj =0?，F假設裝備運輸費用最優(yōu)為第1優(yōu)先級P ,裝備供應的偏差量為第2優(yōu)先級P2,同一級S(xa+Mu)≤u;內的權重均為1,這樣模型1轉化為目標規劃問(wèn)題?？?aD.+yu)=R;模型3 minF =Pyxt +P:二E,0