外文翻译 外文文献 英文文献 基于互联网的连锁企业的物流管理系统Word格式.docx

1、aJAVAWebappletequippedwithinteractivecommunicationcapabilitiesbetweenperipheralsoftwaretools.ThesystemwasdevelopeddistributedfashiontechnologyallcomputerplatformsutilizingWebbrowser,focusingondetailedroadnetworkAthenstheneedsCentralFoodMarketenterprises.2004ElsevierLtD.AllrightsreserveD.Keywords:Dec

2、isionsupportsystem;e-Logistics;Transportation;Vehicleroutingproblem1.IntroductionEnterprisechainsarebusinessmodelpresentfutureregardingmarketsthatinvolvesmallmediumcompanysizes.Clearly,groupingactivitiestowardsafocusedtargetfacilitatesunderstandablyimprovedmarketpenetrationguaranteedbysuccessfultrad

3、emarkleadingfielD.Severalcollaborationmodelsbasicallyincludefranchisingintroducedaspartthisintegratedprocess.Whensuchisorderexploitcommercialideaorinitiativesubsequentlyexpandedgrows,severalissuesariseoperationsentirenetwork.SuchidealplaceorganizingevaluatingmorecentralizedwayseveralordinarysupplyIn

4、fact,toolsprocessesoperationaleachindividualcompany,canbeservicesprovidedtoolofferedeachmemberfacilitatetransactionstacklesimilarly.Web-basedapplicationsstartingfordevelopingapplications.Typicallysystemsservecentraldepotdistributingcommonservicesfieldlogistics.Theapplicationisstoredservergroup.Aprot

5、otypedescribedpreviouswork（Prindezis,Kiranoudis,&Marinos-Kouris,2003）.Thiscompletedinterinstalledwebdealsintegrateddistribution690companiescompriseuniqueretailenterprises.Theunderlinedalgorithmswithinunifiedinternetenvironment.Thesolvedoneinvolvinggoodsthroughfleettrucks.Newinsightsmetaheuristicsemp

6、loyedprovideD.Acharacteristiccasestudypresentedtoillustrateeffectivenessproposedapproachreal-worldofAthens.2.Distributionvehiclefleetsrequiresvehiclesdistributeclients（Tarantilis,Vassiliadis,2003,2004）.Therefore,wasdesignedautomaticallygenerateroutes（whichshouldde-liverwhichcustomersorder）,rational,

7、quantitative,spatialandnon-spatialminimizingsimultaneouslycosttotaldistancetravelledvehicles,subjectfollowingconstraints:lhaspredeterminedloadcapacity,typicallydifferentfromothercomprising（heterogeneousnature）,capacitycannotexceeded,singlesuppliesdemand,numberusedpredetermineobviousvaluedrawnattenti

8、onORcommunity.Itsgreatsuccessattributedfactitveryinterestingbothpracticaltheoreticalpointsview.Regardingpointview,involveddefinitelyplayscentralroleefficiencyplanninglevelmanagement,producingeconomicalcontributereductioncosts,offeringsignificantsavingsexpenses（capital,fueldriversalaries）.ItsImportan

9、celevel,motivatedtensetheoreticaldevelopmentefficientalgorithms.ForacademicresearchersprofessionalsocietiesOR/MS,resultingpapersconcerningVehicleRoutingInformationSystems（VRIS）problem.ThediscussedNP-hardoptimizationproblem,sayglobaloptimumonlyrevealedalgorithmexponentialtimeorspacecomplexitywithresp

10、ectsize.Problemstypedealtheuristictechniques.Researchalgorithms（Tarantilis2001,2002a,2002b）hasmadeconsiderableprogresssincefirstwereearly60s.Amongthem,tabusearchchampion（Laporte,Gendreau,Potvin,Semet,2000）.Themostpowerfulalgorithmsarenowcapablesolvingsizeevenlargesizeinstancesextremelycomputationale

11、nvironmentstime.Onalgorithmicside,probablycomeconcentratefaster,simpler（withfewparameters）robustalgorithms,ifcauseslossqualitysolution.Theseattributesessentialimplementedpackage.beyondnature.Asmentionedbefore,revealguaranteedoptimum,timeleftproposesolutionutmostimportanceproblem.Certainly,theretrade

12、-offexpectedinductionitsquality.Thisstraightforwardway.Ifaskeduserproducehighinstantly,thenaggressivestrategyimplementeD.Ifrelaxesobtained,solutioneffciently,roomelaboratetwodistinctparts.Thegeneralizedrouteconstructioncreatesgoodsubsequentphase.Thetakesintoaccountpeculiaritiesnaturedesirehisowndesi

13、re,ownedhired,accordinghisdailyneeds.GeneralizedRouteConstructionAlgorithmemployed,two-phasealgorithmwhereunroutedinsertedalreadyconstructedpartialsolutions.Thesetsolutionsinitiallyempty,seedroutethatcontainsdepot.RivalnodesexamineAllcustomers.Theinsertionprocedureutilizescriteriac1（i,u,j）c2（i,u,j）i

14、nsertnewcustomerutwoadjacentijcurrentroute.Thecriterionfindsbestfeasible（i*,j）minimizesClarkWrightsavingcalculationinsertingnodespecificpoint,C1（i,u,j）=d（I,u）+d（u,j）-d（I,j）（1）Informula,expressiond（k,l）standsactualcoveringkl.Thesavingcalculationphaseservesstrongintensificationtechniqueinitialconstruc

15、tionsquality,componentutmostnecessityimprovementprocedure.secondidentificationbestinsertednodepair（i,jfound（Solomon,1987）.Fromrivalnodes,selectedmaximizesexpressionC2,u,j）=d（0,u）+d（u,0）-C1（i（2）0denotesnode.Thetravellingdistancedirectlyfrom/toto/additionalexpressedcriterion.Inall,seekspossibleseedswhendetected,insertenofound,route,containingdepot,iteratesuntilnodes.Itmuststretchedwayfilledupguidedregardingutilizationvehicles.Thatsay,sorteddispatcher.Vehicles（regardingaspectsavailability）willloadedbeforeotherslowerimportanceuser.Typically,usersinterviewedex