基于增强拉格朗日乘子法的容量制约交通分配问题研究.pdfVIP

第 31 卷增刊 1 重庆交通大学学报(自然科学版) Vol. 31 Supp.l 2012 圭立且 JOURNAL OF CHO~GOING JIA矿fONG UNIVERSrrrUiA[IJ RAL SC!E:1CE) Jun.2012 001: 10. 3969/j. issn. 1674-创96. 2012. supp. 1.03 Study on Capacity-Constrained Traffic Assignment ?ased on Augmented Lagrange Multiplier pu En u w -E EL e gu e e WD n n n 且 (School of Traffic Transportation , Southe皿 University ， Nanjing 21α酬， Jiangsu , China) Abstract: The traffic 幽signment problem (TAP) is traditionally defined without side constraints. In fact , link and network have their intrinsic cap缸ity. The trad山onal u回r equilibrium model allows mo四 traffic Ilow than capacity , which is c1early unre翩。nable. Firstly , the origin-ba酣d a1gorithm including 血由m巧皿d efficient implemenlation w出 introJu‘，ed. And the traffic assignment w田 made with a network example. Then 由e augmented Lagrange mulliplier method w副 used 10 made lraf- fic assigmnent of lhe network wilh the link capacity conslrain恒. The results of the two me血ods were compared with each oth- er. The augmented Lagrange multiplier method has 喜剧d convergence performance and efficiency. The comparison results show that the latter h嗣 rnore practical significant , which can be better applied in actual traffic as