交通網(wǎng)絡(luò)平衡配流問題的研究.pdf

1、大連理工大學(xué)碩士學(xué)位論文交通網(wǎng)絡(luò)平衡配流問題的研究姓名：張永強(qiáng)申請學(xué)位級別：碩士專業(yè)：計算機(jī)軟件指導(dǎo)教師：譚國真2001.6.1奎望塑鱉蘭塹望墮塑望盟里墮∑————————一AbstractNetworkflowassignmentisasignificanttheoricalproblemandanimportantresearchsubjectinthefieldofthecommunicationandwaterresourceI

2、ntheintelligenttransportationsystem，trafficflowassignmentisthecoreofthetrafficregulationandpathchoiceproblemsIthasattractedmanyresearchersBasedontheothers’researchintrafficflowassignment，wedosomeworkasfollows：Inthetheory

3、ofstatictra幣cflowassignment，weformulateacompletelylink—basedvariationalinequality(VI)model，whoseobjectivefunctionandconstraintconditionsdonothavethepathvariablesSincethemodeliscompletelylinkbased，weneednotenumerateallthe

4、pathstoevaluatethismodelThismodelisequivalenttotheuserequilibrium(UE)condition，thatisforeachorigin—destinationpair，thetraveltimeonalltheusedpathsisequalandminimat；thetraveltimeontheunusedpathsisgreaterthanorequaltothemin

5、imaltraveltimeWepresentanoptimalpathchoicealgorithmtosolvetheVImodelanddetermineanoptimalpathforeachvehicleinthetrafficnetworkAnexampleisgiventoshowthatthemodelandthealgorithmarerightandeffectiveInthetheoryofdynamicflowa

6、ssignmentwepresentalink—basedVImodelforthedynamicpathchoiceThismodelsatisfiesthedynamicuseroptimalcondition，ie，foreachOriginDestinationpairthepathtraveltimeexperiencedbytravelersdepartingduringthesameintervalisequalandmi

7、nimalWepresentthenesteddiagonalizationmethodWethenputuDadynamicpathchoicealgorithmtodetermineanoptimalpathforeachvehicleinthetrafficnetworkSincethetramcdemandmatfixisdifficulttoobtainwepresentadiscretetime—dependentmaxim

8、umentropy(ME)approachtoestimatetheorigin—destinationtripmatricesin仃ansitnetworkTheNewtonmethodisappliedtosolvethisoptimizationmodelofMEmodelThensomeefficientalgorithmsanddatastructuresareputup，includingthestorageandappli