SCM-2LogisticsNetworkConfiguration供應(yīng)鏈管理課件

物流網(wǎng)絡(luò)設(shè)計(jì)

LogisticsNetworkConfiguration物流網(wǎng)絡(luò)設(shè)計(jì)

LogisticsNetworkConf1

OutlineWhatisit?方法Methodology

–建模Modeling–數(shù)據(jù)合并DataAggregation–確認(rèn)可靠性ValidationSolutionTechniques

OutlineWhatisit?2物流網(wǎng)絡(luò)TheLogisticsNetwork物流網(wǎng)絡(luò)包括:節(jié)點(diǎn):Vendors（供應(yīng)商）,ManufacturingCenters,Warehouse/DistributionCenters,andCustomersRawmaterials原材料andfinishedproductsthatflowbetweenthefacilities.物流網(wǎng)絡(luò)TheLogisticsNetwork物流網(wǎng)絡(luò)包3SCM-2LogisticsNetworkConfiguration供應(yīng)鏈管理課件4決策的分類DecisionClassifications戰(zhàn)略層面:涉及到資本投入等有著長(zhǎng)期影響的那些決策。如：–決定新工廠、配送中心、倉(cāng)庫(kù)的選址、數(shù)目、規(guī)模等。–新生產(chǎn)設(shè)備的購(gòu)買及工廠內(nèi)生產(chǎn)方式的選擇etc.決策的分類DecisionClassifications戰(zhàn)5策略層面:Effectiveallocationofmanufacturing(生產(chǎn)等資源的有效分配)anddistributionresourcesoveraperiodofseveralmonths–工人規(guī)模–庫(kù)存控制的方式–配送渠道的選擇–運(yùn)輸、配送及替代方案的選擇決策的分類DecisionClassifications策略層面:Effectiveallocationof6操作層面:Includesday-to-dayoperationaldecisions–Theassignment（分派）ofcustomerorderstoindividualmachines–Dispatching,expediting（催單）andprocessingorders–Vehiclescheduling（車輛路線設(shè)計(jì)）決策的分類DecisionClassifications操作層面:Includesday-to-dayope7網(wǎng)絡(luò)設(shè)計(jì):主要解決的問題決定最優(yōu)的庫(kù)房、工廠的地點(diǎn)、數(shù)目、規(guī)模決定最優(yōu)的供應(yīng)方案：–哪家工廠（供應(yīng)商）生產(chǎn)（供應(yīng)）哪種產(chǎn)品或部件決定最優(yōu)的配送路徑–哪個(gè)庫(kù)房（配送中心）服務(wù)哪個(gè)區(qū)域的客戶網(wǎng)絡(luò)設(shè)計(jì):主要解決的問題決定最優(yōu)的庫(kù)房、工廠的地點(diǎn)、數(shù)目、8主要目標(biāo)為平衡服務(wù)水準(zhǔn)與生產(chǎn)、供應(yīng)成本庫(kù)存持有成本訂單處理成本運(yùn)輸成本Thatis,wewouldliketofindaminimal-annual-costconfigurationofthedistributionnetworkthatsatisfiesproductdemandsatspecifiedcustomerservicelevels.網(wǎng)絡(luò)設(shè)計(jì):主要解決的問題主要目標(biāo)為平衡服務(wù)水準(zhǔn)與網(wǎng)絡(luò)設(shè)計(jì):主要解決的問題9

網(wǎng)絡(luò)設(shè)計(jì)的工具:MajorComponents繪圖Mapping–Mappingallowsyoutovisualize（可視化）yoursupplychainandsolutions–Mappingthesolutionsallowsyoutobetterunderstanddifferentscenarios（場(chǎng)景、方案）–Colorcoding,sizing,andutilizationindicatorsallowforfurtheranalysis數(shù)據(jù)–Dataspecifiesthecostsofyoursupplychain–Thebaselinecostdatashouldmatchyouraccountingdata–Theoutputdataallowsyoutoquantifychangestothesupplychain優(yōu)化工具–相關(guān)軟件如LINGO、CMOS等。

網(wǎng)絡(luò)設(shè)計(jì)的工具:MajorComponents繪圖Ma10

MappingAllowsYoutoVisualizeYourSupplyChain

MappingAllowsYoutoVisuali11

DisplayingtheSolutionsAllowsyouToCompareScenarios

DisplayingtheSolutionsAllo12

網(wǎng)絡(luò)設(shè)計(jì)所需要的相關(guān)數(shù)據(jù)1.所有產(chǎn)品的清單2.客戶、供應(yīng)來源的地理區(qū)域3.每區(qū)域客戶對(duì)每種產(chǎn)品的需求信息。4.運(yùn)輸費(fèi)率5.庫(kù)房的相關(guān)成本6.訂單的模式如訂單頻率、規(guī)模、內(nèi)容特點(diǎn)、有無(wú)季節(jié)性等等。7.訂單處理成本8.客戶服務(wù)水平

網(wǎng)絡(luò)設(shè)計(jì)所需要的相關(guān)數(shù)據(jù)1.所有產(chǎn)品的清單13信息太多怎么辦？CustomersandGeocoding按地理位置進(jìn)行編碼銷售數(shù)據(jù)通常是按照地理區(qū)域來統(tǒng)計(jì)的。信息太多怎么辦？CustomersandGeocodin14為什么要進(jìn)行數(shù)據(jù)合并WhyAggregate?

節(jié)省數(shù)據(jù)處理成本最詳細(xì)的數(shù)據(jù)可能得不到如按每個(gè)縣、村等。保證模型的可操作性為什么要進(jìn)行數(shù)據(jù)合并WhyAggregate?節(jié)省數(shù)據(jù)處15數(shù)據(jù)合并DataAggregation合并的兩種方式:需求的合并:將顧客按位置或服務(wù)等級(jí)進(jìn)行合并,在按位置進(jìn)行合并的情況下,無(wú)數(shù)個(gè)顧客合并為少數(shù)的比如幾十個(gè)顧客區(qū)域.按物品進(jìn)行合并,比如按物品物理化學(xué)特性\配送方式等.數(shù)據(jù)合并DataAggregation合并的兩種方式:16按客戶的地理位置進(jìn)行數(shù)據(jù)合并Customerslocatedincloseproximity接近areaggregatedusingagrid網(wǎng)格networkorclustering（分組）techniques.Allcustomerswithinasinglecellorasingleclusterarereplacedbyasinglecustomerlocatedatthecentroid中心ofthecellorcluster.Werefertoacelloraclusterasacustomerzone顧客區(qū)域.按客戶的地理位置進(jìn)行數(shù)據(jù)合并Customerslocate17可能產(chǎn)生的問題過分合并會(huì)導(dǎo)致模型處理的不準(zhǔn)確什么影響了數(shù)據(jù)合并的有效性？合并后區(qū)域的數(shù)量各區(qū)域內(nèi)客戶分布的不同形態(tài)可能產(chǎn)生的問題過分合并會(huì)導(dǎo)致模型處理的不準(zhǔn)確18合理的數(shù)據(jù)合并的方法合并后至少有150-200個(gè)區(qū)域。確保每個(gè)區(qū)域的總需求量大致相同使合并后的中心點(diǎn)在各區(qū)域的中心位置Inthiscase,theerroristypicallynomorethan1%合理的數(shù)據(jù)合并的方法合并后至少有150-200個(gè)區(qū)域。19例：最優(yōu)庫(kù)房數(shù)量的選擇1個(gè)工廠、1種產(chǎn)品客戶數(shù)據(jù)–原始數(shù)據(jù)有18,000個(gè)客戶地點(diǎn)–合并后有800個(gè)客戶地點(diǎn)例：最優(yōu)庫(kù)房數(shù)量的選擇1個(gè)工廠、1種產(chǎn)品20ComparingOutput輸出結(jié)果的比較合并前的原始數(shù)據(jù)合并后的數(shù)據(jù)ComparingOutput輸出結(jié)果的比較合并前的原始數(shù)21

Minimizethecostofyourlogisticsnetworkwithoutcompromisingservicelevels

Minimizethecostofyourlog22

增加庫(kù)房數(shù)量會(huì)。。。提高對(duì)客戶響應(yīng)時(shí)間，從而提高服務(wù)水平庫(kù)存增加從而庫(kù)存成本增加。其它費(fèi)用如日常管理成本增加總體而言，運(yùn)輸成本會(huì)減少，但具體而言–Reduceoutboundtransportationcosts–Increaseinboundtransportationcosts

增加庫(kù)房數(shù)量會(huì)。。。提高對(duì)客戶響應(yīng)時(shí)間，從而提高服務(wù)水平23優(yōu)化的方法數(shù)學(xué)優(yōu)化技術(shù):–Exactalgorithms算法:尋找最優(yōu)解–Heuristics啟發(fā)式算法:尋找滿意解模擬方法優(yōu)化的方法數(shù)學(xué)優(yōu)化技術(shù):24

LogisticsNetworkDesign

LogisticsNetworkDesign25

LogisticsNetworkDesign

LogisticsNetworkDesign26

LogisticsNetworkDesign

LogisticsNetworkDesign27

例一種產(chǎn)品兩個(gè)工廠p1與p2P1年生產(chǎn)能力為200,000units.p2年生產(chǎn)能力為60,000units.兩工廠生產(chǎn)成本相同.兩個(gè)倉(cāng)庫(kù)w1andw2，其庫(kù)存處理成本相同。三個(gè)市場(chǎng)c1,c2andc3，需求分別為50,000,100,000and50,000.

例一種產(chǎn)品28表1單位配送成本表129

WhyOptimizationMatters?

WhyOptimizationMatters?30方案1方案131

方案2

方案232

線性規(guī)劃法求解

線性規(guī)劃法求解33

模型

模型34

TheOptimalStrategy

TheOptimalStrategy35HP中國(guó)售后備件供應(yīng)網(wǎng)絡(luò)的構(gòu)建Presentedby:

ChenWan,KwanSinMan,LiawChyayi,TanYanTing,YanTaoHP中國(guó)售后備件供應(yīng)網(wǎng)絡(luò)的構(gòu)建Presentedby:C36問題描述目前有兩個(gè)中心備件庫(kù)房BeijingandShanghaiFromthese2hubs,servicepartsarebeingdeliveredto46citiesacrossthecountry目前服務(wù)水準(zhǔn)為

3D18通過建立額外的HUB來提高對(duì)備件需求的響應(yīng)時(shí)間新的服務(wù)水準(zhǔn)設(shè)定為2D10Toachievethisservicelevel,theyarewillingtosetasideadditionalbudget問題描述目前有兩個(gè)中心備件庫(kù)房BeijingandSh37模型與項(xiàng)目說明僅考慮32個(gè)最重要的中心城市備件需求量數(shù)據(jù)為過去12個(gè)月用量的平均每天接受訂單的截至試點(diǎn)為下午5點(diǎn)，因此，從HUB滿足該訂單的最長(zhǎng)時(shí)間為17個(gè)小時(shí)。Holdingcostincludeslabourcost,insuranceandotherrelatedcostsTransportationcostincludeslabourcost,fuelcost,loading/unloadingcost庫(kù)房建立成本Setupcost包括庫(kù)房租金、設(shè)備維護(hù)費(fèi)用、材料費(fèi)等等。模型與項(xiàng)目說明僅考慮32個(gè)最重要的中心城市38研究目的MinimizethebudgettoestablishadditionalhubswhilstsatisfyingthecoverageindustrybenchmarkCoverage（覆蓋區(qū)域）

isdefinedasthepercentageofdemandthatcanmeetthenewservicelevel,2D10.研究目的Minimizethebudgettoest39需要求解的問題NumberofhubsLocationofhubsAssignmentofnon-hubstohubsTrade-offbetweenthetotaltransportationcostandthesetupcostsofadditionalhubs需要求解的問題Numberofhubs40問題的建模非線性整數(shù)規(guī)劃NonlinearIntegerProgrammingProblem各集合的定義:DemandCities,C= {Shenzhen深圳,Zhuhai珠海,Shantou汕頭,Zhanjiang湛江,Dongguan東莞,Taizhou臺(tái)洲,Zhongshan中山,Chongqing重慶,Changsha長(zhǎng)沙,Zhengzhou鄭州,Hefei合肥,Nanchang南昌,Yichang宜昌,Harbin哈爾濱,Changchun長(zhǎng)春,Dalian大連,Nanning南寧,Lanzhou蘭州,Yinchuan銀川,Xiamen廈門,Quanzhou泉州,Qingdao青島,Yantai煙臺(tái),Jinan濟(jì)南,Fuzhou福州,Xian西安,Shenyang沈陽(yáng),Chengdu成都,Guangzhou廣州,Wuhan武漢,Beijing北京,Shanghai上海}問題的建模非線性整數(shù)規(guī)劃NonlinearInteger41ProblemFormulationSetsDefinition(cont’)Possiblesupplycities,C2={sameasC+Beijing2北京2,Shanghai2上海2}我們規(guī)定Beijing2andShanghai2來滿足那些無(wú)法被任何一個(gè)城市在2D10的時(shí)間內(nèi)覆蓋的區(qū)域，即我們規(guī)定在那樣的情況下，這些城市的備件直接由北京或上海供應(yīng)ProblemFormulationSetsDefini42決策變量

Kijisabinaryintegerandis1whencityiisbeingservicedbycityj,0otherwise.Kjjis1whencityjischosenasahubtoserviceothercities.U(i,j)=[0,Di] Uij,theunitsofproductshippedfromhubcityjtodemandcityiCoverageistheratioofdemandcoveredbythehubsat2D10tothetotaldemandattheold3D18servicelevel決策變量43參數(shù)說明D(i)=城市i的月平均備件用量HO(j)=城市j的單位庫(kù)存持有成本ST(j)=在城市j建立庫(kù)房的成本transcost(i,j)=costoftransportationperunitfromhubcityjtocityiIftravellingtimebetweencityiandcityjisbeyond17hrs,transcost(i,j)issettoM,whereMisaninfinitelylargeinteger.參數(shù)說明44目標(biāo)函數(shù)包括3個(gè)部分庫(kù)存持有成本

=KijxUijxHOjrepresentstheholdingcostofitembeingheldathubjthatistobetransportedtoservicecityi運(yùn)輸成本

=KijxUijxtranscost(i,j)representsthetransportationcostofUijamountofitemsfromhubcityjtoservicecityi庫(kù)房建立成本

=KjjxSTjrepresentsthesetupcostofahubincityjMinBudget目標(biāo)函數(shù)包括3個(gè)部分45約束條件1citytoonly1hubmatchingrequirements 一個(gè)城市僅僅能被一個(gè)HUB來供貨，進(jìn)一步，一個(gè)城市如果被選為HUB的話，那么其自己的需求僅能由自己來滿足。SincethesumofKijis1,eachdemandcityisonlymatchedto1hubcity.ThehubcityismatchedtoitselfwhenKij=1fori=j.Onlyhubcitiescanservicedemandcities

AcitycanonlybeservedbyanothercityifitisidentifiedasahubsincejisonlyahubifKjj=1,andthusKijcanthenbe1.Therefore,cityicanonlybeservedbycityjifjisidentifiedasahub.約束條件1citytoonly1hubmatch46約束條件Usageconstrain

Sinceonedemandcityisonlyservedbyonehub,theusageshouldbeequaltothecitydemandsuchthatnoshortageshouldoccur.Coverageconstraint

Thisconstrainensuresthatthenewhubnetworkwouldbeabletocoveratleast85%ofthetotaldemandwiththenew2D10servicelevel

約束條件Usageconstrain47Non-negativityConstraints

NonegativetransportationflowfromhubtodemandcitiesAcitiesiseitherserved(kij=1)ornotserved(kij=0)Budget≥0TherecannotbenegativebudgetCoverage≥0Therecannotbenegativecoverage,worstscenariois0約束條件Non-negativityConstraints約束條48Budget=￥744,503Coverage=93.31%6additionalhubstobesetup,besidesSHandBJZhongshan,Chengdu,Wuhan,Shenyang,JinanandXianHubCitiesServedTotalDemandBeijingBeijing7,835ShanghaiShanghai5,960ZhongshanShenzhen,Zhuhai,Shantou,Zhanjiang,Dongguan,Zhongshan,Guangzhou,Nanning13,468ChengduChongqing,Chengdu4,379WuhanChangsha,Hefei,Nanchang,Yichang,Wuhan6,660ShenyangHarbin,Changchun,Dalian,Shenyang4,472XianLanzhou,Yinchuan,Xian3,416JinanQingdao,Yantai,Jinan,Zhengzhou3,878Total50,068結(jié)果Budget=￥744,503HubCitiesSe49Citiesthatcannotbeservedwithin2D10byanyhubs.Thesearecitieswithlowdemand.Itisnotcostefficienttosetupahubspeciallytoservethesecities.HubCitiesthatcannotbecoveredwithin2D10TotalDemandShanghaiTaizhou,Xiamen,Quanzhou，F(xiàn)uzhou3,591Total3,591結(jié)果Citiesthatcannotbeservedw50ComparisonofCoverageagainstBudget

MinCost結(jié)果ComparisonofCoverageagainst51Discussion2002年HP的實(shí)際做法HeuristicsClustercitieswithgeographicalproximitytoformahubDesignatethecitywiththehighestsalesrevenueandhistoricaldemandasthehubBudget=￥803,945with97.39%coverage

HubCitiesServedTotalDemandBeijingBeijing7,835ShanghaiShanghai,Taizhou,Nanning7,359GuangzhouShenzhen,Zhuhai,Shantou,Zhanjiang,Dongguan,Zhongshan,Guangzhou12,686ChengduChongqing,Chengdu4,379WuhanChangsha,Zhengzhou,Hefei,Nanchang,Yichang,Wuhan7,763ShenyangHarbin,Changchun,Dalian,Shenyang4,472XianLanzhou,Yinchuan,Xian3,416FuzhouXiamen,Quanzhou,Fuzhou2,974JinanQingdao,Yantai,Jinan2,775Total53,659

7.39%Discussion2002年HP的實(shí)際做法HubCitie52ReAddonemorecostcomponenttotheproblemEvaluatetheriskpoolingeffectAssumptionsAverageleadtimeforvendortodelivertoeachhubis1monthAllvendorshavethesameleadtimeSafetyfactor,kissetat97%ModelExtensionReAddonemorecostcomponent53ReMinBudget

where

isthestandarddev.ofthetotaldemandforeachclustercoverbythehubjDmithehistoricaldemandofcityjinmonthmListheaverageleadtimeforthevendorstodeliverthegoodstotherespectivehubsObjectiveFunctionReMinBudgetObjectiveFunction54ReExtendedNLPmodelwasperformedon10cities–Beijing,Shanghai,Shenzhen,Zhuhai,Shantou,Chongqing,Chengdu,Changsha,Yantai,Jinan.Budget=￥292,80092.73%coverageResultsHubCitiesservedBeijingBeijingShanghaiShanghaiZhuhaiShenzhen,Shantou,Changsha,ZhuhaiChengduChongqing,ChengduHubCitiesthatcannotbecoveredwithin2D10BeijingYantai,JinanReExtendedNLPmodelwasperfo55ReLargenumberofvariablescannotbehandledbyNEOsserver.Hence,unabletotestthemodelusingtheentiredataset.AssumptionofauniformleadtimeforallvendorsmaynotberealisticLimitationsoftheExtendedModelReLargenumberofvariablesca56`ConclusionOurresultsaffirmsthatoptimizationofamodelwillachievebetterresultscomparedtoaheuristicapproach.Usingtheproposedmodel,HPChinawillgenerateasavingsof28.5%againsttheoriginaldistributionnetworkand7.39%savingsagainsttheheuristicmodel.Trade-offbetweentimeandresourcesspenttoobtaintheoptimalsolutionandpotentialcostsavings.`ConclusionOurresultsaffirms57Whatwillbetheresultifmoreechelonsbeadded?Whatwillbetheresultifmor58物流網(wǎng)絡(luò)設(shè)計(jì)

LogisticsNetworkConfiguration物流網(wǎng)絡(luò)設(shè)計(jì)

LogisticsNetworkConf59

OutlineWhatisit?方法Methodology

–建模Modeling–數(shù)據(jù)合并DataAggregation–確認(rèn)可靠性ValidationSolutionTechniques

OutlineWhatisit?60物流網(wǎng)絡(luò)TheLogisticsNetwork物流網(wǎng)絡(luò)包括:節(jié)點(diǎn):Vendors（供應(yīng)商）,ManufacturingCenters,Warehouse/DistributionCenters,andCustomersRawmaterials原材料andfinishedproductsthatflowbetweenthefacilities.物流網(wǎng)絡(luò)TheLogisticsNetwork物流網(wǎng)絡(luò)包61SCM-2LogisticsNetworkConfiguration供應(yīng)鏈管理課件62決策的分類DecisionClassifications戰(zhàn)略層面:涉及到資本投入等有著長(zhǎng)期影響的那些決策。如：–決定新工廠、配送中心、倉(cāng)庫(kù)的選址、數(shù)目、規(guī)模等。–新生產(chǎn)設(shè)備的購(gòu)買及工廠內(nèi)生產(chǎn)方式的選擇etc.決策的分類DecisionClassifications戰(zhàn)63策略層面:Effectiveallocationofmanufacturing(生產(chǎn)等資源的有效分配)anddistributionresourcesoveraperiodofseveralmonths–工人規(guī)模–庫(kù)存控制的方式–配送渠道的選擇–運(yùn)輸、配送及替代方案的選擇決策的分類DecisionClassifications策略層面:Effectiveallocationof64操作層面:Includesday-to-dayoperationaldecisions–Theassignment（分派）ofcustomerorderstoindividualmachines–Dispatching,expediting（催單）andprocessingorders–Vehiclescheduling（車輛路線設(shè)計(jì)）決策的分類DecisionClassifications操作層面:Includesday-to-dayope65網(wǎng)絡(luò)設(shè)計(jì):主要解決的問題決定最優(yōu)的庫(kù)房、工廠的地點(diǎn)、數(shù)目、規(guī)模決定最優(yōu)的供應(yīng)方案：–哪家工廠（供應(yīng)商）生產(chǎn)（供應(yīng)）哪種產(chǎn)品或部件決定最優(yōu)的配送路徑–哪個(gè)庫(kù)房（配送中心）服務(wù)哪個(gè)區(qū)域的客戶網(wǎng)絡(luò)設(shè)計(jì):主要解決的問題決定最優(yōu)的庫(kù)房、工廠的地點(diǎn)、數(shù)目、66主要目標(biāo)為平衡服務(wù)水準(zhǔn)與生產(chǎn)、供應(yīng)成本庫(kù)存持有成本訂單處理成本運(yùn)輸成本Thatis,wewouldliketofindaminimal-annual-costconfigurationofthedistributionnetworkthatsatisfiesproductdemandsatspecifiedcustomerservicelevels.網(wǎng)絡(luò)設(shè)計(jì):主要解決的問題主要目標(biāo)為平衡服務(wù)水準(zhǔn)與網(wǎng)絡(luò)設(shè)計(jì):主要解決的問題67

網(wǎng)絡(luò)設(shè)計(jì)的工具:MajorComponents繪圖Mapping–Mappingallowsyoutovisualize（可視化）yoursupplychainandsolutions–Mappingthesolutionsallowsyoutobetterunderstanddifferentscenarios（場(chǎng)景、方案）–Colorcoding,sizing,andutilizationindicatorsallowforfurtheranalysis數(shù)據(jù)–Dataspecifiesthecostsofyoursupplychain–Thebaselinecostdatashouldmatchyouraccountingdata–Theoutputdataallowsyoutoquantifychangestothesupplychain優(yōu)化工具–相關(guān)軟件如LINGO、CMOS等。

網(wǎng)絡(luò)設(shè)計(jì)的工具:MajorComponents繪圖Ma68

MappingAllowsYoutoVisualizeYourSupplyChain

MappingAllowsYoutoVisuali69

DisplayingtheSolutionsAllowsyouToCompareScenarios

DisplayingtheSolutionsAllo70

網(wǎng)絡(luò)設(shè)計(jì)所需要的相關(guān)數(shù)據(jù)1.所有產(chǎn)品的清單2.客戶、供應(yīng)來源的地理區(qū)域3.每區(qū)域客戶對(duì)每種產(chǎn)品的需求信息。4.運(yùn)輸費(fèi)率5.庫(kù)房的相關(guān)成本6.訂單的模式如訂單頻率、規(guī)模、內(nèi)容特點(diǎn)、有無(wú)季節(jié)性等等。7.訂單處理成本8.客戶服務(wù)水平

網(wǎng)絡(luò)設(shè)計(jì)所需要的相關(guān)數(shù)據(jù)1.所有產(chǎn)品的清單71信息太多怎么辦？CustomersandGeocoding按地理位置進(jìn)行編碼銷售數(shù)據(jù)通常是按照地理區(qū)域來統(tǒng)計(jì)的。信息太多怎么辦？CustomersandGeocodin72為什么要進(jìn)行數(shù)據(jù)合并WhyAggregate?

節(jié)省數(shù)據(jù)處理成本最詳細(xì)的數(shù)據(jù)可能得不到如按每個(gè)縣、村等。保證模型的可操作性為什么要進(jìn)行數(shù)據(jù)合并WhyAggregate?節(jié)省數(shù)據(jù)處73數(shù)據(jù)合并DataAggregation合并的兩種方式:需求的合并:將顧客按位置或服務(wù)等級(jí)進(jìn)行合并,在按位置進(jìn)行合并的情況下,無(wú)數(shù)個(gè)顧客合并為少數(shù)的比如幾十個(gè)顧客區(qū)域.按物品進(jìn)行合并,比如按物品物理化學(xué)特性\配送方式等.數(shù)據(jù)合并DataAggregation合并的兩種方式:74按客戶的地理位置進(jìn)行數(shù)據(jù)合并Customerslocatedincloseproximity接近areaggregatedusingagrid網(wǎng)格networkorclustering（分組）techniques.Allcustomerswithinasinglecellorasingleclusterarereplacedbyasinglecustomerlocatedatthecentroid中心ofthecellorcluster.Werefertoacelloraclusterasacustomerzone顧客區(qū)域.按客戶的地理位置進(jìn)行數(shù)據(jù)合并Customerslocate75可能產(chǎn)生的問題過分合并會(huì)導(dǎo)致模型處理的不準(zhǔn)確什么影響了數(shù)據(jù)合并的有效性？合并后區(qū)域的數(shù)量各區(qū)域內(nèi)客戶分布的不同形態(tài)可能產(chǎn)生的問題過分合并會(huì)導(dǎo)致模型處理的不準(zhǔn)確76合理的數(shù)據(jù)合并的方法合并后至少有150-200個(gè)區(qū)域。確保每個(gè)區(qū)域的總需求量大致相同使合并后的中心點(diǎn)在各區(qū)域的中心位置Inthiscase,theerroristypicallynomorethan1%合理的數(shù)據(jù)合并的方法合并后至少有150-200個(gè)區(qū)域。77例：最優(yōu)庫(kù)房數(shù)量的選擇1個(gè)工廠、1種產(chǎn)品客戶數(shù)據(jù)–原始數(shù)據(jù)有18,000個(gè)客戶地點(diǎn)–合并后有800個(gè)客戶地點(diǎn)例：最優(yōu)庫(kù)房數(shù)量的選擇1個(gè)工廠、1種產(chǎn)品78ComparingOutput輸出結(jié)果的比較合并前的原始數(shù)據(jù)合并后的數(shù)據(jù)ComparingOutput輸出結(jié)果的比較合并前的原始數(shù)79

Minimizethecostofyourlogisticsnetworkwithoutcompromisingservicelevels

Minimizethecostofyourlog80

增加庫(kù)房數(shù)量會(huì)。。。提高對(duì)客戶響應(yīng)時(shí)間，從而提高服務(wù)水平庫(kù)存增加從而庫(kù)存成本增加。其它費(fèi)用如日常管理成本增加總體而言，運(yùn)輸成本會(huì)減少，但具體而言–Reduceoutboundtransportationcosts–Increaseinboundtransportationcosts

增加庫(kù)房數(shù)量會(huì)。。。提高對(duì)客戶響應(yīng)時(shí)間，從而提高服務(wù)水平81優(yōu)化的方法數(shù)學(xué)優(yōu)化技術(shù):–Exactalgorithms算法:尋找最優(yōu)解–Heuristics啟發(fā)式算法:尋找滿意解模擬方法優(yōu)化的方法數(shù)學(xué)優(yōu)化技術(shù):82

LogisticsNetworkDesign

LogisticsNetworkDesign83

LogisticsNetworkDesign

LogisticsNetworkDesign84

LogisticsNetworkDesign

LogisticsNetworkDesign85

例一種產(chǎn)品兩個(gè)工廠p1與p2P1年生產(chǎn)能力為200,000units.p2年生產(chǎn)能力為60,000units.兩工廠生產(chǎn)成本相同.兩個(gè)倉(cāng)庫(kù)w1andw2，其庫(kù)存處理成本相同。三個(gè)市場(chǎng)c1,c2andc3，需求分別為50,000,100,000and50,000.

例一種產(chǎn)品86表1單位配送成本表187

WhyOptimizationMatters?

WhyOptimizationMatters?88方案1方案189

方案2

方案290

線性規(guī)劃法求解

線性規(guī)劃法求解91

模型

模型92

TheOptimalStrategy

TheOptimalStrategy93HP中國(guó)售后備件供應(yīng)網(wǎng)絡(luò)的構(gòu)建Presentedby:

ChenWan,KwanSinMan,LiawChyayi,TanYanTing,YanTaoHP中國(guó)售后備件供應(yīng)網(wǎng)絡(luò)的構(gòu)建Presentedby:C94問題描述目前有兩個(gè)中心備件庫(kù)房BeijingandShanghaiFromthese2hubs,servicepartsarebeingdeliveredto46citiesacrossthecountry目前服務(wù)水準(zhǔn)為

3D18通過建立額外的HUB來提高對(duì)備件需求的響應(yīng)時(shí)間新的服務(wù)水準(zhǔn)設(shè)定為2D10Toachievethisservicelevel,theyarewillingtosetasideadditionalbudget問題描述目前有兩個(gè)中心備件庫(kù)房BeijingandSh95模型與項(xiàng)目說明僅考慮32個(gè)最重要的中心城市備件需求量數(shù)據(jù)為過去12個(gè)月用量的平均每天接受訂單的截至試點(diǎn)為下午5點(diǎn)，因此，從HUB滿足該訂單的最長(zhǎng)時(shí)間為17個(gè)小時(shí)。Holdingcostincludeslabourcost,insuranceandotherrelatedcostsTransportationcostincludeslabourcost,fuelcost,loading/unloadingcost庫(kù)房建立成本Setupcost包括庫(kù)房租金、設(shè)備維護(hù)費(fèi)用、材料費(fèi)等等。模型與項(xiàng)目說明僅考慮32個(gè)最重要的中心城市96研究目的MinimizethebudgettoestablishadditionalhubswhilstsatisfyingthecoverageindustrybenchmarkCoverage（覆蓋區(qū)域）

isdefinedasthepercentageofdemandthatcanmeetthenewservicelevel,2D10.研究目的Minimizethebudgettoest97需要求解的問題NumberofhubsLocationofhubsAssignmentofnon-hubstohubsTrade-offbetweenthetotaltransportationcostandthesetupcostsofadditionalhubs需要求解的問題Numberofhubs98問題的建模非線性整數(shù)規(guī)劃NonlinearIntegerProgrammingProblem各集合的定義:DemandCities,C= {Shenzhen深圳,Zhuhai珠海,Shantou汕頭,Zhanjiang湛江,Dongguan東莞,Taizhou臺(tái)洲,Zhongshan中山,Chongqing重慶,Changsha長(zhǎng)沙,Zhengzhou鄭州,Hefei合肥,Nanchang南昌,Yichang宜昌,Harbin哈爾濱,Changchun長(zhǎng)春,Dalian大連,Nanning南寧,Lanzhou蘭州,Yinchuan銀川,Xiamen廈門,Quanzhou泉州,Qingdao青島,Yantai煙臺(tái),Jinan濟(jì)南,Fuzhou福州,Xian西安,Shenyang沈陽(yáng),Chengdu成都,Guangzhou廣州,Wuhan武漢,Beijing北京,Shanghai上海}問題的建模非線性整數(shù)規(guī)劃NonlinearInteger99ProblemFormulationSetsDefinition(cont’)Possiblesupplycities,C2={sameasC+Beijing2北京2,Shanghai2上海2}我們規(guī)定Beijing2andShanghai2來滿足那些無(wú)法被任何一個(gè)城市在2D10的時(shí)間內(nèi)覆蓋的區(qū)域，即我們規(guī)定在那樣的情況下，這些城市的備件直接由北京或上海供應(yīng)ProblemFormulationSetsDefini100決策變量

Kijisabinaryintegerandis1whencityiisbeingservicedbycityj,0otherwise.Kjjis1whencityjischosenasahubtoserviceothercities.U(i,j)=[0,Di] Uij,theunitsofproductshippedfromhubcityjtodemandcityiCoverageistheratioofdemandcoveredbythehubsat2D10tothetotaldemandattheold3D18servicelevel決策變量101參數(shù)說明D(i)=城市i的月平均備件用量HO(j)=城市j的單位庫(kù)存持有成本ST(j)=在城市j建立庫(kù)房的成本transcost(i,j)=costoftransportationperunitfromhubcityjtocityiIftravellingtimebetweencityiandcityjisbeyond17hrs,transcost(i,j)issettoM,whereMisaninfinitelylargeinteger.參數(shù)說明102目標(biāo)函數(shù)包括3個(gè)部分庫(kù)存持有成本

=KijxUijxHOjrepresentstheholdingcostofitembeingheldathubjthatistobetransportedtoservicecityi運(yùn)輸成本

=KijxUijxtranscost(i,j)representsthetransportationcostofUijamountofitemsfromhubcityjtoservicecityi庫(kù)房建立成本

=KjjxSTjrepresentsthesetupcostofahubincityjMinBudget目標(biāo)函數(shù)包括3個(gè)部分103約束條件1citytoonly1hubmatchingrequirements 一個(gè)城市僅僅能被一個(gè)HUB來供貨，進(jìn)一步，一個(gè)城市如果被選為HUB的話，那么其自己的需求僅能由自己來滿足。SincethesumofKijis1,eachdemandcityisonlymatchedto1hubcity.ThehubcityismatchedtoitselfwhenKij=1fori=j.Onlyhubcitiescanservicedemandcities

AcitycanonlybeservedbyanothercityifitisidentifiedasahubsincejisonlyahubifKjj=1,andthusKijcanthenbe1.Therefore,cityicanonlybeservedbycityjifjisidentifiedasahub.約束條件1citytoonly1hubmatch104約束條件Usageconstrain

Sinceonedemandcityisonlyservedbyonehub,theusageshouldbeequaltothecitydemandsuchthatnoshortageshouldoccur.Coverageconstraint

Thisconstrainensuresthatthenewhubnetworkwouldbeabletocoveratleast85%ofthetotaldemandwiththenew2D10servicelevel

約束條件Usageconstrain105Non-negativityConstraints

NonegativetransportationflowfromhubtodemandcitiesAcitiesiseitherserved(kij=1)ornotserved(kij=0)Budget≥0TherecannotbenegativebudgetCoverage≥0Therecannotbenegativecoverage,worstscenariois0約束條件Non-negativityConstraints約束條106Budget=￥744,503Coverage=93.31%6additionalhubstobesetup,besidesSHandBJZhongshan,Chengdu,Wuhan,Shenyang,JinanandXianHubCitiesServedTotalDemandBeijingBeijing7,835ShanghaiShanghai5,960ZhongshanShenzhen,Zhuhai,Shantou,Zhanjiang,Dongguan,Zhongshan,Guangzhou,Nanning13,468ChengduChongqing,Chengdu4,379WuhanChangsha,Hefei,Nanchang,Yichang,Wuhan6,660ShenyangHarbin,Changchun,Dalian,Shenyang4,472XianLanzhou,Yinchuan,Xian3,416JinanQingdao,Yantai,Jinan,Zhengzhou3,878Total50,068結(jié)果Budget=￥744,503HubCitiesSe107Citiesthatcannotbeservedwithin2D10byanyhubs.Thesearecitieswithlowdemand.Itisnotcostefficienttosetupahubspeciallytoservethesecities.HubCitiesthatcannotbecoveredwithin2D10TotalDemandShanghaiTaizhou,Xiamen,Quanzhou，F(xiàn)uzhou3,591Total3,591結(jié)果Citiesthatcannotbeservedw108ComparisonofCoverageagainstBudget

MinCost結(jié)果ComparisonofCoverageagainst109Discussion2002年HP的實(shí)際做法HeuristicsClustercitieswithgeographicalproximitytoformahubDesignatethecitywiththehigh