基于GIS的网络物流模型研究

上海交通大学硕士学位论文基于GIS的网络物流模型研究姓名：浦争艳申请学位级别：硕士专业：计算机系统结构指导教师：李明禄20040101GIS4GIS5GIS6RESEARCHONTHEGIS-BASEDMODELOFTHENETWORKLOGISTICSABSTRACTThemodernlogisticsisoneofthefourburgeoningproductswhichShanghaimakesagreatefforttocultivateanddevelopduringthetenthfive-yearplan.Thelogisticinformationplatformistheimportantpartinmodernlogistics,thekeyofwhichistoestablishanall-round,tridimentionalandmulti-functionalspatiallogisticinformationservicesystem.ItintegratessomenewtechnologiessuchasGSM/GPRS/CDMA,GIS,GPS,Internetandsoon.ThemodernlogisticisturningintoanintelligentizedmanagementthroughGIS.Theoptimizationofthelogisticconfigurecangreatlycurtailthetimetoarrangethevehicle,advancetherateusingvehicle,reducetheotioseandwaitedtimeandarrangethedispatchedregionsandroutes.Itistheimportantpurposeforthemodernlogisticdecision-makingtocutdowntheresumptionandadvancetheefficiencyintheenterprise.ThenetworklogisticmodelisanessentialmodelinthelogisticphysicaldistributedsystembasedonGIS,whichcanarrangethephysicaldistributedregionsandroutesinreasontoenhancelogisticefficiency.GIS7Theestablishmentofanappliedandquicklyresolvednetworklogisticmodelplaysaviralrollinthelogisticdecision-makingmanagement.Inaddition,itpromotestheresearchinthenetworkanalyticaltechniqueonGIS.Thispaperstartsfromtheimportanceofthemodernlogisticstransportationsystem.Thepaperconsistsoffivechaptersandconclusion.Chapteroneprovidesusabriefpictureofthenotionanddevelopingtrendsofthelogisticsscienceresearch.ItalsointroducesthebasictheoryofGISabouttheconcept,datastructureanditsevolution.Moreover,thesuperiorityintroducingGISintothelogisticdecisionmakingismentioned.Chaptertwofocusesontheprovenienceanddevelopmentofthenetworklogisticmodelandthenewestresearchofthealgorithms,algorithmcomplexityanalysis.Chapterthreeemphasizesonthedesignofroadtopologynetwork.Itobtainsaroadmapafterpretreatment,then,putsforwarda‘node-arc’modeltostorethetransportationtopologynetworkwhichisthebasisofthesequentresearchonnetworklogisticmodelandthekeytodeterminetheexecutingefficiency.ChapterfouranalyzesthealgorithmsofpathoptimizationbasedonGIS,improvesthealgorithmofDijkstraandappliesittopathoptimizationonGIS.GIS8ChapterfiveworksonthenetworklogisticmodelbasedonGIS.Itbringsforwardthealgorithmtotransferthetransportationprobleminvolvingspatialdatatothestandardtransportationnetworkandresolvesthemaximalflowsatlowestcostonitwithobject-orientedmethods.Theconclusiongivesussomedirectionsoffurtherstudyingnetworklogisticmodel,andlookingforwardtotheprospectofapplyingGIS/GPStothemodernlogistics.Inpracticeaspect,byapplyingtotheroadmapinshanghaiurbandistrict,allmodelsandrelativealgorithmsthepaperputsforwardarerealizedwithobject-orientedmethod,whichusesMIF/MIDfilesastheirdatasource.Theseareprovedtobeeffectiveandpracticable.KEYWORDS:GIS,networklogisticmodel,Dijkstraalgorithm,transportationproblems,maximalflowsatlowestcostGIS2004113GIS3GIS11.1[4][]GIS21231.2GIS1.2.1GISGIS3,GIS,1.2.2GISGIS4GISGUISDBMSGISGIS5GISWebGISGISARC/INFOGISGISGISGIS61.3GISGIS1-5GISGISGIS71-5Figure1-5everysegmentofthelogisticsGIS[3]123NM41.4GIS81.51.5.1GIS91.5.2GIS102.12.1.1GIS112.1.22.22.2.1iA),,2,1(miL=GIS12iajB),,2,1(njL=jbiAjBijpiajbijp0≥njmi,,2,1;,,2,1LL==1B2BnB1A11p12pnp11a2A21p22pnp22aMMMMMmA1mp2mpmnpma1b2bnbijxiAjBiAiAiaijxmiaxnjiij,,2,11L=≤∑=jBjBjbijx∑==≥mijijnjbx1,,2,1L∑∑===minjijijxpZ11[4]∑∑===minjijijxpZ11minGIS13⎪⎪⎪⎩⎪⎪⎪⎨⎧==≥=≤=≥∑∑==),,1;,,1(0,,1,,1..11njmixmiaxnjbxtsijnjiijmijijLLLL),,2,1(0),,,2,1(0njbmiajiLL==∑∑===njjmiiba11∑∑===minjijijxpZ11min⎪⎪⎪⎩⎪⎪⎪⎨⎧==≥====∑∑==),,1;,,1(0,,1,,1..11njmixmiaxnjbxtsijnjiijmijijLLLLmn+mn()TmnmmnnxxxxxxxxxxLLLL212222111211=()TmnmmnnppppppppppLLLL212222111211=()TmnmmnncccccccccALLLL212222111211=()TnmbbbaaabLL2121=∑∑===njjmiiba11),,2,1;,,2,1(njmieecmjiijLL==+=+iemn+0..min≥=xbAxtsxpTGIS14⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎦⎤⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎣⎡=⎟⎟⎠⎞⎜⎜⎝⎛+111111111111111111212222111211mnmmnnmnnmxxxxxxxxxAOLLOLOLLOLL)()(mnnm×+ijx2.2.2⎥⎥⎥⎥⎥⎥⎦⎤⎢⎢⎢⎢⎢⎢⎣⎡=nnnIIIEEEALLLLLL111000001E1n()1111L=EnIn21.21.231.2A)1(-+nm4A1±051.1∑∑==-njjmiiba11),,2,1(0'1,mipniL==+nGIS15∑∑==-miinjjab11),,2,1(0',1njpjmL==+2.2.3GIS16GIS17ijx2.2.4mn1972KleeMinty)2(nmnO×NPGIS182.32.3.1N=V,A,U,CVAUCMCTP∑∑=∈rkAjikijkijfc1),(min⎪⎪⎪⎪⎪⎩⎪⎪⎪⎪⎪⎨⎧∈∀≥∈≤-=-=-=-∑∑∑∑∑∑∑======AjikxAjiufkjbffiffkiafftskijijrkkijmjkjmjkjikijmjmjkjikijmjkimjkjikij),(,0),(0..111111kijfkijcGIS19ijukiakjb2.3.22.3.3svtvGIS202.3.4)(2CUnmOGIS21GIS223.1GISGIS[12]MapInfoMIF/MIDMapInfo3-1Figure3-1themapsketchofroadseparationandnodematchingMapInfoMapBasicContainsABBAContainsEntireABWithinABEntirelyWithinABIntersectsAB[13]GIS23MapBasicIntersectNodes[38]MapBasic3-2Figure3-2theflowcharttoseektheintersectionsGIS243.23.2.1[14]ADTGraph{DataN{Vi}E{Ei}R={NR}NR={ViVj|(ViVjN)LViVjE}OperationsInsertVertex(&GVi)//ViGInsertEdge(&GEi)//EiGGetBeighbors(GVi)//GViGetWeight(GEi)//EiG0}ViVjViVjLViVjViVj3.2.2VE[14]110,,-mVVVLmm×GIS253-112)*(2nmnO+1212)(mnO+)*(mnO12123-1Table3-1thecomparisonamongseveralstoragestructureofthegraphGISGIS{}+{}3.3GIS263.3.1GISMIF/MIDMapInfoMapInfoGIS[3]MapInfoMIF/MIDMapInfoMapInfoMIFMIDMIF/MIDASCIIMapInfoI